/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/n.c40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:28,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:28,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:28,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:28,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:28,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:28,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:28,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:28,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:28,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:28,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:28,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:28,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:28,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:28,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:28,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:28,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:28,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:28,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:28,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:28,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:28,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:28,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:28,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:28,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:28,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:28,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:28,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:28,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:28,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:28,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:28,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:28,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:28,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:28,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:28,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:28,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:28,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:28,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:28,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:28,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:28,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:28,366 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:28,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:28,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:28,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:28,368 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:28,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:28,369 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:28,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:28,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:28,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:28,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:28,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:28,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:28,370 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:28,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:28,371 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:28,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:28,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:28,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:28,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:28,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:28,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:28,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:28,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:28,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:28,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:28,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:28,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:28,373 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:28,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:28,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:28,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:28,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:28,712 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:28,713 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:28,713 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 15:27:28,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/508b137ca/31b8f8b30d744264b3af791b9e05da0f/FLAGe7b6d988b [2020-07-10 15:27:29,399 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:29,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c [2020-07-10 15:27:29,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/508b137ca/31b8f8b30d744264b3af791b9e05da0f/FLAGe7b6d988b [2020-07-10 15:27:29,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/508b137ca/31b8f8b30d744264b3af791b9e05da0f [2020-07-10 15:27:29,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:29,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:29,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:29,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:29,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:29,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:29" (1/1) ... [2020-07-10 15:27:29,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10cb5463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:29, skipping insertion in model container [2020-07-10 15:27:29,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:29" (1/1) ... [2020-07-10 15:27:29,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:29,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:29,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:29,990 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:30,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:30,043 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:30,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30 WrapperNode [2020-07-10 15:27:30,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:30,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:30,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:30,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:30,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (1/1) ... [2020-07-10 15:27:30,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (1/1) ... [2020-07-10 15:27:30,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (1/1) ... [2020-07-10 15:27:30,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (1/1) ... [2020-07-10 15:27:30,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (1/1) ... [2020-07-10 15:27:30,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (1/1) ... [2020-07-10 15:27:30,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (1/1) ... [2020-07-10 15:27:30,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:30,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:30,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:30,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:30,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (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 15:27:30,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:30,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:30,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:30,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:30,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:30,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:30,669 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:30,670 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:27:30,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:30 BoogieIcfgContainer [2020-07-10 15:27:30,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:30,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:30,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:30,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:30,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:29" (1/3) ... [2020-07-10 15:27:30,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c4ebcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:30, skipping insertion in model container [2020-07-10 15:27:30,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:30" (2/3) ... [2020-07-10 15:27:30,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c4ebcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:30, skipping insertion in model container [2020-07-10 15:27:30,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:30" (3/3) ... [2020-07-10 15:27:30,687 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c40.c [2020-07-10 15:27:30,700 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:30,709 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:30,727 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:30,751 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:30,751 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:30,751 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:30,751 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:30,752 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:30,752 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:30,752 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:30,752 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-10 15:27:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:27:30,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:30,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:30,783 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:30,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1526440521, now seen corresponding path program 1 times [2020-07-10 15:27:30,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:30,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549609664] [2020-07-10 15:27:30,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:31,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {21#true} is VALID [2020-07-10 15:27:31,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-10 15:27:31,152 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2020-07-10 15:27:31,163 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(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 15:27:31,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {21#true} is VALID [2020-07-10 15:27:31,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-10 15:27:31,165 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #38#return; {21#true} is VALID [2020-07-10 15:27:31,165 INFO L263 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2020-07-10 15:27:31,165 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {21#true} is VALID [2020-07-10 15:27:31,179 INFO L280 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2020-07-10 15:27:31,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {22#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {22#false} is VALID [2020-07-10 15:27:31,181 INFO L280 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {22#false} is VALID [2020-07-10 15:27:31,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == #t~mem4;havoc #t~mem4; {22#false} is VALID [2020-07-10 15:27:31,182 INFO L280 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2020-07-10 15:27:31,185 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 15:27:31,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549609664] [2020-07-10 15:27:31,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:31,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:31,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154500384] [2020-07-10 15:27:31,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-10 15:27:31,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:31,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:31,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:31,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:31,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:31,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:31,289 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-07-10 15:27:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:31,483 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-10 15:27:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:31,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-10 15:27:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-07-10 15:27:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-07-10 15:27:31,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2020-07-10 15:27:31,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:31,589 INFO L225 Difference]: With dead ends: 28 [2020-07-10 15:27:31,589 INFO L226 Difference]: Without dead ends: 13 [2020-07-10 15:27:31,595 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 15:27:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-10 15:27:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-10 15:27:31,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:31,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:31,678 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:31,679 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:31,686 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:27:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:27:31,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:31,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:31,688 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:31,688 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:27:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:31,692 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:27:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:27:31,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:31,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:31,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:31,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:27:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-10 15:27:31,698 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-07-10 15:27:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:31,699 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-10 15:27:31,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:27:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:27:31,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:31,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:31,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:31,701 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:31,702 INFO L82 PathProgramCache]: Analyzing trace with hash -281053369, now seen corresponding path program 1 times [2020-07-10 15:27:31,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:31,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914077968] [2020-07-10 15:27:31,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:31,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {112#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {106#true} is VALID [2020-07-10 15:27:31,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2020-07-10 15:27:31,892 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #38#return; {106#true} is VALID [2020-07-10 15:27:31,895 INFO L263 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {112#(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 15:27:31,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {112#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {106#true} is VALID [2020-07-10 15:27:31,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {106#true} assume true; {106#true} is VALID [2020-07-10 15:27:31,896 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {106#true} {106#true} #38#return; {106#true} is VALID [2020-07-10 15:27:31,897 INFO L263 TraceCheckUtils]: 4: Hoare triple {106#true} call #t~ret5 := main(); {106#true} is VALID [2020-07-10 15:27:31,899 INFO L280 TraceCheckUtils]: 5: Hoare triple {106#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {111#(= 0 ~i~0)} is VALID [2020-07-10 15:27:31,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {111#(= 0 ~i~0)} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {111#(= 0 ~i~0)} is VALID [2020-07-10 15:27:31,903 INFO L280 TraceCheckUtils]: 7: Hoare triple {111#(= 0 ~i~0)} assume !(0 != #t~mem1);havoc #t~mem1; {111#(= 0 ~i~0)} is VALID [2020-07-10 15:27:31,904 INFO L280 TraceCheckUtils]: 8: Hoare triple {111#(= 0 ~i~0)} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {111#(= 0 ~i~0)} is VALID [2020-07-10 15:27:31,906 INFO L280 TraceCheckUtils]: 9: Hoare triple {111#(= 0 ~i~0)} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {107#false} is VALID [2020-07-10 15:27:31,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {107#false} assume 0 == #t~mem4;havoc #t~mem4; {107#false} is VALID [2020-07-10 15:27:31,907 INFO L280 TraceCheckUtils]: 11: Hoare triple {107#false} assume !false; {107#false} is VALID [2020-07-10 15:27:31,911 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 15:27:31,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914077968] [2020-07-10 15:27:31,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:31,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:31,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063961902] [2020-07-10 15:27:31,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-10 15:27:31,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:31,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:31,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:31,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:31,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:31,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:31,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:31,956 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2020-07-10 15:27:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,174 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:27:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:32,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-10 15:27:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-10 15:27:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-10 15:27:32,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2020-07-10 15:27:32,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:32,219 INFO L225 Difference]: With dead ends: 20 [2020-07-10 15:27:32,220 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:27:32,221 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:27:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:27:32,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:32,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:27:32,256 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:27:32,256 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:27:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,258 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:27:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:27:32,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:32,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:32,259 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:27:32,259 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:27:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,263 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:27:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:27:32,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:32,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:32,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:32,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:27:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-10 15:27:32,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2020-07-10 15:27:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:32,270 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-10 15:27:32,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:27:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:27:32,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:32,278 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:32,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:32,279 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1999502604, now seen corresponding path program 1 times [2020-07-10 15:27:32,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:32,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920305630] [2020-07-10 15:27:32,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:32,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {201#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:32,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:32,513 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {194#true} #38#return; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:32,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {201#(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 15:27:32,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {201#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base);~i~0 := 0;~j~0 := 0;~k~0 := 0; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:32,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume true; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:32,520 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} {194#true} #38#return; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:32,521 INFO L263 TraceCheckUtils]: 4: Hoare triple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} call #t~ret5 := main(); {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:32,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0; {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} is VALID [2020-07-10 15:27:32,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {199#(= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {200#(= 0 |main_#t~mem1|)} is VALID [2020-07-10 15:27:32,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {200#(= 0 |main_#t~mem1|)} assume !!(0 != #t~mem1);havoc #t~mem1;call #t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1);call write~int(#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1);havoc #t~mem2;#t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {195#false} is VALID [2020-07-10 15:27:32,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {195#false} call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); {195#false} is VALID [2020-07-10 15:27:32,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {195#false} assume !(0 != #t~mem1);havoc #t~mem1; {195#false} is VALID [2020-07-10 15:27:32,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {195#false} call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); {195#false} is VALID [2020-07-10 15:27:32,525 INFO L280 TraceCheckUtils]: 11: Hoare triple {195#false} assume ~k~0 >= 0 && ~k~0 < ~i~0;call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); {195#false} is VALID [2020-07-10 15:27:32,525 INFO L280 TraceCheckUtils]: 12: Hoare triple {195#false} assume 0 == #t~mem4;havoc #t~mem4; {195#false} is VALID [2020-07-10 15:27:32,525 INFO L280 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2020-07-10 15:27:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:32,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920305630] [2020-07-10 15:27:32,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:32,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:32,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597615900] [2020-07-10 15:27:32,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:27:32,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:32,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:32,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:32,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:32,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:32,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:32,553 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2020-07-10 15:27:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,674 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:27:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:32,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-10 15:27:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2020-07-10 15:27:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2020-07-10 15:27:32,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2020-07-10 15:27:32,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:32,712 INFO L225 Difference]: With dead ends: 15 [2020-07-10 15:27:32,712 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:27:32,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 15:27:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:27:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:27:32,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:32,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:32,714 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:32,714 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,714 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:32,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:32,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:32,715 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:32,715 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,716 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:32,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:32,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:32,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:32,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:27:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:27:32,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-10 15:27:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:32,717 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:27:32,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:32,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:32,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:27:32,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:27:32,863 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:32,863 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 15:27:32,864 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:32,864 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:32,864 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 15:27:32,864 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:27:32,864 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:32,864 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 8 23) no Hoare annotation was computed. [2020-07-10 15:27:32,865 INFO L268 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2020-07-10 15:27:32,865 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 8 23) no Hoare annotation was computed. [2020-07-10 15:27:32,865 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2020-07-10 15:27:32,865 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 15:27:32,865 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-10 15:27:32,866 INFO L268 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-07-10 15:27:32,866 INFO L268 CegarLoopResult]: For program point L18-1(lines 18 20) no Hoare annotation was computed. [2020-07-10 15:27:32,866 INFO L268 CegarLoopResult]: For program point L12-1(lines 12 15) no Hoare annotation was computed. [2020-07-10 15:27:32,866 INFO L264 CegarLoopResult]: At program point L12-3(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 15:27:32,867 INFO L268 CegarLoopResult]: For program point L12-4(lines 12 15) no Hoare annotation was computed. [2020-07-10 15:27:32,871 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:32,875 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:32,875 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:32,876 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-10 15:27:32,877 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-10 15:27:32,877 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:32,877 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:32,877 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-10 15:27:32,877 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-10 15:27:32,877 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-10 15:27:32,878 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:27:32,878 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:27:32,878 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:27:32,878 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:27:32,878 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-10 15:27:32,878 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:27:32,879 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:27:32,879 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:32,879 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:32,879 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:32,885 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 15:27:32,890 INFO L168 Benchmark]: Toolchain (without parser) took 3144.96 ms. Allocated memory was 138.4 MB in the beginning and 235.4 MB in the end (delta: 97.0 MB). Free memory was 103.3 MB in the beginning and 91.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,891 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.38 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 92.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,893 INFO L168 Benchmark]: Boogie Preprocessor took 138.81 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.8 MB in the beginning and 180.4 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,894 INFO L168 Benchmark]: RCFGBuilder took 490.42 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 162.0 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,895 INFO L168 Benchmark]: TraceAbstraction took 2211.19 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 161.3 MB in the beginning and 91.1 MB in the end (delta: 70.2 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,899 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.38 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 92.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.81 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 92.8 MB in the beginning and 180.4 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 490.42 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 162.0 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2211.19 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 161.3 MB in the beginning and 91.1 MB in the end (delta: 70.2 MB). Peak memory consumption was 102.7 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...