/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:32:37,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:32:37,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:32:37,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:32:37,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:32:37,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:32:37,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:32:37,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:32:37,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:32:37,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:32:37,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:32:37,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:32:37,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:32:37,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:32:37,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:32:37,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:32:37,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:32:37,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:32:37,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:32:37,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:32:37,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:32:37,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:32:37,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:32:37,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:32:37,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:32:37,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:32:37,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:32:37,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:32:37,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:32:37,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:32:37,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:32:37,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:32:37,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:32:37,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:32:37,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:32:37,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:32:37,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:32:37,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:32:37,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:32:37,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:32:37,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:32:37,147 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:32:37,162 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:32:37,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:32:37,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:32:37,163 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:32:37,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:32:37,163 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:32:37,164 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:32:37,164 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:32:37,164 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:32:37,164 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:32:37,164 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:32:37,165 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:32:37,165 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:32:37,165 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:32:37,165 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:32:37,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:32:37,165 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:32:37,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:32:37,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:32:37,166 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:32:37,166 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:32:37,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:32:37,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:32:37,167 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:32:37,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:32:37,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:32:37,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:32:37,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:32:37,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:32:37,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:32:37,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:32:37,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:32:37,351 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:32:37,351 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:32:37,352 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:32:37,426 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_kAlbBP/tmp/f01217fc6816429c9caa1320817d186e/FLAGdc103efde !SESSION 2020-07-01 12:32:34.905 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_kAlbBP/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-07-01 12:32:37.695 !MESSAGE Indexed 'FLAGdc103efde' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-07-01 12:32:37,778 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:32:37,778 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:32:37,779 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:32:37,786 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_kAlbBP/tmp/f01217fc6816429c9caa1320817d186e/FLAGdc103efde [2020-07-01 12:32:38,221 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_kAlbBP/tmp/f01217fc6816429c9caa1320817d186e [2020-07-01 12:32:38,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:32:38,234 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:32:38,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:32:38,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:32:38,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:32:38,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2f2e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38, skipping insertion in model container [2020-07-01 12:32:38,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:32:38,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:32:38,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:32:38,509 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:32:38,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:32:38,544 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:32:38,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38 WrapperNode [2020-07-01 12:32:38,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:32:38,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:32:38,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:32:38,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:32:38,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:32:38,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:32:38,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:32:38,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:32:38,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:32:38,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:32:38,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:32:38,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:32:38,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:32:38,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:32:38,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:32:38,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:32:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:32:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:32:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:32:38,971 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:32:38,972 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:32:38,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:32:38 BoogieIcfgContainer [2020-07-01 12:32:38,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:32:38,977 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:32:38,977 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:32:38,979 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:32:38,980 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:32:38" (1/1) ... [2020-07-01 12:32:38,996 INFO L313 BlockEncoder]: Initial Icfg 38 locations, 47 edges [2020-07-01 12:32:38,998 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:32:38,999 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:32:38,999 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:32:39,000 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:32:39,001 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:32:39,002 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:32:39,002 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:32:39,028 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:32:39,059 INFO L200 BlockEncoder]: SBE split 21 edges [2020-07-01 12:32:39,064 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:32:39,066 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:32:39,086 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-07-01 12:32:39,088 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states [2020-07-01 12:32:39,090 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:32:39,090 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:32:39,091 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:32:39,091 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:32:39,092 INFO L313 BlockEncoder]: Encoded RCFG 32 locations, 61 edges [2020-07-01 12:32:39,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:32:39 BasicIcfg [2020-07-01 12:32:39,093 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:32:39,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:32:39,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:32:39,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:32:39,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:32:38" (1/4) ... [2020-07-01 12:32:39,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cedd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:32:39, skipping insertion in model container [2020-07-01 12:32:39,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (2/4) ... [2020-07-01 12:32:39,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cedd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:32:39, skipping insertion in model container [2020-07-01 12:32:39,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:32:38" (3/4) ... [2020-07-01 12:32:39,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cedd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:39, skipping insertion in model container [2020-07-01 12:32:39,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:32:39" (4/4) ... [2020-07-01 12:32:39,101 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:32:39,112 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:32:39,119 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-01 12:32:39,133 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-01 12:32:39,156 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:32:39,156 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:32:39,156 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:32:39,156 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:32:39,157 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:32:39,157 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:32:39,157 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:32:39,157 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:32:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-01 12:32:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:32:39,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:39,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:39,180 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash 222869673, now seen corresponding path program 1 times [2020-07-01 12:32:39,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:39,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985027656] [2020-07-01 12:32:39,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:39,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985027656] [2020-07-01 12:32:39,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:39,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:39,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527821835] [2020-07-01 12:32:39,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:32:39,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:39,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,401 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-01 12:32:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:39,532 INFO L93 Difference]: Finished difference Result 32 states and 61 transitions. [2020-07-01 12:32:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:39,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:32:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:39,547 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:32:39,548 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:32:39,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:32:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:32:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:32:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 59 transitions. [2020-07-01 12:32:39,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 59 transitions. Word has length 5 [2020-07-01 12:32:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:39,591 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 59 transitions. [2020-07-01 12:32:39,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:32:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 59 transitions. [2020-07-01 12:32:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:32:39,592 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:39,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:39,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:32:39,593 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:39,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:39,593 INFO L82 PathProgramCache]: Analyzing trace with hash 222869675, now seen corresponding path program 1 times [2020-07-01 12:32:39,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:39,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214224319] [2020-07-01 12:32:39,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:39,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214224319] [2020-07-01 12:32:39,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:39,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:32:39,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690940483] [2020-07-01 12:32:39,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:39,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:39,637 INFO L87 Difference]: Start difference. First operand 31 states and 59 transitions. Second operand 4 states. [2020-07-01 12:32:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:39,722 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2020-07-01 12:32:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:39,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:32:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:39,740 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:32:39,740 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:32:39,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:32:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:32:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:32:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2020-07-01 12:32:39,746 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 58 transitions. Word has length 5 [2020-07-01 12:32:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:39,747 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 58 transitions. [2020-07-01 12:32:39,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 58 transitions. [2020-07-01 12:32:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:32:39,748 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:39,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:39,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:32:39,748 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash 222869676, now seen corresponding path program 1 times [2020-07-01 12:32:39,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:39,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370488750] [2020-07-01 12:32:39,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:39,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370488750] [2020-07-01 12:32:39,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:39,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:39,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985349878] [2020-07-01 12:32:39,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:32:39,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,787 INFO L87 Difference]: Start difference. First operand 31 states and 58 transitions. Second operand 3 states. [2020-07-01 12:32:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:39,897 INFO L93 Difference]: Finished difference Result 31 states and 58 transitions. [2020-07-01 12:32:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:39,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:32:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:39,899 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:32:39,899 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:32:39,900 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:32:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:32:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:32:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 57 transitions. [2020-07-01 12:32:39,905 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 57 transitions. Word has length 5 [2020-07-01 12:32:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:39,905 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 57 transitions. [2020-07-01 12:32:39,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:32:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 57 transitions. [2020-07-01 12:32:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:32:39,906 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:39,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:32:39,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:32:39,906 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1680976855, now seen corresponding path program 1 times [2020-07-01 12:32:39,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:39,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863638065] [2020-07-01 12:32:39,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:39,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863638065] [2020-07-01 12:32:39,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:39,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:39,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804105622] [2020-07-01 12:32:39,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:32:39,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:39,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:39,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:39,938 INFO L87 Difference]: Start difference. First operand 30 states and 57 transitions. Second operand 3 states. [2020-07-01 12:32:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,008 INFO L93 Difference]: Finished difference Result 30 states and 57 transitions. [2020-07-01 12:32:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:40,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:32:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,009 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:32:40,009 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:32:40,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:32:40,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:32:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:32:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2020-07-01 12:32:40,014 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 6 [2020-07-01 12:32:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,015 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. [2020-07-01 12:32:40,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:32:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. [2020-07-01 12:32:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:32:40,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:32:40,016 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1680976853, now seen corresponding path program 1 times [2020-07-01 12:32:40,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290473345] [2020-07-01 12:32:40,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290473345] [2020-07-01 12:32:40,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:32:40,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708984719] [2020-07-01 12:32:40,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:40,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:40,061 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand 4 states. [2020-07-01 12:32:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,148 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2020-07-01 12:32:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:40,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:32:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,150 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:32:40,150 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:32:40,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:32:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:32:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:32:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2020-07-01 12:32:40,155 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 6 [2020-07-01 12:32:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,155 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 54 transitions. [2020-07-01 12:32:40,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 54 transitions. [2020-07-01 12:32:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:32:40,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:32:40,157 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1680976852, now seen corresponding path program 1 times [2020-07-01 12:32:40,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730932216] [2020-07-01 12:32:40,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730932216] [2020-07-01 12:32:40,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:40,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568516066] [2020-07-01 12:32:40,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:32:40,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:40,193 INFO L87 Difference]: Start difference. First operand 29 states and 54 transitions. Second operand 3 states. [2020-07-01 12:32:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,270 INFO L93 Difference]: Finished difference Result 29 states and 54 transitions. [2020-07-01 12:32:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:40,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:32:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,272 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:32:40,272 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:32:40,272 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:32:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:32:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:32:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 53 transitions. [2020-07-01 12:32:40,276 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 53 transitions. Word has length 6 [2020-07-01 12:32:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,277 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 53 transitions. [2020-07-01 12:32:40,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:32:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 53 transitions. [2020-07-01 12:32:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:32:40,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:32:40,278 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1338449498, now seen corresponding path program 1 times [2020-07-01 12:32:40,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,279 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019339349] [2020-07-01 12:32:40,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019339349] [2020-07-01 12:32:40,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:40,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514213862] [2020-07-01 12:32:40,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:40,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:40,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:40,333 INFO L87 Difference]: Start difference. First operand 28 states and 53 transitions. Second operand 4 states. [2020-07-01 12:32:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,437 INFO L93 Difference]: Finished difference Result 43 states and 78 transitions. [2020-07-01 12:32:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:40,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-07-01 12:32:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,439 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:32:40,439 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:32:40,439 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:32:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-01 12:32:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:32:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 52 transitions. [2020-07-01 12:32:40,444 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 52 transitions. Word has length 9 [2020-07-01 12:32:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,444 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 52 transitions. [2020-07-01 12:32:40,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 52 transitions. [2020-07-01 12:32:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:32:40,445 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:32:40,446 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1455698902, now seen corresponding path program 1 times [2020-07-01 12:32:40,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359861361] [2020-07-01 12:32:40,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359861361] [2020-07-01 12:32:40,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:40,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796632086] [2020-07-01 12:32:40,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:40,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:40,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:40,486 INFO L87 Difference]: Start difference. First operand 28 states and 52 transitions. Second operand 4 states. [2020-07-01 12:32:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,577 INFO L93 Difference]: Finished difference Result 52 states and 94 transitions. [2020-07-01 12:32:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:40,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 12:32:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,578 INFO L225 Difference]: With dead ends: 52 [2020-07-01 12:32:40,578 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:32:40,579 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:32:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-01 12:32:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:32:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2020-07-01 12:32:40,583 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 10 [2020-07-01 12:32:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,583 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. [2020-07-01 12:32:40,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2020-07-01 12:32:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:32:40,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,584 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:32:40,584 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1455669111, now seen corresponding path program 1 times [2020-07-01 12:32:40,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237894058] [2020-07-01 12:32:40,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237894058] [2020-07-01 12:32:40,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:40,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538587728] [2020-07-01 12:32:40,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:40,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:40,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:40,636 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 5 states. [2020-07-01 12:32:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:40,782 INFO L93 Difference]: Finished difference Result 46 states and 82 transitions. [2020-07-01 12:32:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:40,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:32:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:40,784 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:32:40,784 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 12:32:40,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 12:32:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2020-07-01 12:32:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:32:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 59 transitions. [2020-07-01 12:32:40,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 59 transitions. Word has length 10 [2020-07-01 12:32:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:40,791 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 59 transitions. [2020-07-01 12:32:40,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 59 transitions. [2020-07-01 12:32:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:32:40,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:40,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:40,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:32:40,792 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1455669110, now seen corresponding path program 1 times [2020-07-01 12:32:40,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:40,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938437401] [2020-07-01 12:32:40,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:40,838 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938437401] [2020-07-01 12:32:40,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:40,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:40,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393462869] [2020-07-01 12:32:40,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:40,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:40,840 INFO L87 Difference]: Start difference. First operand 31 states and 59 transitions. Second operand 5 states. [2020-07-01 12:32:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,016 INFO L93 Difference]: Finished difference Result 83 states and 158 transitions. [2020-07-01 12:32:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:32:41,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:32:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,018 INFO L225 Difference]: With dead ends: 83 [2020-07-01 12:32:41,018 INFO L226 Difference]: Without dead ends: 61 [2020-07-01 12:32:41,018 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-01 12:32:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2020-07-01 12:32:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:32:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 89 transitions. [2020-07-01 12:32:41,026 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 89 transitions. Word has length 10 [2020-07-01 12:32:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,026 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 89 transitions. [2020-07-01 12:32:41,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 89 transitions. [2020-07-01 12:32:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:32:41,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:32:41,028 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1455669079, now seen corresponding path program 1 times [2020-07-01 12:32:41,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291648207] [2020-07-01 12:32:41,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291648207] [2020-07-01 12:32:41,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:41,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754968711] [2020-07-01 12:32:41,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:41,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:41,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:41,059 INFO L87 Difference]: Start difference. First operand 43 states and 89 transitions. Second operand 4 states. [2020-07-01 12:32:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,163 INFO L93 Difference]: Finished difference Result 67 states and 134 transitions. [2020-07-01 12:32:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:41,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 12:32:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,165 INFO L225 Difference]: With dead ends: 67 [2020-07-01 12:32:41,165 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 12:32:41,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 12:32:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-07-01 12:32:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:32:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 67 transitions. [2020-07-01 12:32:41,170 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 67 transitions. Word has length 10 [2020-07-01 12:32:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,171 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 67 transitions. [2020-07-01 12:32:41,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 67 transitions. [2020-07-01 12:32:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:32:41,172 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:32:41,172 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash 659492474, now seen corresponding path program 1 times [2020-07-01 12:32:41,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212084451] [2020-07-01 12:32:41,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212084451] [2020-07-01 12:32:41,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:41,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158665644] [2020-07-01 12:32:41,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:32:41,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:32:41,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:41,243 INFO L87 Difference]: Start difference. First operand 37 states and 67 transitions. Second operand 6 states. [2020-07-01 12:32:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,407 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2020-07-01 12:32:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:32:41,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 12:32:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,408 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:32:41,408 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 12:32:41,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 12:32:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2020-07-01 12:32:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:32:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2020-07-01 12:32:41,414 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 10 [2020-07-01 12:32:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,414 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 66 transitions. [2020-07-01 12:32:41,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:32:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. [2020-07-01 12:32:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:32:41,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:32:41,415 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash 659492471, now seen corresponding path program 1 times [2020-07-01 12:32:41,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023546979] [2020-07-01 12:32:41,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023546979] [2020-07-01 12:32:41,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:32:41,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205858823] [2020-07-01 12:32:41,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:41,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:41,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:41,452 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. Second operand 4 states. [2020-07-01 12:32:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,546 INFO L93 Difference]: Finished difference Result 37 states and 66 transitions. [2020-07-01 12:32:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:41,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 12:32:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,547 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:32:41,547 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:32:41,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:32:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:32:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:32:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2020-07-01 12:32:41,552 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 10 [2020-07-01 12:32:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,553 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2020-07-01 12:32:41,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2020-07-01 12:32:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:32:41,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:32:41,554 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2118847463, now seen corresponding path program 1 times [2020-07-01 12:32:41,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932727917] [2020-07-01 12:32:41,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932727917] [2020-07-01 12:32:41,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:41,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247075113] [2020-07-01 12:32:41,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:32:41,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:41,581 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand 3 states. [2020-07-01 12:32:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,627 INFO L93 Difference]: Finished difference Result 36 states and 62 transitions. [2020-07-01 12:32:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:41,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-01 12:32:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,629 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:32:41,629 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:32:41,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:32:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 12:32:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 12:32:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2020-07-01 12:32:41,633 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 11 [2020-07-01 12:32:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,634 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2020-07-01 12:32:41,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:32:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2020-07-01 12:32:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:32:41,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:32:41,635 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1030572099, now seen corresponding path program 1 times [2020-07-01 12:32:41,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875172312] [2020-07-01 12:32:41,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875172312] [2020-07-01 12:32:41,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:41,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500590799] [2020-07-01 12:32:41,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:41,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:41,682 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 5 states. [2020-07-01 12:32:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:41,766 INFO L93 Difference]: Finished difference Result 34 states and 57 transitions. [2020-07-01 12:32:41,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:41,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-01 12:32:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:41,767 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:32:41,767 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:32:41,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:32:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:32:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:32:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2020-07-01 12:32:41,771 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 11 [2020-07-01 12:32:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:41,772 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 53 transitions. [2020-07-01 12:32:41,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 53 transitions. [2020-07-01 12:32:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:32:41,772 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:41,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:41,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:32:41,773 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1030572097, now seen corresponding path program 1 times [2020-07-01 12:32:41,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:41,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700606380] [2020-07-01 12:32:41,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:41,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700606380] [2020-07-01 12:32:41,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:41,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:32:41,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867939948] [2020-07-01 12:32:41,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:32:41,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:32:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:41,851 INFO L87 Difference]: Start difference. First operand 32 states and 53 transitions. Second operand 7 states. [2020-07-01 12:32:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,008 INFO L93 Difference]: Finished difference Result 45 states and 74 transitions. [2020-07-01 12:32:42,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:32:42,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-01 12:32:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,009 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:32:42,009 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:32:42,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:32:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:32:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2020-07-01 12:32:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:32:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 60 transitions. [2020-07-01 12:32:42,015 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 60 transitions. Word has length 11 [2020-07-01 12:32:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,015 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 60 transitions. [2020-07-01 12:32:42,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:32:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 60 transitions. [2020-07-01 12:32:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:32:42,016 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:42,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:32:42,016 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:42,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1259688042, now seen corresponding path program 1 times [2020-07-01 12:32:42,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:42,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104080971] [2020-07-01 12:32:42,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104080971] [2020-07-01 12:32:42,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:42,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:42,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068614976] [2020-07-01 12:32:42,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:32:42,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:42,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:32:42,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:42,086 INFO L87 Difference]: Start difference. First operand 36 states and 60 transitions. Second operand 6 states. [2020-07-01 12:32:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,187 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-01 12:32:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:32:42,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-01 12:32:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,188 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:32:42,188 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:32:42,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:42,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:32:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2020-07-01 12:32:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:32:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 59 transitions. [2020-07-01 12:32:42,193 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 59 transitions. Word has length 12 [2020-07-01 12:32:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,193 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 59 transitions. [2020-07-01 12:32:42,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:32:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 59 transitions. [2020-07-01 12:32:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:32:42,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:42,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 12:32:42,195 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash 395544038, now seen corresponding path program 1 times [2020-07-01 12:32:42,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:42,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941619105] [2020-07-01 12:32:42,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941619105] [2020-07-01 12:32:42,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:42,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:42,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232657554] [2020-07-01 12:32:42,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:42,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:42,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:42,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:42,260 INFO L87 Difference]: Start difference. First operand 36 states and 59 transitions. Second operand 5 states. [2020-07-01 12:32:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,321 INFO L93 Difference]: Finished difference Result 41 states and 67 transitions. [2020-07-01 12:32:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:32:42,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-01 12:32:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,322 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:32:42,322 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:32:42,323 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:32:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:32:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:32:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. [2020-07-01 12:32:42,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 57 transitions. Word has length 13 [2020-07-01 12:32:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,327 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 57 transitions. [2020-07-01 12:32:42,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 57 transitions. [2020-07-01 12:32:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:32:42,328 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:42,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 12:32:42,328 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash -620624623, now seen corresponding path program 1 times [2020-07-01 12:32:42,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:42,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018894787] [2020-07-01 12:32:42,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018894787] [2020-07-01 12:32:42,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:42,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:32:42,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586238669] [2020-07-01 12:32:42,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:42,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:42,358 INFO L87 Difference]: Start difference. First operand 36 states and 57 transitions. Second operand 4 states. [2020-07-01 12:32:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,431 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. [2020-07-01 12:32:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:42,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-01 12:32:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,432 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:32:42,432 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 12:32:42,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 12:32:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 12:32:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:32:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2020-07-01 12:32:42,436 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 14 [2020-07-01 12:32:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,437 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 55 transitions. [2020-07-01 12:32:42,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:42,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2020-07-01 12:32:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 12:32:42,437 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:42,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-01 12:32:42,438 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash -620624621, now seen corresponding path program 1 times [2020-07-01 12:32:42,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:42,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873084167] [2020-07-01 12:32:42,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873084167] [2020-07-01 12:32:42,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:42,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:32:42,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044650360] [2020-07-01 12:32:42,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:32:42,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:32:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:42,496 INFO L87 Difference]: Start difference. First operand 35 states and 55 transitions. Second operand 6 states. [2020-07-01 12:32:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,630 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2020-07-01 12:32:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:32:42,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-01 12:32:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,631 INFO L225 Difference]: With dead ends: 39 [2020-07-01 12:32:42,632 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 12:32:42,632 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 12:32:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-01 12:32:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:32:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2020-07-01 12:32:42,636 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 14 [2020-07-01 12:32:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,636 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2020-07-01 12:32:42,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:32:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2020-07-01 12:32:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:32:42,637 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:42,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-01 12:32:42,637 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:42,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1107468873, now seen corresponding path program 1 times [2020-07-01 12:32:42,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:42,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707957589] [2020-07-01 12:32:42,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707957589] [2020-07-01 12:32:42,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:42,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:32:42,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249912006] [2020-07-01 12:32:42,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:32:42,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:42,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:32:42,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:42,667 INFO L87 Difference]: Start difference. First operand 37 states and 57 transitions. Second operand 4 states. [2020-07-01 12:32:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:42,734 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2020-07-01 12:32:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:42,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-01 12:32:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:42,736 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:32:42,736 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:32:42,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:32:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:32:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-01 12:32:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:32:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2020-07-01 12:32:42,740 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2020-07-01 12:32:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:42,741 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2020-07-01 12:32:42,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:32:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2020-07-01 12:32:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:32:42,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:42,741 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:42,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-01 12:32:42,742 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1110505885, now seen corresponding path program 1 times [2020-07-01 12:32:42,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:42,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857986954] [2020-07-01 12:32:42,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857986954] [2020-07-01 12:32:42,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872185722] [2020-07-01 12:32:42,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:42,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:32:42,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:42,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:42,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:32:42,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562299173] [2020-07-01 12:32:42,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:32:42,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:32:42,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:42,910 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 8 states. [2020-07-01 12:32:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:43,099 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. [2020-07-01 12:32:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:43,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-01 12:32:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:43,100 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:32:43,100 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:32:43,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:32:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-07-01 12:32:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:32:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-07-01 12:32:43,105 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 15 [2020-07-01 12:32:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:43,105 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-07-01 12:32:43,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:32:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-07-01 12:32:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:32:43,106 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:43,106 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:43,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-01 12:32:43,307 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:43,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1110505886, now seen corresponding path program 1 times [2020-07-01 12:32:43,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:43,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364924451] [2020-07-01 12:32:43,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:43,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364924451] [2020-07-01 12:32:43,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:43,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:32:43,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760348766] [2020-07-01 12:32:43,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:32:43,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:43,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:32:43,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:32:43,399 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 7 states. [2020-07-01 12:32:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:43,589 INFO L93 Difference]: Finished difference Result 83 states and 131 transitions. [2020-07-01 12:32:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:43,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-01 12:32:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:43,591 INFO L225 Difference]: With dead ends: 83 [2020-07-01 12:32:43,591 INFO L226 Difference]: Without dead ends: 62 [2020-07-01 12:32:43,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:32:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-01 12:32:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 41. [2020-07-01 12:32:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:32:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2020-07-01 12:32:43,595 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 15 [2020-07-01 12:32:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:43,596 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2020-07-01 12:32:43,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:32:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2020-07-01 12:32:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:32:43,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:43,596 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:43,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-01 12:32:43,597 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1866562807, now seen corresponding path program 1 times [2020-07-01 12:32:43,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:43,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256527307] [2020-07-01 12:32:43,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:43,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256527307] [2020-07-01 12:32:43,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126793391] [2020-07-01 12:32:43,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:43,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 12:32:43,773 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:43,792 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:32:43,841 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:43,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:32:43,850 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:43,867 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,870 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:32:43,871 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 12:32:43,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 12:32:43,960 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,961 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:43,979 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:43,981 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:43,984 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:43,985 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:43,986 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:32:44,022 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:44,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:44,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-01 12:32:44,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217876364] [2020-07-01 12:32:44,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 12:32:44,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:44,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 12:32:44,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:44,027 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 12 states. [2020-07-01 12:32:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:44,515 INFO L93 Difference]: Finished difference Result 52 states and 82 transitions. [2020-07-01 12:32:44,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:32:44,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-07-01 12:32:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:44,516 INFO L225 Difference]: With dead ends: 52 [2020-07-01 12:32:44,516 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 12:32:44,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:32:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 12:32:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2020-07-01 12:32:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 12:32:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2020-07-01 12:32:44,521 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 15 [2020-07-01 12:32:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:44,522 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2020-07-01 12:32:44,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 12:32:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2020-07-01 12:32:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:32:44,522 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:44,522 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:44,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-07-01 12:32:44,723 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2028869858, now seen corresponding path program 1 times [2020-07-01 12:32:44,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:44,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490962119] [2020-07-01 12:32:44,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:44,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490962119] [2020-07-01 12:32:44,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487916970] [2020-07-01 12:32:44,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:44,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-01 12:32:44,901 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:44,907 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_17|], 1=[|v_#valid_28|]} [2020-07-01 12:32:44,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:44,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:44,912 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:44,919 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:44,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:44,927 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:44,935 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:44,936 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:44,936 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-07-01 12:32:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:45,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:45,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2020-07-01 12:32:45,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318233355] [2020-07-01 12:32:45,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-01 12:32:45,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-01 12:32:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:32:45,040 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand 16 states. [2020-07-01 12:32:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:45,610 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2020-07-01 12:32:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:32:45,611 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2020-07-01 12:32:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:45,612 INFO L225 Difference]: With dead ends: 63 [2020-07-01 12:32:45,612 INFO L226 Difference]: Without dead ends: 62 [2020-07-01 12:32:45,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2020-07-01 12:32:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-01 12:32:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2020-07-01 12:32:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:32:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 75 transitions. [2020-07-01 12:32:45,617 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 75 transitions. Word has length 16 [2020-07-01 12:32:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:45,617 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 75 transitions. [2020-07-01 12:32:45,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-01 12:32:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 75 transitions. [2020-07-01 12:32:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:32:45,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:45,618 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:45,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-07-01 12:32:45,819 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:45,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2028869859, now seen corresponding path program 1 times [2020-07-01 12:32:45,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:45,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719943924] [2020-07-01 12:32:45,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:45,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719943924] [2020-07-01 12:32:45,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090435671] [2020-07-01 12:32:45,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:45,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:32:45,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:45,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:45,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:32:45,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950649443] [2020-07-01 12:32:45,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:32:45,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:45,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:32:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:45,952 INFO L87 Difference]: Start difference. First operand 47 states and 75 transitions. Second operand 8 states. [2020-07-01 12:32:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:46,123 INFO L93 Difference]: Finished difference Result 53 states and 81 transitions. [2020-07-01 12:32:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:46,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-01 12:32:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:46,124 INFO L225 Difference]: With dead ends: 53 [2020-07-01 12:32:46,125 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 12:32:46,125 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 12:32:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2020-07-01 12:32:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:32:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2020-07-01 12:32:46,129 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 16 [2020-07-01 12:32:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:46,130 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2020-07-01 12:32:46,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:32:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2020-07-01 12:32:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:32:46,130 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:46,130 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:46,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:46,331 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2028870819, now seen corresponding path program 1 times [2020-07-01 12:32:46,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:46,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367212298] [2020-07-01 12:32:46,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:46,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367212298] [2020-07-01 12:32:46,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279879574] [2020-07-01 12:32:46,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:46,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:32:46,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:46,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:46,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-01 12:32:46,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186645721] [2020-07-01 12:32:46,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:32:46,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:32:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:32:46,414 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand 5 states. [2020-07-01 12:32:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:46,489 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2020-07-01 12:32:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:32:46,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-01 12:32:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:46,490 INFO L225 Difference]: With dead ends: 62 [2020-07-01 12:32:46,490 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:32:46,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:32:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:32:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 12:32:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:32:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2020-07-01 12:32:46,495 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 16 [2020-07-01 12:32:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:46,495 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2020-07-01 12:32:46,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:32:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2020-07-01 12:32:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:32:46,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:46,496 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:46,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-07-01 12:32:46,697 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:46,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 803611320, now seen corresponding path program 1 times [2020-07-01 12:32:46,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:46,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384070282] [2020-07-01 12:32:46,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:46,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384070282] [2020-07-01 12:32:46,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:46,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 12:32:46,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872041457] [2020-07-01 12:32:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:32:46,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:32:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:46,798 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand 8 states. [2020-07-01 12:32:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:46,972 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2020-07-01 12:32:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:46,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-01 12:32:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:46,973 INFO L225 Difference]: With dead ends: 59 [2020-07-01 12:32:46,973 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:32:46,973 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:32:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:32:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:32:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:32:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2020-07-01 12:32:46,977 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 17 [2020-07-01 12:32:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:46,977 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2020-07-01 12:32:46,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:32:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2020-07-01 12:32:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:32:46,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:46,978 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:46,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-07-01 12:32:46,979 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1524839377, now seen corresponding path program 1 times [2020-07-01 12:32:46,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:46,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469910947] [2020-07-01 12:32:46,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:47,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469910947] [2020-07-01 12:32:47,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849805080] [2020-07-01 12:32:47,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:47,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-01 12:32:47,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:47,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:47,202 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:47,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:47,206 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:47,215 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:47,215 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:47,215 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2020-07-01 12:32:47,239 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:47,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:32:47,250 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:47,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:32:47,254 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:47,272 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:47,274 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:32:47,275 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:51 [2020-07-01 12:32:47,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-01 12:32:47,351 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:47,359 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:47,361 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:32:47,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2020-07-01 12:32:47,436 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:47,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2020-07-01 12:32:47,437 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:47,438 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:47,448 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:47,449 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:47,450 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:47,451 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:47,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:23 [2020-07-01 12:32:47,476 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:47,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:47,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-01 12:32:47,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898346004] [2020-07-01 12:32:47,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:32:47,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:32:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:32:47,481 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand 15 states. [2020-07-01 12:32:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:47,938 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2020-07-01 12:32:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:32:47,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2020-07-01 12:32:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:47,939 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:32:47,939 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 12:32:47,940 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2020-07-01 12:32:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 12:32:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-01 12:32:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 12:32:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2020-07-01 12:32:47,944 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 17 [2020-07-01 12:32:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:47,944 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2020-07-01 12:32:47,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:32:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2020-07-01 12:32:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:32:47,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:47,945 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:48,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-07-01 12:32:48,146 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:48,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1524839378, now seen corresponding path program 1 times [2020-07-01 12:32:48,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:48,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105669686] [2020-07-01 12:32:48,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:48,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105669686] [2020-07-01 12:32:48,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083071217] [2020-07-01 12:32:48,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:48,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:32:48,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:48,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:48,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:32:48,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672034339] [2020-07-01 12:32:48,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:32:48,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:48,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:32:48,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:32:48,245 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand 8 states. [2020-07-01 12:32:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:48,382 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2020-07-01 12:32:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:48,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-01 12:32:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:48,383 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:32:48,384 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 12:32:48,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 12:32:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 12:32:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 12:32:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2020-07-01 12:32:48,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 17 [2020-07-01 12:32:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:48,389 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2020-07-01 12:32:48,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:32:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2020-07-01 12:32:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:32:48,389 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:48,390 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:48,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:48,591 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1531107945, now seen corresponding path program 1 times [2020-07-01 12:32:48,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:48,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291276265] [2020-07-01 12:32:48,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:48,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291276265] [2020-07-01 12:32:48,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450826211] [2020-07-01 12:32:48,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:48,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-01 12:32:48,735 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:48,739 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_18|], 1=[|v_#valid_30|]} [2020-07-01 12:32:48,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:48,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:48,743 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:48,750 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:48,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:48,754 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:48,761 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:48,762 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:48,762 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-07-01 12:32:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:48,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:48,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2020-07-01 12:32:48,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607106658] [2020-07-01 12:32:48,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 12:32:48,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:48,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 12:32:48,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:48,816 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand 12 states. [2020-07-01 12:32:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:49,140 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2020-07-01 12:32:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:32:49,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-01 12:32:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:49,141 INFO L225 Difference]: With dead ends: 57 [2020-07-01 12:32:49,141 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 12:32:49,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:32:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 12:32:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2020-07-01 12:32:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 12:32:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-01 12:32:49,146 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 17 [2020-07-01 12:32:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:49,146 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-01 12:32:49,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 12:32:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-01 12:32:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:32:49,147 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:49,147 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:49,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2020-07-01 12:32:49,348 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:49,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1778991872, now seen corresponding path program 1 times [2020-07-01 12:32:49,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:49,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457471200] [2020-07-01 12:32:49,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:49,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457471200] [2020-07-01 12:32:49,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838012802] [2020-07-01 12:32:49,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:49,508 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 12:32:49,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:49,516 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:49,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:32:49,525 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:32:49,530 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:49,545 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,547 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:32:49,547 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2020-07-01 12:32:49,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 12:32:49,610 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:49,611 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:49,623 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:49,624 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:49,625 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:49,626 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:49,626 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2020-07-01 12:32:49,654 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:49,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:49,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-01 12:32:49,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280627416] [2020-07-01 12:32:49,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 12:32:49,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:49,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 12:32:49,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:49,658 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 12 states. [2020-07-01 12:32:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:50,099 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2020-07-01 12:32:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:32:50,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-07-01 12:32:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:50,100 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:32:50,100 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 12:32:50,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:32:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 12:32:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-01 12:32:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 12:32:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-01 12:32:50,105 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 19 [2020-07-01 12:32:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:50,105 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-01 12:32:50,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 12:32:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-01 12:32:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:32:50,105 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:50,106 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:50,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:50,307 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1381723334, now seen corresponding path program 2 times [2020-07-01 12:32:50,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:50,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712955808] [2020-07-01 12:32:50,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:50,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712955808] [2020-07-01 12:32:50,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159947327] [2020-07-01 12:32:50,517 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:50,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:50,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:50,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2020-07-01 12:32:50,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:50,570 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|v_#valid_31|]} [2020-07-01 12:32:50,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:50,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:50,574 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:50,580 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:50,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:50,584 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:50,590 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:50,591 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:50,591 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 12:32:50,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:32:50,612 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:50,616 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:50,616 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:50,616 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-01 12:32:50,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:32:50,639 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:50,644 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:50,645 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:32:50,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2020-07-01 12:32:50,715 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:50,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-07-01 12:32:50,716 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:50,717 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:50,726 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:50,726 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:50,727 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:50,727 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2020-07-01 12:32:50,760 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:32:50,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:50,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-07-01 12:32:50,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514483142] [2020-07-01 12:32:50,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-01 12:32:50,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-01 12:32:50,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:32:50,765 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 16 states. [2020-07-01 12:32:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:51,587 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2020-07-01 12:32:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-01 12:32:51,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-07-01 12:32:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:51,588 INFO L225 Difference]: With dead ends: 55 [2020-07-01 12:32:51,588 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:32:51,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2020-07-01 12:32:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:32:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:32:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:32:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2020-07-01 12:32:51,592 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 20 [2020-07-01 12:32:51,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:51,592 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-07-01 12:32:51,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-01 12:32:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-01 12:32:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-01 12:32:51,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:51,593 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:51,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:51,794 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:51,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1411313343, now seen corresponding path program 2 times [2020-07-01 12:32:51,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:51,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288931891] [2020-07-01 12:32:51,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:52,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288931891] [2020-07-01 12:32:52,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089638247] [2020-07-01 12:32:52,027 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:52,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:52,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:52,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 43 conjunts are in the unsatisfiable core [2020-07-01 12:32:52,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:52,081 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_32|]} [2020-07-01 12:32:52,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:52,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:52,086 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:52,095 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:52,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:52,105 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:52,113 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:52,113 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:52,113 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 12:32:52,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:32:52,146 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:52,151 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:52,152 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:52,152 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-01 12:32:52,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:32:52,200 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:52,207 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:52,207 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:52,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-07-01 12:32:52,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:52,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:32:52,256 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:52,256 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:52,264 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:52,264 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:52,265 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:52,266 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-07-01 12:32:52,296 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:52,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:52,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 12:32:52,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546719178] [2020-07-01 12:32:52,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:32:52,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:52,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:32:52,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:32:52,301 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 17 states. [2020-07-01 12:32:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:53,105 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-01 12:32:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:32:53,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2020-07-01 12:32:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:53,106 INFO L225 Difference]: With dead ends: 38 [2020-07-01 12:32:53,107 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:32:53,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2020-07-01 12:32:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:32:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-01 12:32:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 12:32:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-07-01 12:32:53,110 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 20 [2020-07-01 12:32:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:53,111 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-01 12:32:53,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:32:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2020-07-01 12:32:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 12:32:53,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:53,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:53,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-07-01 12:32:53,312 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -801042984, now seen corresponding path program 2 times [2020-07-01 12:32:53,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:53,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987985337] [2020-07-01 12:32:53,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:32:53,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987985337] [2020-07-01 12:32:53,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754336018] [2020-07-01 12:32:53,424 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:53,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:53,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:53,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-01 12:32:53,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 12:32:53,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:53,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 11 [2020-07-01 12:32:53,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369186970] [2020-07-01 12:32:53,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 12:32:53,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 12:32:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:53,494 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 12 states. [2020-07-01 12:32:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:53,720 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-01 12:32:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:32:53,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-01 12:32:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:53,721 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:32:53,721 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 12:32:53,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:32:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 12:32:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-01 12:32:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:32:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-07-01 12:32:53,725 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 21 [2020-07-01 12:32:53,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:53,725 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-07-01 12:32:53,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 12:32:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-07-01 12:32:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 12:32:53,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:53,726 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:53,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-07-01 12:32:53,926 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:53,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1952087637, now seen corresponding path program 1 times [2020-07-01 12:32:53,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:53,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943042044] [2020-07-01 12:32:53,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:54,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943042044] [2020-07-01 12:32:54,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818722232] [2020-07-01 12:32:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:54,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 45 conjunts are in the unsatisfiable core [2020-07-01 12:32:54,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:54,230 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_21|], 1=[|v_#valid_33|]} [2020-07-01 12:32:54,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:54,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:54,235 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:54,242 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:54,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:54,247 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:54,253 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:54,254 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:54,254 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 12:32:54,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:32:54,286 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:54,290 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:54,291 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:54,291 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-01 12:32:54,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:32:54,337 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:54,343 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:54,344 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:54,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-07-01 12:32:54,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 12:32:54,350 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:54,356 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:54,356 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:32:54,357 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2020-07-01 12:32:54,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:54,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-07-01 12:32:54,430 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:54,430 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:54,444 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:54,445 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:54,445 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:54,446 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2020-07-01 12:32:54,482 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:32:54,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:54,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2020-07-01 12:32:54,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654415500] [2020-07-01 12:32:54,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-01 12:32:54,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-01 12:32:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-07-01 12:32:54,487 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 18 states. [2020-07-01 12:32:55,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:55,359 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2020-07-01 12:32:55,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-01 12:32:55,374 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2020-07-01 12:32:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:55,374 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:32:55,374 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:32:55,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2020-07-01 12:32:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:32:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:32:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:32:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-07-01 12:32:55,378 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 22 [2020-07-01 12:32:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:55,378 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-01 12:32:55,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-01 12:32:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-01 12:32:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 12:32:55,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:55,379 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:55,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-07-01 12:32:55,579 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:55,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:55,580 INFO L82 PathProgramCache]: Analyzing trace with hash 935907169, now seen corresponding path program 2 times [2020-07-01 12:32:55,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:55,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995771200] [2020-07-01 12:32:55,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:55,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995771200] [2020-07-01 12:32:55,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993189832] [2020-07-01 12:32:55,674 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:55,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:55,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:55,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 32 conjunts are in the unsatisfiable core [2020-07-01 12:32:55,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-01 12:32:55,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:32:55,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2020-07-01 12:32:55,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357032375] [2020-07-01 12:32:55,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:32:55,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:55,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:32:55,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:32:55,759 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 6 states. [2020-07-01 12:32:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:55,880 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-01 12:32:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:32:55,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-01 12:32:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:55,881 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:32:55,881 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:32:55,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:32:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:32:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:32:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:32:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-07-01 12:32:55,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 22 [2020-07-01 12:32:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:55,885 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-01 12:32:55,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:32:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-07-01 12:32:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-01 12:32:55,885 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:32:55,885 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:56,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:56,086 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:32:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1758569034, now seen corresponding path program 2 times [2020-07-01 12:32:56,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:56,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520810685] [2020-07-01 12:32:56,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:56,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520810685] [2020-07-01 12:32:56,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916620686] [2020-07-01 12:32:56,288 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:32:56,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:32:56,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:32:56,333 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 41 conjunts are in the unsatisfiable core [2020-07-01 12:32:56,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:32:56,338 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_34|]} [2020-07-01 12:32:56,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:32:56,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:32:56,342 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:56,349 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:56,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:32:56,353 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:56,359 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:56,359 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:32:56,359 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 12:32:56,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:32:56,382 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:56,390 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:56,391 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:32:56,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-07-01 12:32:56,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 12:32:56,456 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:32:56,465 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:56,466 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:32:56,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:19 [2020-07-01 12:32:56,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:56,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 12:32:56,543 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:56,544 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:32:56,557 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:32:56,559 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:32:56,560 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:32:56,561 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:32:56,561 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2020-07-01 12:32:56,597 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:32:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:56,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:32:56,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-01 12:32:56,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900242340] [2020-07-01 12:32:56,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:32:56,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:32:56,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:32:56,603 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2020-07-01 12:32:56,990 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-07-01 12:32:57,312 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-07-01 12:32:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:57,639 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-01 12:32:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 12:32:57,639 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2020-07-01 12:32:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:32:57,640 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:32:57,640 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:32:57,640 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2020-07-01 12:32:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:32:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:32:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:32:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:32:57,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-01 12:32:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:32:57,641 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:32:57,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:32:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:32:57,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:32:57,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-07-01 12:32:57,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:32:58,660 WARN L192 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 75 [2020-07-01 12:32:58,664 INFO L268 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2020-07-01 12:32:58,664 INFO L268 CegarLoopResult]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2020-07-01 12:32:58,664 INFO L268 CegarLoopResult]: For program point L27(lines 27 28) no Hoare annotation was computed. [2020-07-01 12:32:58,665 INFO L268 CegarLoopResult]: For program point L29-3(lines 26 31) no Hoare annotation was computed. [2020-07-01 12:32:58,665 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 33) no Hoare annotation was computed. [2020-07-01 12:32:58,665 INFO L268 CegarLoopResult]: For program point L19-1(lines 19 22) no Hoare annotation was computed. [2020-07-01 12:32:58,665 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse15 (select |#length| ULTIMATE.start_cstrlcpy_~d~0.base)) (.cse6 (select |#length| ULTIMATE.start_cstrlcpy_~s~0.base))) (let ((.cse11 (= ULTIMATE.start_cstrlcpy_~n~0 ULTIMATE.start_cstrlcpy_~siz)) (.cse13 (= 0 ULTIMATE.start_cstrlcpy_~d~0.offset)) (.cse16 (= ULTIMATE.start_cstrlcpy_~s~0.offset 0)) (.cse0 (<= 1 ULTIMATE.start_main_~n~1)) (.cse1 (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~n~1)) (.cse2 (<= 1 ULTIMATE.start_main_~length~0)) (.cse3 (<= 1 ULTIMATE.start_cstrlcpy_~n~0)) (.cse4 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse8 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse9 (= ULTIMATE.start_cstrlcpy_~src.base ULTIMATE.start_cstrlcpy_~s~0.base)) (.cse10 (= 1 (select |#valid| ULTIMATE.start_cstrlcpy_~d~0.base))) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrlcpy_~s~0.base))) (.cse18 (<= (+ ULTIMATE.start_cstrlcpy_~s~0.offset 1) .cse6)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse19 (not (= ULTIMATE.start_cstrlcpy_~d~0.base ULTIMATE.start_cstrlcpy_~s~0.base))) (.cse20 (<= (+ ULTIMATE.start_cstrlcpy_~d~0.offset ULTIMATE.start_cstrlcpy_~n~0) .cse15)) (.cse17 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length~0)) (.cse21 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlcpy_~s~0.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrlcpy_~s~0.base) (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 .cse6) .cse7 .cse8 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlcpy_~s~0.base) ULTIMATE.start_cstrlcpy_~s~0.offset)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_cstrlcpy_~n~0 .cse15) .cse16 .cse17 (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~length~0) 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse19 .cse16 .cse17 .cse20 .cse21) (and .cse0 (<= 1 ULTIMATE.start_cstrlcpy_~d~0.offset) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 ULTIMATE.start_cstrlcpy_~siz)) (<= 1 ULTIMATE.start_cstrlcpy_~s~0.offset) .cse7 .cse8 .cse9 .cse10 .cse12 .cse18 .cse14 .cse19 .cse20 .cse17 .cse21)))) [2020-07-01 12:32:58,665 INFO L268 CegarLoopResult]: For program point L42-1(lines 42 44) no Hoare annotation was computed. [2020-07-01 12:32:58,666 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:32:58,666 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-01 12:32:58,666 INFO L268 CegarLoopResult]: For program point L26(lines 26 31) no Hoare annotation was computed. [2020-07-01 12:32:58,666 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:32:58,666 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 12:32:58,666 INFO L268 CegarLoopResult]: For program point L18(lines 18 23) no Hoare annotation was computed. [2020-07-01 12:32:58,666 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 21) no Hoare annotation was computed. [2020-07-01 12:32:58,666 INFO L268 CegarLoopResult]: For program point L18-1(lines 12 34) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point L47-1(line 47) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:32:58,667 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 48) no Hoare annotation was computed. [2020-07-01 12:32:58,668 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 47) no Hoare annotation was computed. [2020-07-01 12:32:58,668 INFO L268 CegarLoopResult]: For program point L39(lines 39 41) no Hoare annotation was computed. [2020-07-01 12:32:58,668 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:32:58,668 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 48) no Hoare annotation was computed. [2020-07-01 12:32:58,668 INFO L268 CegarLoopResult]: For program point L39-2(lines 36 51) no Hoare annotation was computed. [2020-07-01 12:32:58,668 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 47) no Hoare annotation was computed. [2020-07-01 12:32:58,671 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:32:58,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:58,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:58,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:58,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:58,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:58,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:58,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:58,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:58 BasicIcfg [2020-07-01 12:32:58,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:32:58,711 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:32:58,711 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:32:58,714 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:32:58,715 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:58,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:32:38" (1/5) ... [2020-07-01 12:32:58,716 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@320d1f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:32:58, skipping insertion in model container [2020-07-01 12:32:58,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:58,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:32:38" (2/5) ... [2020-07-01 12:32:58,716 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@320d1f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:32:58, skipping insertion in model container [2020-07-01 12:32:58,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:58,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:32:38" (3/5) ... [2020-07-01 12:32:58,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@320d1f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:32:58, skipping insertion in model container [2020-07-01 12:32:58,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:58,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:32:39" (4/5) ... [2020-07-01 12:32:58,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@320d1f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:32:58, skipping insertion in model container [2020-07-01 12:32:58,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:32:58,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:32:58" (5/5) ... [2020-07-01 12:32:58,719 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:32:58,739 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:32:58,740 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:32:58,740 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:32:58,740 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:32:58,740 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:32:58,740 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:32:58,740 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:32:58,740 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:32:58,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-07-01 12:32:58,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 12:32:58,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:32:58,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:32:58,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:58,754 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:58,754 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:32:58,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2020-07-01 12:32:58,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 12:32:58,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:32:58,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:32:58,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:32:58,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:32:58,761 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [206] ULTIMATE.startENTRY-->L39: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_21| (store |v_#valid_22| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_11, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_21|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~n~1, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret10, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0] 32#L39true [137] L39-->L39-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 27#L39-2true [138] L39-2-->L42-1: Formula: (>= v_ULTIMATE.start_main_~n~1_6 1) InVars {ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} OutVars{ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_6} AuxVars[] AssignedVars[] 16#L42-1true [163] L42-1-->L47: Formula: (let ((.cse0 (store |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_main_#t~malloc8.base_2|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= (store (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~1_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_3|) (= |v_#valid_5| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc9.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc8.offset_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_5|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_3|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~nondetString2~0.offset] 3#L47true [90] L47-->L47-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_2| (store |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_3| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~n~1_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_8, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, #length=|v_#length_6|} AuxVars[] AssignedVars[#memory_int] 24#L47-1true [207] L47-1-->L18: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_cstrlcpy_~dst.offset_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_11|) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (<= .cse0 (select |v_#length_16| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrlcpy_~d~0.offset_7 v_ULTIMATE.start_cstrlcpy_~dst.offset_3) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_9 v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.base_8 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 v_ULTIMATE.start_cstrlcpy_~s~0.offset_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= v_ULTIMATE.start_cstrlcpy_~src.offset_4 |v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_main_~n~1_12) (= |v_ULTIMATE.start_cstrlcpy_#in~src.base_2| v_ULTIMATE.start_cstrlcpy_~src.base_5) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 v_ULTIMATE.start_cstrlcpy_~d~0.base_8) (<= 1 .cse0) (= v_ULTIMATE.start_cstrlcpy_~dst.base_3 |v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#in~siz_2| v_ULTIMATE.start_cstrlcpy_~siz_5) (= v_ULTIMATE.start_cstrlcpy_~n~0_9 v_ULTIMATE.start_cstrlcpy_~siz_5))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_16|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_8|, ULTIMATE.start_cstrlcpy_#t~mem5=|v_ULTIMATE.start_cstrlcpy_#t~mem5_7|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_8|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_7|, ULTIMATE.start_cstrlcpy_#t~post4.base=|v_ULTIMATE.start_cstrlcpy_#t~post4.base_8|, ULTIMATE.start_cstrlcpy_~src.offset=v_ULTIMATE.start_cstrlcpy_~src.offset_4, ULTIMATE.start_cstrlcpy_~src.base=v_ULTIMATE.start_cstrlcpy_~src.base_5, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_8, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_16|, ULTIMATE.start_cstrlcpy_#in~dst.offset=|v_ULTIMATE.start_cstrlcpy_#in~dst.offset_2|, ULTIMATE.start_cstrlcpy_#in~dst.base=|v_ULTIMATE.start_cstrlcpy_#in~dst.base_2|, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_7|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_7, ULTIMATE.start_main_~n~1=v_ULTIMATE.start_main_~n~1_12, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_9, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_7|, ULTIMATE.start_cstrlcpy_#res=|v_ULTIMATE.start_cstrlcpy_#res_4|, ULTIMATE.start_cstrlcpy_~dst.offset=v_ULTIMATE.start_cstrlcpy_~dst.offset_3, ULTIMATE.start_cstrlcpy_~siz=v_ULTIMATE.start_cstrlcpy_~siz_5, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_9, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrlcpy_#in~src.base=|v_ULTIMATE.start_cstrlcpy_#in~src.base_2|, ULTIMATE.start_cstrlcpy_#in~siz=|v_ULTIMATE.start_cstrlcpy_#in~siz_2|, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_8, ULTIMATE.start_cstrlcpy_#t~post4.offset=|v_ULTIMATE.start_cstrlcpy_#t~post4.offset_7|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_cstrlcpy_~dst.base=v_ULTIMATE.start_cstrlcpy_~dst.base_3, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrlcpy_#in~src.offset=|v_ULTIMATE.start_cstrlcpy_#in~src.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3, ULTIMATE.start_cstrlcpy_#t~mem5, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_#t~post4.base, ULTIMATE.start_cstrlcpy_~src.offset, ULTIMATE.start_cstrlcpy_~src.base, ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#in~dst.offset, ULTIMATE.start_cstrlcpy_#in~dst.base, ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~d~0.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post1.offset, ULTIMATE.start_cstrlcpy_#res, ULTIMATE.start_cstrlcpy_~dst.offset, ULTIMATE.start_cstrlcpy_~siz, ULTIMATE.start_cstrlcpy_~n~0, ULTIMATE.start_cstrlcpy_#in~src.base, ULTIMATE.start_cstrlcpy_#in~siz, ULTIMATE.start_cstrlcpy_~d~0.base, ULTIMATE.start_cstrlcpy_#t~post4.offset, #memory_int, ULTIMATE.start_cstrlcpy_~dst.base, ULTIMATE.start_cstrlcpy_#in~src.offset] 10#L18true [173] L18-->L19-3: Formula: (< 0 v_ULTIMATE.start_cstrlcpy_~n~0_4) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_4} AuxVars[] AssignedVars[] 28#L19-3true [2020-07-01 12:32:58,762 INFO L796 eck$LassoCheckResult]: Loop: 28#L19-3true [126] L19-3-->L19-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrlcpy_~n~0_6 (- 1)))) (and (= v_ULTIMATE.start_cstrlcpy_~n~0_5 .cse0) (= |v_ULTIMATE.start_cstrlcpy_#t~pre0_2| .cse0))) InVars {ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_6} OutVars{ULTIMATE.start_cstrlcpy_~n~0=v_ULTIMATE.start_cstrlcpy_~n~0_5, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~n~0] 33#L19-1true [184] L19-1-->L20: Formula: (and (= v_ULTIMATE.start_cstrlcpy_~d~0.base_3 |v_ULTIMATE.start_cstrlcpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2| v_ULTIMATE.start_cstrlcpy_~s~0.offset_7) (= |v_ULTIMATE.start_cstrlcpy_#t~post1.base_2| v_ULTIMATE.start_cstrlcpy_~d~0.base_4) (= v_ULTIMATE.start_cstrlcpy_~d~0.offset_3 (+ |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2| 1)) (< 0 |v_ULTIMATE.start_cstrlcpy_#t~pre0_6|) (= |v_ULTIMATE.start_cstrlcpy_#t~post2.base_2| v_ULTIMATE.start_cstrlcpy_~s~0.base_8) (= v_ULTIMATE.start_cstrlcpy_~s~0.base_7 |v_ULTIMATE.start_cstrlcpy_#t~post2.base_2|) (= v_ULTIMATE.start_cstrlcpy_~s~0.offset_6 (+ |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2| v_ULTIMATE.start_cstrlcpy_~d~0.offset_4)) InVars {ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_8, ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_6|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_4, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_7, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_4} OutVars{ULTIMATE.start_cstrlcpy_#t~pre0=|v_ULTIMATE.start_cstrlcpy_#t~pre0_5|, ULTIMATE.start_cstrlcpy_~d~0.offset=v_ULTIMATE.start_cstrlcpy_~d~0.offset_3, ULTIMATE.start_cstrlcpy_~s~0.offset=v_ULTIMATE.start_cstrlcpy_~s~0.offset_6, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_2|, ULTIMATE.start_cstrlcpy_~d~0.base=v_ULTIMATE.start_cstrlcpy_~d~0.base_3, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_2|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_2|, ULTIMATE.start_cstrlcpy_~s~0.base=v_ULTIMATE.start_cstrlcpy_~s~0.base_7, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~pre0, ULTIMATE.start_cstrlcpy_~d~0.offset, ULTIMATE.start_cstrlcpy_~s~0.offset, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_~d~0.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_~s~0.base, ULTIMATE.start_cstrlcpy_#t~post1.offset] 18#L20true [112] L20-->L20-1: Formula: (and (= 1 (select |v_#valid_15| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|)) (= (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|) |v_ULTIMATE.start_cstrlcpy_#t~mem3_2|) (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_2|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_3|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_3|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3] 15#L20-1true [108] L20-1-->L20-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3| (store (select |v_#memory_int_8| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrlcpy_#t~mem3_3|))) (<= (+ |v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3| 1) (select |v_#length_12| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|)) (= 1 (select |v_#valid_17| |v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|))) InVars {ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_3|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|, #length=|v_#length_12|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_3|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_3|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_3|, #length=|v_#length_12|} AuxVars[] AssignedVars[#memory_int] 12#L20-2true [204] L20-2-->L19-3: Formula: (< 0 |v_ULTIMATE.start_cstrlcpy_#t~mem3_7|) InVars {ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrlcpy_#t~mem3=|v_ULTIMATE.start_cstrlcpy_#t~mem3_6|, ULTIMATE.start_cstrlcpy_#t~post1.offset=|v_ULTIMATE.start_cstrlcpy_#t~post1.offset_6|, ULTIMATE.start_cstrlcpy_#t~post1.base=|v_ULTIMATE.start_cstrlcpy_#t~post1.base_7|, ULTIMATE.start_cstrlcpy_#t~post2.base=|v_ULTIMATE.start_cstrlcpy_#t~post2.base_7|, ULTIMATE.start_cstrlcpy_#t~post2.offset=|v_ULTIMATE.start_cstrlcpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlcpy_#t~mem3, ULTIMATE.start_cstrlcpy_#t~post1.base, ULTIMATE.start_cstrlcpy_#t~post2.base, ULTIMATE.start_cstrlcpy_#t~post2.offset, ULTIMATE.start_cstrlcpy_#t~post1.offset] 28#L19-3true [2020-07-01 12:32:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash -355403805, now seen corresponding path program 1 times [2020-07-01 12:32:58,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:58,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354999226] [2020-07-01 12:32:58,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:32:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:32:58,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354999226] [2020-07-01 12:32:58,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:32:58,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:32:58,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948941175] [2020-07-01 12:32:58,781 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:32:58,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:32:58,781 INFO L82 PathProgramCache]: Analyzing trace with hash 150585525, now seen corresponding path program 1 times [2020-07-01 12:32:58,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:32:58,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112558014] [2020-07-01 12:32:58,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:32:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:32:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:32:58,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:32:58,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:32:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:32:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:32:58,917 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-01 12:32:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:32:58,973 INFO L93 Difference]: Finished difference Result 32 states and 58 transitions. [2020-07-01 12:32:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:32:58,977 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:32:58,983 INFO L168 Benchmark]: Toolchain (without parser) took 20749.87 ms. Allocated memory was 649.6 MB in the beginning and 966.3 MB in the end (delta: 316.7 MB). Free memory was 559.2 MB in the beginning and 661.9 MB in the end (delta: -102.7 MB). Peak memory consumption was 214.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:58,983 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:32:58,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.53 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 559.2 MB in the beginning and 646.3 MB in the end (delta: -87.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:58,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.51 ms. Allocated memory is still 683.7 MB. Free memory was 646.3 MB in the beginning and 644.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:58,985 INFO L168 Benchmark]: Boogie Preprocessor took 27.60 ms. Allocated memory is still 683.7 MB. Free memory was 644.2 MB in the beginning and 642.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:58,985 INFO L168 Benchmark]: RCFGBuilder took 361.81 ms. Allocated memory is still 683.7 MB. Free memory was 642.0 MB in the beginning and 616.6 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:58,985 INFO L168 Benchmark]: BlockEncodingV2 took 116.11 ms. Allocated memory is still 683.7 MB. Free memory was 616.6 MB in the beginning and 606.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:58,986 INFO L168 Benchmark]: TraceAbstraction took 19616.25 ms. Allocated memory was 683.7 MB in the beginning and 966.3 MB in the end (delta: 282.6 MB). Free memory was 605.9 MB in the beginning and 703.5 MB in the end (delta: -97.7 MB). Peak memory consumption was 184.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:58,986 INFO L168 Benchmark]: BuchiAutomizer took 271.05 ms. Allocated memory is still 966.3 MB. Free memory was 703.5 MB in the beginning and 661.9 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:32:58,988 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 38 locations, 47 edges - StatisticsResult: Encoded RCFG 32 locations, 61 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 310.53 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 559.2 MB in the beginning and 646.3 MB in the end (delta: -87.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.51 ms. Allocated memory is still 683.7 MB. Free memory was 646.3 MB in the beginning and 644.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.60 ms. Allocated memory is still 683.7 MB. Free memory was 644.2 MB in the beginning and 642.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 361.81 ms. Allocated memory is still 683.7 MB. Free memory was 642.0 MB in the beginning and 616.6 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 116.11 ms. Allocated memory is still 683.7 MB. Free memory was 616.6 MB in the beginning and 606.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 19616.25 ms. Allocated memory was 683.7 MB in the beginning and 966.3 MB in the end (delta: 282.6 MB). Free memory was 605.9 MB in the beginning and 703.5 MB in the end (delta: -97.7 MB). Peak memory consumption was 184.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 271.05 ms. Allocated memory is still 966.3 MB. Free memory was 703.5 MB in the beginning and 661.9 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2020-07-01 12:32:58,997 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:58,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:59,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:59,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:59,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:59,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:59,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:59,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:59,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:59,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:59,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:32:59,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:59,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,009 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,009 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,009 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:59,009 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,009 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,010 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,010 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,010 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:32:59,010 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:32:59,010 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((1 <= n && unknown-#length-unknown[nondetString1] == n) && 1 <= length) && 1 <= n) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#length-unknown[s]) && 0 == nondetString2) && 0 == nondetString1) && 0 == unknown-#memory_int-unknown[s][s]) && src == s) && 1 == \valid[d]) && n == siz) && 1 == \valid[s]) && 0 == d) && 1 == \valid[nondetString1]) && n <= unknown-#length-unknown[d]) && s == 0) && unknown-#length-unknown[nondetString2] == length) && nondetString2 + length <= 1) || (((((((((((((((((((1 <= n && unknown-#length-unknown[nondetString1] == n) && 1 <= length) && 1 <= n) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 0 == nondetString2) && 0 == nondetString1) && src == s) && 1 == \valid[d]) && n == siz) && 1 == \valid[s]) && s + 1 <= unknown-#length-unknown[s]) && 0 == d) && 1 == \valid[nondetString1]) && !(d == s)) && s == 0) && unknown-#length-unknown[nondetString2] == length) && d + n <= unknown-#length-unknown[d]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1] && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && ULTIMATE.start_main_~nondetString2~0.offset <= 0))) || (((((((((((((((((((1 <= n && 1 <= d) && unknown-#length-unknown[nondetString1] == n) && 1 <= length) && 1 <= n) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && !(0 == siz)) && 1 <= s) && 0 == nondetString2) && 0 == nondetString1) && src == s) && 1 == \valid[d]) && 1 == \valid[s]) && s + 1 <= unknown-#length-unknown[s]) && 1 == \valid[nondetString1]) && !(d == s)) && d + n <= unknown-#length-unknown[d]) && unknown-#length-unknown[nondetString2] == length) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s] + -1] && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && ULTIMATE.start_main_~nondetString2~0.offset <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.6s, OverallIterations: 38, TraceHistogramMax: 3, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 366 SDtfs, 2793 SDslu, 2268 SDs, 0 SdLazy, 4656 SolverSat, 695 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 263 SyntacticMatches, 4 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 130 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 286 HoareAnnotationTreeSize, 1 FomulaSimplifications, 1735 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1173 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 789 NumberOfCodeBlocks, 789 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 736 ConstructedInterpolants, 32 QuantifiedInterpolants, 111249 SizeOfPredicates, 182 NumberOfNonLiveVariables, 2042 ConjunctsInSsa, 404 ConjunctsInUnsatCore, 53 InterpolantComputations, 24 PerfectInterpolantSequences, 38/163 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:32:59.233 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check