/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-267fbe0 [2020-07-18 00:47:52,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:52,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:52,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:52,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:52,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:52,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:52,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:52,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:52,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:52,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:52,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:52,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:52,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:52,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:52,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:52,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:52,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:52,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:52,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:52,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:52,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:52,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:52,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:52,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:52,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:52,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:52,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:52,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:52,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:52,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:52,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:52,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:52,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:52,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:52,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:52,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:52,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:52,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:52,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:52,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:52,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:52,770 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:52,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:52,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:52,772 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:52,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:52,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:52,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:52,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:52,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:52,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:52,774 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:52,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:52,774 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:52,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:52,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:52,775 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:52,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:52,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:52,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:52,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:52,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:52,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:52,776 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:53,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:53,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:53,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:53,058 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:53,059 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:53,059 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-18 00:47:53,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f168bf9c/eba8a336ae7047d69564ffe23715bdd2/FLAG230618870 [2020-07-18 00:47:53,631 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:53,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c [2020-07-18 00:47:53,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f168bf9c/eba8a336ae7047d69564ffe23715bdd2/FLAG230618870 [2020-07-18 00:47:53,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f168bf9c/eba8a336ae7047d69564ffe23715bdd2 [2020-07-18 00:47:53,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:53,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:53,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:53,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:53,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:53,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:53" (1/1) ... [2020-07-18 00:47:53,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffe76b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:53, skipping insertion in model container [2020-07-18 00:47:53,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:53" (1/1) ... [2020-07-18 00:47:53,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:54,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:54,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:54,183 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:54,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:54,230 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:54,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54 WrapperNode [2020-07-18 00:47:54,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:54,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:54,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:54,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:54,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (1/1) ... [2020-07-18 00:47:54,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (1/1) ... [2020-07-18 00:47:54,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (1/1) ... [2020-07-18 00:47:54,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (1/1) ... [2020-07-18 00:47:54,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (1/1) ... [2020-07-18 00:47:54,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (1/1) ... [2020-07-18 00:47:54,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (1/1) ... [2020-07-18 00:47:54,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:54,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:54,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:54,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:54,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (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-18 00:47:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:54,793 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:54,794 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:47:54,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:54 BoogieIcfgContainer [2020-07-18 00:47:54,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:54,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:54,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:54,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:54,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:53" (1/3) ... [2020-07-18 00:47:54,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f06beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:54, skipping insertion in model container [2020-07-18 00:47:54,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:54" (2/3) ... [2020-07-18 00:47:54,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f06beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:54, skipping insertion in model container [2020-07-18 00:47:54,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:54" (3/3) ... [2020-07-18 00:47:54,805 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c40.c [2020-07-18 00:47:54,815 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:54,823 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:54,835 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:54,852 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:54,853 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:54,853 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:54,853 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:54,853 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:54,853 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:54,854 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:54,854 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-07-18 00:47:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 00:47:54,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:54,882 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-18 00:47:54,882 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:54,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash 814682400, now seen corresponding path program 1 times [2020-07-18 00:47:54,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:54,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005906682] [2020-07-18 00:47:54,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:55,256 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-18 00:47:55,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} #valid := #valid[0 := 0]; {44#true} is VALID [2020-07-18 00:47:55,257 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0 < #StackHeapBarrier; {44#true} is VALID [2020-07-18 00:47:55,257 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-18 00:47:55,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {44#true} is VALID [2020-07-18 00:47:55,258 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-18 00:47:55,259 INFO L280 TraceCheckUtils]: 6: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {44#true} is VALID [2020-07-18 00:47:55,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-18 00:47:55,260 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#true} ~j~0 := 0; {44#true} is VALID [2020-07-18 00:47:55,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} ~k~0 := 0; {44#true} is VALID [2020-07-18 00:47:55,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-18 00:47:55,261 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#true} {44#true} #61#return; {44#true} is VALID [2020-07-18 00:47:55,267 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-18 00:47:55,267 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-18 00:47:55,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} #valid := #valid[0 := 0]; {44#true} is VALID [2020-07-18 00:47:55,268 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} assume 0 < #StackHeapBarrier; {44#true} is VALID [2020-07-18 00:47:55,269 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-18 00:47:55,269 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {44#true} is VALID [2020-07-18 00:47:55,269 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-18 00:47:55,270 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {44#true} is VALID [2020-07-18 00:47:55,270 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-18 00:47:55,271 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} ~j~0 := 0; {44#true} is VALID [2020-07-18 00:47:55,271 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#true} ~k~0 := 0; {44#true} is VALID [2020-07-18 00:47:55,272 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-18 00:47:55,272 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#true} {44#true} #61#return; {44#true} is VALID [2020-07-18 00:47:55,273 INFO L263 TraceCheckUtils]: 13: Hoare triple {44#true} call #t~ret5 := main(); {44#true} is VALID [2020-07-18 00:47:55,273 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {44#true} is VALID [2020-07-18 00:47:55,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#true} ~k~0 := #t~nondet0; {44#true} is VALID [2020-07-18 00:47:55,274 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#true} havoc #t~nondet0; {44#true} is VALID [2020-07-18 00:47:55,275 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-18 00:47:55,276 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-18 00:47:55,276 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-18 00:47:55,277 INFO L280 TraceCheckUtils]: 20: Hoare triple {45#false} assume ~k~0 >= 0 && ~k~0 < ~i~0; {45#false} is VALID [2020-07-18 00:47:55,277 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-18 00:47:55,278 INFO L280 TraceCheckUtils]: 22: Hoare triple {45#false} assume 0 == #t~mem4; {45#false} is VALID [2020-07-18 00:47:55,278 INFO L280 TraceCheckUtils]: 23: Hoare triple {45#false} havoc #t~mem4; {45#false} is VALID [2020-07-18 00:47:55,279 INFO L280 TraceCheckUtils]: 24: Hoare triple {45#false} assume !false; {45#false} is VALID [2020-07-18 00:47:55,283 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-18 00:47:55,285 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:55,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005906682] [2020-07-18 00:47:55,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:55,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:55,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40562560] [2020-07-18 00:47:55,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-18 00:47:55,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:55,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:55,358 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-18 00:47:55,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:55,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:55,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:55,370 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-07-18 00:47:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:55,638 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-18 00:47:55,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:55,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-18 00:47:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-18 00:47:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-18 00:47:55,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-18 00:47:55,755 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-18 00:47:55,769 INFO L225 Difference]: With dead ends: 54 [2020-07-18 00:47:55,769 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 00:47:55,773 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-18 00:47:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 00:47:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-18 00:47:55,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:55,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-18 00:47:55,851 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 00:47:55,851 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 00:47:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:55,856 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-18 00:47:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-18 00:47:55,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:55,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:55,858 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 00:47:55,858 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 00:47:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:55,862 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-18 00:47:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-18 00:47:55,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:55,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:55,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:55,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 00:47:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2020-07-18 00:47:55,868 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 25 [2020-07-18 00:47:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:55,869 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2020-07-18 00:47:55,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:55,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2020-07-18 00:47:55,918 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-18 00:47:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-18 00:47:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:47:55,920 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:55,920 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-18 00:47:55,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:55,920 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1790244750, now seen corresponding path program 1 times [2020-07-18 00:47:55,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:55,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [658154172] [2020-07-18 00:47:55,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:56,094 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-18 00:47:56,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {309#true} #valid := #valid[0 := 0]; {309#true} is VALID [2020-07-18 00:47:56,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#true} assume 0 < #StackHeapBarrier; {309#true} is VALID [2020-07-18 00:47:56,096 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-18 00:47:56,096 INFO L280 TraceCheckUtils]: 4: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {309#true} is VALID [2020-07-18 00:47:56,096 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-18 00:47:56,097 INFO L280 TraceCheckUtils]: 6: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {309#true} is VALID [2020-07-18 00:47:56,097 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#true} ~i~0 := 0; {309#true} is VALID [2020-07-18 00:47:56,097 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#true} ~j~0 := 0; {309#true} is VALID [2020-07-18 00:47:56,098 INFO L280 TraceCheckUtils]: 9: Hoare triple {309#true} ~k~0 := 0; {309#true} is VALID [2020-07-18 00:47:56,098 INFO L280 TraceCheckUtils]: 10: Hoare triple {309#true} assume true; {309#true} is VALID [2020-07-18 00:47:56,098 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {309#true} {309#true} #61#return; {309#true} is VALID [2020-07-18 00:47:56,101 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-18 00:47:56,101 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-18 00:47:56,102 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#true} #valid := #valid[0 := 0]; {309#true} is VALID [2020-07-18 00:47:56,102 INFO L280 TraceCheckUtils]: 3: Hoare triple {309#true} assume 0 < #StackHeapBarrier; {309#true} is VALID [2020-07-18 00:47:56,103 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-18 00:47:56,103 INFO L280 TraceCheckUtils]: 5: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {309#true} is VALID [2020-07-18 00:47:56,103 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-18 00:47:56,103 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {309#true} is VALID [2020-07-18 00:47:56,104 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#true} ~i~0 := 0; {309#true} is VALID [2020-07-18 00:47:56,104 INFO L280 TraceCheckUtils]: 9: Hoare triple {309#true} ~j~0 := 0; {309#true} is VALID [2020-07-18 00:47:56,104 INFO L280 TraceCheckUtils]: 10: Hoare triple {309#true} ~k~0 := 0; {309#true} is VALID [2020-07-18 00:47:56,105 INFO L280 TraceCheckUtils]: 11: Hoare triple {309#true} assume true; {309#true} is VALID [2020-07-18 00:47:56,105 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {309#true} {309#true} #61#return; {309#true} is VALID [2020-07-18 00:47:56,105 INFO L263 TraceCheckUtils]: 13: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2020-07-18 00:47:56,106 INFO L280 TraceCheckUtils]: 14: Hoare triple {309#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {309#true} is VALID [2020-07-18 00:47:56,106 INFO L280 TraceCheckUtils]: 15: Hoare triple {309#true} ~k~0 := #t~nondet0; {309#true} is VALID [2020-07-18 00:47:56,106 INFO L280 TraceCheckUtils]: 16: Hoare triple {309#true} havoc #t~nondet0; {309#true} is VALID [2020-07-18 00:47:56,107 INFO L280 TraceCheckUtils]: 17: Hoare triple {309#true} ~i~0 := 0; {323#(= 0 ~i~0)} is VALID [2020-07-18 00:47:56,108 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-18 00:47:56,109 INFO L280 TraceCheckUtils]: 19: Hoare triple {323#(= 0 ~i~0)} assume !(0 != #t~mem1); {323#(= 0 ~i~0)} is VALID [2020-07-18 00:47:56,110 INFO L280 TraceCheckUtils]: 20: Hoare triple {323#(= 0 ~i~0)} havoc #t~mem1; {323#(= 0 ~i~0)} is VALID [2020-07-18 00:47:56,111 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-18 00:47:56,111 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#(= 0 ~i~0)} assume ~k~0 >= 0 && ~k~0 < ~i~0; {310#false} is VALID [2020-07-18 00:47:56,112 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-18 00:47:56,112 INFO L280 TraceCheckUtils]: 24: Hoare triple {310#false} assume 0 == #t~mem4; {310#false} is VALID [2020-07-18 00:47:56,112 INFO L280 TraceCheckUtils]: 25: Hoare triple {310#false} havoc #t~mem4; {310#false} is VALID [2020-07-18 00:47:56,113 INFO L280 TraceCheckUtils]: 26: Hoare triple {310#false} assume !false; {310#false} is VALID [2020-07-18 00:47:56,115 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-18 00:47:56,119 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:56,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [658154172] [2020-07-18 00:47:56,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:56,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:47:56,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825000322] [2020-07-18 00:47:56,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-18 00:47:56,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:56,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:47:56,158 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-18 00:47:56,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:47:56,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:47:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:47:56,160 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 4 states. [2020-07-18 00:47:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:56,428 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-18 00:47:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:47:56,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-18 00:47:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-18 00:47:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:47:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-18 00:47:56,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2020-07-18 00:47:56,505 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-18 00:47:56,507 INFO L225 Difference]: With dead ends: 51 [2020-07-18 00:47:56,508 INFO L226 Difference]: Without dead ends: 43 [2020-07-18 00:47:56,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-18 00:47:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-07-18 00:47:56,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:56,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 37 states. [2020-07-18 00:47:56,565 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 37 states. [2020-07-18 00:47:56,566 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 37 states. [2020-07-18 00:47:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:56,569 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-18 00:47:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-18 00:47:56,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:56,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:56,571 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 43 states. [2020-07-18 00:47:56,571 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 43 states. [2020-07-18 00:47:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:56,575 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-18 00:47:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-18 00:47:56,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:56,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:56,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:56,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-18 00:47:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-07-18 00:47:56,579 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 27 [2020-07-18 00:47:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:56,580 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-07-18 00:47:56,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:47:56,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2020-07-18 00:47:56,642 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-18 00:47:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-18 00:47:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 00:47:56,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:56,643 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-18 00:47:56,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:56,644 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash -189710638, now seen corresponding path program 1 times [2020-07-18 00:47:56,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:56,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [968695975] [2020-07-18 00:47:56,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:56,881 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-18 00:47:56,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {591#true} #valid := #valid[0 := 0]; {591#true} is VALID [2020-07-18 00:47:56,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {591#true} assume 0 < #StackHeapBarrier; {591#true} is VALID [2020-07-18 00:47:56,882 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-18 00:47:56,884 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-18 00:47:56,885 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-18 00:47:56,886 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-18 00:47:56,887 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-18 00:47:56,888 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-18 00:47:56,889 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-18 00:47:56,890 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-18 00:47:56,891 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-18 00:47:56,893 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-18 00:47:56,894 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-18 00:47:56,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {591#true} #valid := #valid[0 := 0]; {591#true} is VALID [2020-07-18 00:47:56,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {591#true} assume 0 < #StackHeapBarrier; {591#true} is VALID [2020-07-18 00:47:56,895 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-18 00:47:56,896 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-18 00:47:56,897 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-18 00:47:56,898 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-18 00:47:56,899 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-18 00:47:56,900 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-18 00:47:56,901 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-18 00:47:56,902 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-18 00:47:56,903 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-18 00:47:56,904 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-18 00:47:56,904 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-18 00:47:56,905 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-18 00:47:56,906 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-18 00:47:56,907 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-18 00:47:56,908 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-18 00:47:56,909 INFO L280 TraceCheckUtils]: 19: Hoare triple {606#(= 0 |main_#t~mem1|)} assume !!(0 != #t~mem1); {592#false} is VALID [2020-07-18 00:47:56,909 INFO L280 TraceCheckUtils]: 20: Hoare triple {592#false} havoc #t~mem1; {592#false} is VALID [2020-07-18 00:47:56,909 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-18 00:47:56,909 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-18 00:47:56,910 INFO L280 TraceCheckUtils]: 23: Hoare triple {592#false} havoc #t~mem2; {592#false} is VALID [2020-07-18 00:47:56,910 INFO L280 TraceCheckUtils]: 24: Hoare triple {592#false} #t~post3 := ~i~0; {592#false} is VALID [2020-07-18 00:47:56,910 INFO L280 TraceCheckUtils]: 25: Hoare triple {592#false} ~i~0 := 1 + #t~post3; {592#false} is VALID [2020-07-18 00:47:56,911 INFO L280 TraceCheckUtils]: 26: Hoare triple {592#false} havoc #t~post3; {592#false} is VALID [2020-07-18 00:47:56,911 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-18 00:47:56,911 INFO L280 TraceCheckUtils]: 28: Hoare triple {592#false} assume !(0 != #t~mem1); {592#false} is VALID [2020-07-18 00:47:56,912 INFO L280 TraceCheckUtils]: 29: Hoare triple {592#false} havoc #t~mem1; {592#false} is VALID [2020-07-18 00:47:56,912 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-18 00:47:56,912 INFO L280 TraceCheckUtils]: 31: Hoare triple {592#false} assume ~k~0 >= 0 && ~k~0 < ~i~0; {592#false} is VALID [2020-07-18 00:47:56,912 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-18 00:47:56,913 INFO L280 TraceCheckUtils]: 33: Hoare triple {592#false} assume 0 == #t~mem4; {592#false} is VALID [2020-07-18 00:47:56,913 INFO L280 TraceCheckUtils]: 34: Hoare triple {592#false} havoc #t~mem4; {592#false} is VALID [2020-07-18 00:47:56,913 INFO L280 TraceCheckUtils]: 35: Hoare triple {592#false} assume !false; {592#false} is VALID [2020-07-18 00:47:56,917 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-18 00:47:56,918 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:56,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [968695975] [2020-07-18 00:47:56,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:56,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:56,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682645302] [2020-07-18 00:47:56,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-18 00:47:56,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:56,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:56,966 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-18 00:47:56,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:56,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:56,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:56,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:56,968 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 5 states. [2020-07-18 00:47:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:57,174 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-18 00:47:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:57,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-18 00:47:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-18 00:47:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-18 00:47:57,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-18 00:47:57,222 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-18 00:47:57,223 INFO L225 Difference]: With dead ends: 37 [2020-07-18 00:47:57,223 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:47:57,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-18 00:47:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:47:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:47:57,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:57,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:47:57,225 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:47:57,225 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:47:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:57,225 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:47:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:47:57,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:57,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:57,226 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:47:57,226 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:47:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:57,227 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:47:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:47:57,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:57,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:57,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:57,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:47:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:47:57,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-18 00:47:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:57,228 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:47:57,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:57,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:47:57,229 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-18 00:47:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:47:57,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:57,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:57,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:47:57,621 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:47:57,621 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-18 00:47:57,621 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-18 00:47:57,622 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-18 00:47:57,622 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-18 00:47:57,622 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-18 00:47:57,622 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-18 00:47:57,622 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-18 00:47:57,623 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-18 00:47:57,623 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-18 00:47:57,623 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-18 00:47:57,623 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-18 00:47:57,623 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:47:57,624 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-18 00:47:57,624 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:47:57,624 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:47:57,624 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 8 23) the Hoare annotation is: true [2020-07-18 00:47:57,624 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-18 00:47:57,624 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-18 00:47:57,625 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-18 00:47:57,625 INFO L271 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: true [2020-07-18 00:47:57,625 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-18 00:47:57,625 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 8 23) the Hoare annotation is: true [2020-07-18 00:47:57,625 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-18 00:47:57,625 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-18 00:47:57,626 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-18 00:47:57,626 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-18 00:47:57,626 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-18 00:47:57,626 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-18 00:47:57,627 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-18 00:47:57,627 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-18 00:47:57,627 INFO L271 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: true [2020-07-18 00:47:57,627 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-18 00:47:57,627 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-18 00:47:57,628 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-18 00:47:57,628 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-18 00:47:57,628 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-18 00:47:57,628 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-18 00:47:57,628 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-18 00:47:57,629 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-18 00:47:57,629 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-18 00:47:57,648 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-18 00:47:57,654 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-18 00:47:57,659 INFO L168 Benchmark]: Toolchain (without parser) took 3679.48 ms. Allocated memory was 146.3 MB in the beginning and 245.9 MB in the end (delta: 99.6 MB). Free memory was 104.3 MB in the beginning and 181.6 MB in the end (delta: -77.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:57,660 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:57,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.54 ms. Allocated memory is still 146.3 MB. Free memory was 104.0 MB in the beginning and 93.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:57,662 INFO L168 Benchmark]: Boogie Preprocessor took 152.30 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.7 MB in the beginning and 181.5 MB in the end (delta: -87.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:57,663 INFO L168 Benchmark]: RCFGBuilder took 412.92 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 159.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:57,664 INFO L168 Benchmark]: TraceAbstraction took 2857.28 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 159.4 MB in the beginning and 181.6 MB in the end (delta: -22.2 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:57,667 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.54 ms. Allocated memory is still 146.3 MB. Free memory was 104.0 MB in the beginning and 93.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.30 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.7 MB in the beginning and 181.5 MB in the end (delta: -87.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 412.92 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 159.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2857.28 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 159.4 MB in the beginning and 181.6 MB in the end (delta: -22.2 MB). Peak memory consumption was 19.8 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...