/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/ldv-regression/test28-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:25:34,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:25:34,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:25:34,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:25:34,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:25:34,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:25:34,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:25:34,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:25:34,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:25:34,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:25:34,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:25:34,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:25:34,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:25:34,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:25:34,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:25:34,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:25:34,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:25:34,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:25:34,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:25:34,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:25:34,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:25:34,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:25:34,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:25:34,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:25:34,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:25:34,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:25:34,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:25:34,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:25:34,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:25:34,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:25:34,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:25:34,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:25:34,331 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:25:34,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:25:34,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:25:34,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:25:34,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:25:34,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:25:34,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:25:34,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:25:34,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:25:34,336 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-08 12:25:34,350 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:25:34,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:25:34,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:25:34,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:25:34,352 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:25:34,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:25:34,353 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:25:34,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:25:34,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:25:34,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:25:34,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:25:34,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:25:34,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:25:34,354 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:25:34,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:25:34,354 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:25:34,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:25:34,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:25:34,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:25:34,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:25:34,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:25:34,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:25:34,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:25:34,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:25:34,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:25:34,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:25:34,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:25:34,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:25:34,357 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:25:34,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:25:34,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:25:34,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:25:34,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:25:34,689 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:25:34,689 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:25:34,690 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test28-1.c [2020-07-08 12:25:34,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21235ac99/636e5675a990434f927b97a7ef23dd42/FLAG62a7cb6aa [2020-07-08 12:25:35,320 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:25:35,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test28-1.c [2020-07-08 12:25:35,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21235ac99/636e5675a990434f927b97a7ef23dd42/FLAG62a7cb6aa [2020-07-08 12:25:35,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21235ac99/636e5675a990434f927b97a7ef23dd42 [2020-07-08 12:25:35,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:25:35,644 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:25:35,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:25:35,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:25:35,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:25:35,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:35,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb07072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35, skipping insertion in model container [2020-07-08 12:25:35,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:35,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:25:35,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:25:35,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:25:35,907 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:25:35,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:25:35,947 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:25:35,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35 WrapperNode [2020-07-08 12:25:35,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:25:35,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:25:35,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:25:35,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:25:36,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:36,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:36,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:36,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:36,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:36,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:36,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (1/1) ... [2020-07-08 12:25:36,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:25:36,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:25:36,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:25:36,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:25:36,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (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-08 12:25:36,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:25:36,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:25:36,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:25:36,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:25:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:25:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:25:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:25:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:25:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:25:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:25:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:25:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:25:36,469 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:25:36,470 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:25:36,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:25:36 BoogieIcfgContainer [2020-07-08 12:25:36,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:25:36,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:25:36,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:25:36,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:25:36,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:25:35" (1/3) ... [2020-07-08 12:25:36,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:25:36, skipping insertion in model container [2020-07-08 12:25:36,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:35" (2/3) ... [2020-07-08 12:25:36,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd706f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:25:36, skipping insertion in model container [2020-07-08 12:25:36,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:25:36" (3/3) ... [2020-07-08 12:25:36,485 INFO L109 eAbstractionObserver]: Analyzing ICFG test28-1.c [2020-07-08 12:25:36,509 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:25:36,517 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:25:36,561 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:25:36,589 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:25:36,590 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:25:36,590 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:25:36,590 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:25:36,590 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:25:36,590 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:25:36,591 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:25:36,591 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:25:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-08 12:25:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:25:36,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:36,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:36,618 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 668850033, now seen corresponding path program 1 times [2020-07-08 12:25:36,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:36,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337478351] [2020-07-08 12:25:36,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:36,988 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#true} is VALID [2020-07-08 12:25:36,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-08 12:25:36,989 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2020-07-08 12:25:36,995 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {31#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:36,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#true} is VALID [2020-07-08 12:25:36,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-08 12:25:36,997 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2020-07-08 12:25:36,997 INFO L263 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2020-07-08 12:25:37,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {26#(= |main_~#d2~0.offset| |main_~#d1~0.offset|)} is VALID [2020-07-08 12:25:37,017 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#(= |main_~#d2~0.offset| |main_~#d1~0.offset|)} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {27#(= |main_#t~ite1.offset| |main_~#d2~0.offset|)} is VALID [2020-07-08 12:25:37,019 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#(= |main_#t~ite1.offset| |main_~#d2~0.offset|)} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {28#(= |main_~#d2~0.offset| main_~pd~0.offset)} is VALID [2020-07-08 12:25:37,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#(= |main_~#d2~0.offset| main_~pd~0.offset)} assume !(~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset);call write~int(0, ~pd~0.base, 4 + ~pd~0.offset, 4); {29#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 12:25:37,023 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {30#(not |main_#t~short3|)} is VALID [2020-07-08 12:25:37,030 INFO L280 TraceCheckUtils]: 10: Hoare triple {30#(not |main_#t~short3|)} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; {22#false} is VALID [2020-07-08 12:25:37,030 INFO L280 TraceCheckUtils]: 11: Hoare triple {22#false} assume #t~short3;havoc #t~short3;havoc #t~mem2; {22#false} is VALID [2020-07-08 12:25:37,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2020-07-08 12:25:37,034 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-08 12:25:37,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337478351] [2020-07-08 12:25:37,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:25:37,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 12:25:37,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583056116] [2020-07-08 12:25:37,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-08 12:25:37,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:37,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:25:37,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:37,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:25:37,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:25:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:25:37,138 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 8 states. [2020-07-08 12:25:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:37,574 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-07-08 12:25:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:25:37,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-08 12:25:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:25:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-08 12:25:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:25:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-08 12:25:37,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-08 12:25:37,678 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-08 12:25:37,691 INFO L225 Difference]: With dead ends: 29 [2020-07-08 12:25:37,691 INFO L226 Difference]: Without dead ends: 14 [2020-07-08 12:25:37,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:25:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-08 12:25:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-08 12:25:37,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:37,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:37,747 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:37,747 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:37,751 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-08 12:25:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-08 12:25:37,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:37,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:37,752 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:37,752 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:37,756 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-08 12:25:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-08 12:25:37,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:37,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:37,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:37,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:25:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-08 12:25:37,762 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2020-07-08 12:25:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:37,762 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-08 12:25:37,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:25:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-08 12:25:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:25:37,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:37,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:37,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:25:37,764 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash 667002991, now seen corresponding path program 1 times [2020-07-08 12:25:37,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:37,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160733066] [2020-07-08 12:25:37,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:37,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {134#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {126#true} is VALID [2020-07-08 12:25:37,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {126#true} assume true; {126#true} is VALID [2020-07-08 12:25:37,902 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {126#true} {126#true} #35#return; {126#true} is VALID [2020-07-08 12:25:37,903 INFO L263 TraceCheckUtils]: 0: Hoare triple {126#true} call ULTIMATE.init(); {134#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:37,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {134#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {126#true} is VALID [2020-07-08 12:25:37,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {126#true} assume true; {126#true} is VALID [2020-07-08 12:25:37,904 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {126#true} {126#true} #35#return; {126#true} is VALID [2020-07-08 12:25:37,905 INFO L263 TraceCheckUtils]: 4: Hoare triple {126#true} call #t~ret4 := main(); {126#true} is VALID [2020-07-08 12:25:37,906 INFO L280 TraceCheckUtils]: 5: Hoare triple {126#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {131#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 12:25:37,908 INFO L280 TraceCheckUtils]: 6: Hoare triple {131#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {132#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-08 12:25:37,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {132#(not (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {133#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 12:25:37,912 INFO L280 TraceCheckUtils]: 8: Hoare triple {133#(not (= main_~pd~0.base |main_~#d2~0.base|))} assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); {127#false} is VALID [2020-07-08 12:25:37,912 INFO L280 TraceCheckUtils]: 9: Hoare triple {127#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {127#false} is VALID [2020-07-08 12:25:37,912 INFO L280 TraceCheckUtils]: 10: Hoare triple {127#false} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; {127#false} is VALID [2020-07-08 12:25:37,913 INFO L280 TraceCheckUtils]: 11: Hoare triple {127#false} assume #t~short3;havoc #t~short3;havoc #t~mem2; {127#false} is VALID [2020-07-08 12:25:37,913 INFO L280 TraceCheckUtils]: 12: Hoare triple {127#false} assume !false; {127#false} is VALID [2020-07-08 12:25:37,914 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-08 12:25:37,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160733066] [2020-07-08 12:25:37,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:25:37,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:25:37,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426486084] [2020-07-08 12:25:37,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-08 12:25:37,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:37,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:25:37,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:37,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:25:37,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:25:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:25:37,941 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2020-07-08 12:25:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:38,089 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-08 12:25:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:25:38,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-08 12:25:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:25:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-08 12:25:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:25:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2020-07-08 12:25:38,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2020-07-08 12:25:38,126 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-08 12:25:38,127 INFO L225 Difference]: With dead ends: 21 [2020-07-08 12:25:38,127 INFO L226 Difference]: Without dead ends: 14 [2020-07-08 12:25:38,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:25:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-08 12:25:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-08 12:25:38,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:38,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:38,142 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:38,143 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:38,144 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-08 12:25:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-08 12:25:38,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:38,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:38,146 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:38,146 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:38,148 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-08 12:25:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-08 12:25:38,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:38,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:38,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:38,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:25:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2020-07-08 12:25:38,151 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2020-07-08 12:25:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:38,151 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2020-07-08 12:25:38,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:25:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-08 12:25:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:25:38,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:38,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:38,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:25:38,153 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:38,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1852956943, now seen corresponding path program 1 times [2020-07-08 12:25:38,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:38,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813551590] [2020-07-08 12:25:38,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:25:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:25:38,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:25:38,237 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:25:38,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:25:38,287 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:25:38,287 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:25:38,287 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:25:38,287 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:25:38,288 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:25:38,288 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:25:38,288 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:25:38,288 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:25:38,288 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:25:38,288 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:25:38,289 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:25:38,289 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-08 12:25:38,289 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:25:38,289 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:25:38,289 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-08 12:25:38,289 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:25:38,290 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:25:38,290 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:25:38,290 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:25:38,290 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 12:25:38,290 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 12:25:38,290 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:25:38,291 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:25:38,291 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:25:38,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:25:38 BoogieIcfgContainer [2020-07-08 12:25:38,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:25:38,303 INFO L168 Benchmark]: Toolchain (without parser) took 2655.00 ms. Allocated memory was 135.8 MB in the beginning and 228.1 MB in the end (delta: 92.3 MB). Free memory was 100.9 MB in the beginning and 135.2 MB in the end (delta: -34.3 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:38,305 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:25:38,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.19 ms. Allocated memory is still 135.8 MB. Free memory was 100.7 MB in the beginning and 90.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:38,308 INFO L168 Benchmark]: Boogie Preprocessor took 118.83 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 178.2 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:38,310 INFO L168 Benchmark]: RCFGBuilder took 406.17 ms. Allocated memory is still 199.8 MB. Free memory was 178.2 MB in the beginning and 160.0 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:38,313 INFO L168 Benchmark]: TraceAbstraction took 1820.40 ms. Allocated memory was 199.8 MB in the beginning and 228.1 MB in the end (delta: 28.3 MB). Free memory was 159.2 MB in the beginning and 135.2 MB in the end (delta: 24.1 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:38,332 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.24 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.19 ms. Allocated memory is still 135.8 MB. Free memory was 100.7 MB in the beginning and 90.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.83 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 178.2 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 406.17 ms. Allocated memory is still 199.8 MB. Free memory was 178.2 MB in the beginning and 160.0 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1820.40 ms. Allocated memory was 199.8 MB in the beginning and 228.1 MB in the end (delta: 28.3 MB). Free memory was 159.2 MB in the beginning and 135.2 MB in the end (delta: 24.1 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] struct dummy d1, d2; [L13] int n = __VERIFIER_nondet_int(); [L14] EXPR n ? &d1 : &d2 VAL [d1={3:0}, d2={2:0}, n=0, n ? &d1 : &d2={2:0}] [L14] struct dummy *pd = n ? &d1 : &d2; [L15] COND TRUE pd == &d2 [L16] pd->a = 0 VAL [d1={3:0}, d2={2:0}, n=0, pd={2:0}] [L20] pd == &d2 && d2.b != 0 [L20] EXPR d2.b [L20] pd == &d2 && d2.b != 0 VAL [d1={3:0}, d2={2:0}, d2.b=11, n=0, pd={2:0}, pd == &d2 && d2.b != 0=1] [L20] COND TRUE pd == &d2 && d2.b != 0 [L26] __VERIFIER_error() VAL [d1={3:0}, d2={2:0}, n=0, pd={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 SDtfs, 31 SDslu, 63 SDs, 0 SdLazy, 95 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...