/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/n.c40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:55,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:55,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:55,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:55,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:55,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:55,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:55,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:55,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:55,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:55,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:55,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:55,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:55,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:55,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:55,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:55,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:55,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:55,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:55,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:55,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:55,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:55,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:55,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:55,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:55,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:55,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:55,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:55,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:55,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:55,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:55,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:55,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:55,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:55,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:55,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:55,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:55,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:55,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:55,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:55,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:55,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:55,622 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:55,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:55,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:55,624 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:55,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:55,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:55,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:55,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:55,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:55,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:55,627 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:55,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:55,627 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:55,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:55,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:55,628 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:55,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:55,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:55,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:55,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:55,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:55,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:55,630 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:55,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:55,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:55,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:55,972 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:55,973 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:55,974 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c40.c [2020-07-10 20:21:56,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d237fdb9/3408214b7cc748beae8bf7ddac561417/FLAGfefbc828c [2020-07-10 20:21:56,529 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:56,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c [2020-07-10 20:21:56,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d237fdb9/3408214b7cc748beae8bf7ddac561417/FLAGfefbc828c [2020-07-10 20:21:56,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d237fdb9/3408214b7cc748beae8bf7ddac561417 [2020-07-10 20:21:56,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:56,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:56,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:56,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:56,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:56,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:56" (1/1) ... [2020-07-10 20:21:56,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740af49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:56, skipping insertion in model container [2020-07-10 20:21:56,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:56" (1/1) ... [2020-07-10 20:21:56,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:21:56,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:21:57,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:57,180 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:21:57,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:21:57,222 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:21:57,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57 WrapperNode [2020-07-10 20:21:57,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:57,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:21:57,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:21:57,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:21:57,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (1/1) ... [2020-07-10 20:21:57,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:21:57,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:21:57,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:21:57,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:21:57,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:57,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:21:57,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:21:57,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:21:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:21:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:21:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:21:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:21:57,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:21:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:21:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:21:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:21:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:21:57,760 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:21:57,760 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:21:57,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:57 BoogieIcfgContainer [2020-07-10 20:21:57,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:21:57,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:21:57,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:21:57,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:21:57,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:56" (1/3) ... [2020-07-10 20:21:57,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2decacf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:57, skipping insertion in model container [2020-07-10 20:21:57,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:57" (2/3) ... [2020-07-10 20:21:57,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2decacf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:21:57, skipping insertion in model container [2020-07-10 20:21:57,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:21:57" (3/3) ... [2020-07-10 20:21:57,773 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c40.c [2020-07-10 20:21:57,784 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:21:57,792 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:21:57,808 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:21:57,830 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:21:57,831 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:21:57,831 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:21:57,831 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:21:57,831 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:21:57,831 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:21:57,832 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:21:57,832 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:21:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-07-10 20:21:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 20:21:57,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:57,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:57,862 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash 814682400, now seen corresponding path program 1 times [2020-07-10 20:21:57,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:57,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [339782548] [2020-07-10 20:21:57,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:58,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {44#true} is VALID [2020-07-10 20:21:58,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} #valid := #valid[0 := 0]; {44#true} is VALID [2020-07-10 20:21:58,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0 < #StackHeapBarrier; {44#true} is VALID [2020-07-10 20:21:58,284 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {44#true} is VALID [2020-07-10 20:21:58,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {44#true} is VALID [2020-07-10 20:21:58,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {44#true} is VALID [2020-07-10 20:21:58,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {44#true} is VALID [2020-07-10 20:21:58,287 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-10 20:21:58,288 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#true} ~j~0 := 0; {44#true} is VALID [2020-07-10 20:21:58,288 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} ~k~0 := 0; {44#true} is VALID [2020-07-10 20:21:58,289 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-10 20:21:58,290 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#true} {44#true} #61#return; {44#true} is VALID [2020-07-10 20:21:58,297 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {58#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-10 20:21:58,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {44#true} is VALID [2020-07-10 20:21:58,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} #valid := #valid[0 := 0]; {44#true} is VALID [2020-07-10 20:21:58,299 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} assume 0 < #StackHeapBarrier; {44#true} is VALID [2020-07-10 20:21:58,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {44#true} is VALID [2020-07-10 20:21:58,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {44#true} is VALID [2020-07-10 20:21:58,300 INFO L280 TraceCheckUtils]: 6: Hoare triple {44#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {44#true} is VALID [2020-07-10 20:21:58,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {44#true} is VALID [2020-07-10 20:21:58,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-10 20:21:58,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} ~j~0 := 0; {44#true} is VALID [2020-07-10 20:21:58,302 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#true} ~k~0 := 0; {44#true} is VALID [2020-07-10 20:21:58,303 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-10 20:21:58,306 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#true} {44#true} #61#return; {44#true} is VALID [2020-07-10 20:21:58,307 INFO L263 TraceCheckUtils]: 13: Hoare triple {44#true} call #t~ret5 := main(); {44#true} is VALID [2020-07-10 20:21:58,307 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {44#true} is VALID [2020-07-10 20:21:58,308 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#true} ~k~0 := #t~nondet0; {44#true} is VALID [2020-07-10 20:21:58,309 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#true} havoc #t~nondet0; {44#true} is VALID [2020-07-10 20:21:58,309 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-10 20:21:58,311 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-10 20:21:58,311 INFO L280 TraceCheckUtils]: 19: Hoare triple {45#false} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L12-6 {45#false} is VALID [2020-07-10 20:21:58,312 INFO L280 TraceCheckUtils]: 20: Hoare triple {45#false} assume ~k~0 >= 0 && ~k~0 < ~i~0; {45#false} is VALID [2020-07-10 20:21:58,313 INFO L280 TraceCheckUtils]: 21: Hoare triple {45#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L19 {45#false} is VALID [2020-07-10 20:21:58,313 INFO L280 TraceCheckUtils]: 22: Hoare triple {45#false} assume 0 == #t~mem4; {45#false} is VALID [2020-07-10 20:21:58,314 INFO L280 TraceCheckUtils]: 23: Hoare triple {45#false} havoc #t~mem4; {45#false} is VALID [2020-07-10 20:21:58,314 INFO L280 TraceCheckUtils]: 24: Hoare triple {45#false} assume !false; {45#false} is VALID [2020-07-10 20:21:58,322 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-10 20:21:58,327 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:58,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [339782548] [2020-07-10 20:21:58,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:58,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:21:58,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356589273] [2020-07-10 20:21:58,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 20:21:58,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:58,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:21:58,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:58,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:21:58,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:58,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:21:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:58,439 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-07-10 20:21:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:58,708 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-10 20:21:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:21:58,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 20:21:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-10 20:21:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:21:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-10 20:21:58,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-10 20:21:58,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:58,840 INFO L225 Difference]: With dead ends: 54 [2020-07-10 20:21:58,840 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 20:21:58,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:21:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 20:21:58,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-10 20:21:58,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:58,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-10 20:21:58,927 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 20:21:58,927 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 20:21:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:58,932 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 20:21:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 20:21:58,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:58,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:58,933 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 20:21:58,933 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 20:21:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:58,938 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 20:21:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 20:21:58,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:58,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:58,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:58,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 20:21:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2020-07-10 20:21:58,944 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 25 [2020-07-10 20:21:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:58,945 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2020-07-10 20:21:58,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:21:58,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2020-07-10 20:21:58,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 20:21:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 20:21:58,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:58,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:58,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:21:59,000 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1790244750, now seen corresponding path program 1 times [2020-07-10 20:21:59,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:59,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [121033550] [2020-07-10 20:21:59,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:59,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {309#true} is VALID [2020-07-10 20:21:59,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {309#true} #valid := #valid[0 := 0]; {309#true} is VALID [2020-07-10 20:21:59,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#true} assume 0 < #StackHeapBarrier; {309#true} is VALID [2020-07-10 20:21:59,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {309#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {309#true} is VALID [2020-07-10 20:21:59,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {309#true} is VALID [2020-07-10 20:21:59,137 INFO L280 TraceCheckUtils]: 5: Hoare triple {309#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {309#true} is VALID [2020-07-10 20:21:59,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {309#true} is VALID [2020-07-10 20:21:59,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#true} ~i~0 := 0; {309#true} is VALID [2020-07-10 20:21:59,138 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#true} ~j~0 := 0; {309#true} is VALID [2020-07-10 20:21:59,139 INFO L280 TraceCheckUtils]: 9: Hoare triple {309#true} ~k~0 := 0; {309#true} is VALID [2020-07-10 20:21:59,139 INFO L280 TraceCheckUtils]: 10: Hoare triple {309#true} assume true; {309#true} is VALID [2020-07-10 20:21:59,139 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {309#true} {309#true} #61#return; {309#true} is VALID [2020-07-10 20:21:59,142 INFO L263 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {324#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-10 20:21:59,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {309#true} is VALID [2020-07-10 20:21:59,143 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#true} #valid := #valid[0 := 0]; {309#true} is VALID [2020-07-10 20:21:59,143 INFO L280 TraceCheckUtils]: 3: Hoare triple {309#true} assume 0 < #StackHeapBarrier; {309#true} is VALID [2020-07-10 20:21:59,143 INFO L280 TraceCheckUtils]: 4: Hoare triple {309#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {309#true} is VALID [2020-07-10 20:21:59,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {309#true} is VALID [2020-07-10 20:21:59,144 INFO L280 TraceCheckUtils]: 6: Hoare triple {309#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {309#true} is VALID [2020-07-10 20:21:59,144 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {309#true} is VALID [2020-07-10 20:21:59,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#true} ~i~0 := 0; {309#true} is VALID [2020-07-10 20:21:59,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {309#true} ~j~0 := 0; {309#true} is VALID [2020-07-10 20:21:59,145 INFO L280 TraceCheckUtils]: 10: Hoare triple {309#true} ~k~0 := 0; {309#true} is VALID [2020-07-10 20:21:59,146 INFO L280 TraceCheckUtils]: 11: Hoare triple {309#true} assume true; {309#true} is VALID [2020-07-10 20:21:59,146 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {309#true} {309#true} #61#return; {309#true} is VALID [2020-07-10 20:21:59,146 INFO L263 TraceCheckUtils]: 13: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2020-07-10 20:21:59,147 INFO L280 TraceCheckUtils]: 14: Hoare triple {309#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {309#true} is VALID [2020-07-10 20:21:59,147 INFO L280 TraceCheckUtils]: 15: Hoare triple {309#true} ~k~0 := #t~nondet0; {309#true} is VALID [2020-07-10 20:21:59,147 INFO L280 TraceCheckUtils]: 16: Hoare triple {309#true} havoc #t~nondet0; {309#true} is VALID [2020-07-10 20:21:59,148 INFO L280 TraceCheckUtils]: 17: Hoare triple {309#true} ~i~0 := 0; {323#(= 0 ~i~0)} is VALID [2020-07-10 20:21:59,149 INFO L280 TraceCheckUtils]: 18: Hoare triple {323#(= 0 ~i~0)} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L12-5 {323#(= 0 ~i~0)} is VALID [2020-07-10 20:21:59,150 INFO L280 TraceCheckUtils]: 19: Hoare triple {323#(= 0 ~i~0)} assume !(0 != #t~mem1); {323#(= 0 ~i~0)} is VALID [2020-07-10 20:21:59,151 INFO L280 TraceCheckUtils]: 20: Hoare triple {323#(= 0 ~i~0)} havoc #t~mem1; {323#(= 0 ~i~0)} is VALID [2020-07-10 20:21:59,152 INFO L280 TraceCheckUtils]: 21: Hoare triple {323#(= 0 ~i~0)} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L12-6 {323#(= 0 ~i~0)} is VALID [2020-07-10 20:21:59,153 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#(= 0 ~i~0)} assume ~k~0 >= 0 && ~k~0 < ~i~0; {310#false} is VALID [2020-07-10 20:21:59,153 INFO L280 TraceCheckUtils]: 23: Hoare triple {310#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L19 {310#false} is VALID [2020-07-10 20:21:59,154 INFO L280 TraceCheckUtils]: 24: Hoare triple {310#false} assume 0 == #t~mem4; {310#false} is VALID [2020-07-10 20:21:59,154 INFO L280 TraceCheckUtils]: 25: Hoare triple {310#false} havoc #t~mem4; {310#false} is VALID [2020-07-10 20:21:59,154 INFO L280 TraceCheckUtils]: 26: Hoare triple {310#false} assume !false; {310#false} is VALID [2020-07-10 20:21:59,156 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-10 20:21:59,156 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:59,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [121033550] [2020-07-10 20:21:59,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:59,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:21:59,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692578566] [2020-07-10 20:21:59,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-10 20:21:59,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:59,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:21:59,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:59,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:21:59,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:21:59,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:21:59,200 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 4 states. [2020-07-10 20:21:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,461 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-10 20:21:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 20:21:59,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-10 20:21:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:21:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-10 20:21:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:21:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-10 20:21:59,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2020-07-10 20:21:59,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:59,543 INFO L225 Difference]: With dead ends: 51 [2020-07-10 20:21:59,543 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 20:21:59,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 20:21:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 20:21:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-07-10 20:21:59,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:59,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 37 states. [2020-07-10 20:21:59,599 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 37 states. [2020-07-10 20:21:59,599 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 37 states. [2020-07-10 20:21:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,603 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-10 20:21:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-10 20:21:59,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:59,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:59,605 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 43 states. [2020-07-10 20:21:59,605 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 43 states. [2020-07-10 20:21:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:59,609 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-10 20:21:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-10 20:21:59,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:59,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:59,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:59,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 20:21:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-07-10 20:21:59,614 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 27 [2020-07-10 20:21:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:59,615 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-07-10 20:21:59,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:21:59,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2020-07-10 20:21:59,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:21:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-10 20:21:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 20:21:59,671 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:59,671 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:21:59,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:21:59,672 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash -189710638, now seen corresponding path program 1 times [2020-07-10 20:21:59,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:59,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [792628206] [2020-07-10 20:21:59,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:59,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {607#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {591#true} is VALID [2020-07-10 20:21:59,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {591#true} #valid := #valid[0 := 0]; {591#true} is VALID [2020-07-10 20:21:59,914 INFO L280 TraceCheckUtils]: 2: Hoare triple {591#true} assume 0 < #StackHeapBarrier; {591#true} is VALID [2020-07-10 20:21:59,915 INFO L280 TraceCheckUtils]: 3: Hoare triple {591#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {591#true} is VALID [2020-07-10 20:21:59,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {591#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,916 INFO L280 TraceCheckUtils]: 5: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,918 INFO L280 TraceCheckUtils]: 7: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~i~0 := 0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~j~0 := 0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,920 INFO L280 TraceCheckUtils]: 9: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~k~0 := 0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,924 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {591#true} #61#return; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,927 INFO L263 TraceCheckUtils]: 0: Hoare triple {591#true} call ULTIMATE.init(); {607#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-10 20:21:59,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {607#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {591#true} is VALID [2020-07-10 20:21:59,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {591#true} #valid := #valid[0 := 0]; {591#true} is VALID [2020-07-10 20:21:59,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {591#true} assume 0 < #StackHeapBarrier; {591#true} is VALID [2020-07-10 20:21:59,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {591#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {591#true} is VALID [2020-07-10 20:21:59,935 INFO L280 TraceCheckUtils]: 5: Hoare triple {591#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,936 INFO L280 TraceCheckUtils]: 6: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,937 INFO L280 TraceCheckUtils]: 7: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,938 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~i~0 := 0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~j~0 := 0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,940 INFO L280 TraceCheckUtils]: 10: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~k~0 := 0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,941 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {591#true} #61#return; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,942 INFO L263 TraceCheckUtils]: 13: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} call #t~ret5 := main(); {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,945 INFO L280 TraceCheckUtils]: 15: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~k~0 := #t~nondet0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,946 INFO L280 TraceCheckUtils]: 16: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} havoc #t~nondet0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,946 INFO L280 TraceCheckUtils]: 17: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} ~i~0 := 0; {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 20:21:59,952 INFO L280 TraceCheckUtils]: 18: Hoare triple {605#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L12-5 {606#(= 0 |main_#t~mem1|)} is VALID [2020-07-10 20:21:59,953 INFO L280 TraceCheckUtils]: 19: Hoare triple {606#(= 0 |main_#t~mem1|)} assume !!(0 != #t~mem1); {592#false} is VALID [2020-07-10 20:21:59,954 INFO L280 TraceCheckUtils]: 20: Hoare triple {592#false} havoc #t~mem1; {592#false} is VALID [2020-07-10 20:21:59,954 INFO L280 TraceCheckUtils]: 21: Hoare triple {592#false} SUMMARY for call #t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L13 {592#false} is VALID [2020-07-10 20:21:59,955 INFO L280 TraceCheckUtils]: 22: Hoare triple {592#false} SUMMARY for call write~int(#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L13-1 {592#false} is VALID [2020-07-10 20:21:59,955 INFO L280 TraceCheckUtils]: 23: Hoare triple {592#false} havoc #t~mem2; {592#false} is VALID [2020-07-10 20:21:59,955 INFO L280 TraceCheckUtils]: 24: Hoare triple {592#false} #t~post3 := ~i~0; {592#false} is VALID [2020-07-10 20:21:59,956 INFO L280 TraceCheckUtils]: 25: Hoare triple {592#false} ~i~0 := 1 + #t~post3; {592#false} is VALID [2020-07-10 20:21:59,956 INFO L280 TraceCheckUtils]: 26: Hoare triple {592#false} havoc #t~post3; {592#false} is VALID [2020-07-10 20:21:59,957 INFO L280 TraceCheckUtils]: 27: Hoare triple {592#false} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L12-5 {592#false} is VALID [2020-07-10 20:21:59,958 INFO L280 TraceCheckUtils]: 28: Hoare triple {592#false} assume !(0 != #t~mem1); {592#false} is VALID [2020-07-10 20:21:59,958 INFO L280 TraceCheckUtils]: 29: Hoare triple {592#false} havoc #t~mem1; {592#false} is VALID [2020-07-10 20:21:59,958 INFO L280 TraceCheckUtils]: 30: Hoare triple {592#false} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L12-6 {592#false} is VALID [2020-07-10 20:21:59,959 INFO L280 TraceCheckUtils]: 31: Hoare triple {592#false} assume ~k~0 >= 0 && ~k~0 < ~i~0; {592#false} is VALID [2020-07-10 20:21:59,959 INFO L280 TraceCheckUtils]: 32: Hoare triple {592#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L19 {592#false} is VALID [2020-07-10 20:21:59,959 INFO L280 TraceCheckUtils]: 33: Hoare triple {592#false} assume 0 == #t~mem4; {592#false} is VALID [2020-07-10 20:21:59,960 INFO L280 TraceCheckUtils]: 34: Hoare triple {592#false} havoc #t~mem4; {592#false} is VALID [2020-07-10 20:21:59,960 INFO L280 TraceCheckUtils]: 35: Hoare triple {592#false} assume !false; {592#false} is VALID [2020-07-10 20:21:59,971 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-10 20:21:59,971 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:59,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [792628206] [2020-07-10 20:21:59,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:59,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:59,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467583740] [2020-07-10 20:21:59,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-10 20:21:59,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:59,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:22:00,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:22:00,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:00,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:22:00,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:22:00,032 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 5 states. [2020-07-10 20:22:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,268 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-10 20:22:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:22:00,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-10 20:22:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-10 20:22:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-10 20:22:00,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-10 20:22:00,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,332 INFO L225 Difference]: With dead ends: 37 [2020-07-10 20:22:00,332 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:00,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:22:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:00,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:00,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:00,334 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:00,334 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,335 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:00,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:00,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:00,337 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:00,337 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:00,338 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:00,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:00,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:00,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:00,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:00,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-10 20:22:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:00,339 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:00,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:22:00,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:00,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:00,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:00,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:00,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:00,786 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:00,786 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:00,786 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-10 20:22:00,786 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|)) [2020-07-10 20:22:00,787 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) [2020-07-10 20:22:00,787 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-10 20:22:00,787 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-10 20:22:00,787 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-10 20:22:00,787 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-10 20:22:00,788 INFO L264 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) [2020-07-10 20:22:00,788 INFO L264 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)) [2020-07-10 20:22:00,788 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-10 20:22:00,788 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:00,789 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-10 20:22:00,789 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:00,789 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:00,789 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 8 23) the Hoare annotation is: true [2020-07-10 20:22:00,789 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,789 INFO L264 CegarLoopResult]: At program point L19-1(lines 19 20) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,790 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,790 INFO L271 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: true [2020-07-10 20:22:00,790 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,790 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 8 23) the Hoare annotation is: true [2020-07-10 20:22:00,790 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,790 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))))) [2020-07-10 20:22:00,791 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,791 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= |#memory_int| |old(#memory_int)|) (= ~k~0 |old(~k~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,791 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))))) [2020-07-10 20:22:00,791 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,795 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 8 23) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= |#memory_int| |old(#memory_int)|) (= ~k~0 |old(~k~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,795 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,796 INFO L271 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: true [2020-07-10 20:22:00,796 INFO L264 CegarLoopResult]: At program point L16(lines 8 23) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,798 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,798 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,798 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,798 INFO L264 CegarLoopResult]: At program point L12-1(lines 12 15) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 |main_#t~mem1|) (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))))) [2020-07-10 20:22:00,798 INFO L264 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,799 INFO L264 CegarLoopResult]: At program point L12-4(line 12) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,799 INFO L264 CegarLoopResult]: At program point L12-5(lines 12 15) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))))) [2020-07-10 20:22:00,799 INFO L264 CegarLoopResult]: At program point L12-6(lines 12 15) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|)))) [2020-07-10 20:22:00,827 INFO L163 areAnnotationChecker]: CFG has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:22:00,833 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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-10 20:22:00,838 INFO L168 Benchmark]: Toolchain (without parser) took 3914.28 ms. Allocated memory was 137.9 MB in the beginning and 249.0 MB in the end (delta: 111.1 MB). Free memory was 103.5 MB in the beginning and 201.2 MB in the end (delta: -97.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:00,839 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:00,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.75 ms. Allocated memory is still 137.9 MB. Free memory was 103.0 MB in the beginning and 92.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:00,840 INFO L168 Benchmark]: Boogie Preprocessor took 142.18 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.8 MB in the beginning and 179.4 MB in the end (delta: -86.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:00,841 INFO L168 Benchmark]: RCFGBuilder took 398.35 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 157.5 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:00,842 INFO L168 Benchmark]: TraceAbstraction took 3069.18 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 157.5 MB in the beginning and 201.2 MB in the end (delta: -43.7 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:00,846 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.75 ms. Allocated memory is still 137.9 MB. Free memory was 103.0 MB in the beginning and 92.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.18 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 92.8 MB in the beginning and 179.4 MB in the end (delta: -86.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 398.35 ms. Allocated memory is still 201.9 MB. Free memory was 179.4 MB in the beginning and 157.5 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3069.18 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 157.5 MB in the beginning and 201.2 MB in the end (delta: -43.7 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...