/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test29-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:07:11,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:07:11,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:07:11,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:07:11,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:07:11,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:07:11,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:07:11,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:07:11,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:07:11,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:07:11,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:07:11,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:07:11,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:07:11,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:07:11,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:07:11,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:07:11,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:07:11,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:07:11,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:07:11,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:07:11,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:07:11,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:07:11,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:07:11,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:07:11,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:07:11,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:07:11,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:07:11,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:07:11,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:07:11,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:07:11,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:07:11,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:07:11,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:07:11,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:07:11,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:07:11,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:07:11,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:07:11,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:07:11,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:07:11,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:07:11,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:07:11,831 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:07:11,840 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:07:11,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:07:11,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:07:11,842 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:07:11,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:07:11,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:07:11,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:07:11,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:07:11,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:07:11,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:07:11,844 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:07:11,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:07:11,844 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:07:11,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:07:11,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:07:11,845 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:07:11,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:07:11,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:07:11,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:07:11,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:07:11,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:07:11,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:07:11,846 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:07:12,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:07:12,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:07:12,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:07:12,138 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:07:12,138 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:07:12,139 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test29-1.c [2020-07-11 01:07:12,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2a8b574/96f8eb881625498bbe4b82f96adcec37/FLAG055d3fc2a [2020-07-11 01:07:12,617 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:07:12,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-1.c [2020-07-11 01:07:12,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2a8b574/96f8eb881625498bbe4b82f96adcec37/FLAG055d3fc2a [2020-07-11 01:07:13,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2a8b574/96f8eb881625498bbe4b82f96adcec37 [2020-07-11 01:07:13,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:07:13,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:07:13,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:07:13,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:07:13,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:07:13,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bf9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13, skipping insertion in model container [2020-07-11 01:07:13,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:07:13,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:07:13,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:07:13,321 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:07:13,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:07:13,351 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:07:13,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13 WrapperNode [2020-07-11 01:07:13,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:07:13,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:07:13,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:07:13,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:07:13,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (1/1) ... [2020-07-11 01:07:13,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:07:13,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:07:13,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:07:13,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:07:13,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (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-11 01:07:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:07:13,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:07:13,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:07:13,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:07:13,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:07:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:07:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 01:07:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:07:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:07:13,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:07:13,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:07:13,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:07:14,004 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:07:14,004 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 01:07:14,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:07:14 BoogieIcfgContainer [2020-07-11 01:07:14,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:07:14,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:07:14,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:07:14,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:07:14,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:07:13" (1/3) ... [2020-07-11 01:07:14,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a524b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:07:14, skipping insertion in model container [2020-07-11 01:07:14,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:07:13" (2/3) ... [2020-07-11 01:07:14,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a524b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:07:14, skipping insertion in model container [2020-07-11 01:07:14,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:07:14" (3/3) ... [2020-07-11 01:07:14,019 INFO L109 eAbstractionObserver]: Analyzing ICFG test29-1.c [2020-07-11 01:07:14,032 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:07:14,040 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:07:14,062 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:07:14,110 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:07:14,111 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:07:14,111 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:07:14,111 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:07:14,111 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:07:14,112 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:07:14,112 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:07:14,112 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:07:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-07-11 01:07:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 01:07:14,141 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:14,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:07:14,143 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1161029953, now seen corresponding path program 1 times [2020-07-11 01:07:14,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:14,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1269804990] [2020-07-11 01:07:14,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:14,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {59#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {51#true} is VALID [2020-07-11 01:07:14,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} #valid := #valid[0 := 0]; {51#true} is VALID [2020-07-11 01:07:14,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {51#true} assume 0 < #StackHeapBarrier; {51#true} is VALID [2020-07-11 01:07:14,530 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-11 01:07:14,532 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {51#true} {51#true} #65#return; {51#true} is VALID [2020-07-11 01:07:14,537 INFO L263 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {59#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:07:14,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {51#true} is VALID [2020-07-11 01:07:14,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {51#true} #valid := #valid[0 := 0]; {51#true} is VALID [2020-07-11 01:07:14,540 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#true} assume 0 < #StackHeapBarrier; {51#true} is VALID [2020-07-11 01:07:14,540 INFO L280 TraceCheckUtils]: 4: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-11 01:07:14,541 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {51#true} {51#true} #65#return; {51#true} is VALID [2020-07-11 01:07:14,541 INFO L263 TraceCheckUtils]: 6: Hoare triple {51#true} call #t~ret5 := main(); {51#true} is VALID [2020-07-11 01:07:14,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {51#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {51#true} is VALID [2020-07-11 01:07:14,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {51#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {51#true} is VALID [2020-07-11 01:07:14,542 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {51#true} is VALID [2020-07-11 01:07:14,543 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#true} ~n~0 := #t~nondet0; {51#true} is VALID [2020-07-11 01:07:14,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#true} havoc #t~nondet0; {51#true} is VALID [2020-07-11 01:07:14,544 INFO L280 TraceCheckUtils]: 12: Hoare triple {51#true} assume !(0 != ~n~0); {51#true} is VALID [2020-07-11 01:07:14,544 INFO L280 TraceCheckUtils]: 13: Hoare triple {51#true} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {51#true} is VALID [2020-07-11 01:07:14,545 INFO L280 TraceCheckUtils]: 14: Hoare triple {51#true} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {51#true} is VALID [2020-07-11 01:07:14,545 INFO L280 TraceCheckUtils]: 15: Hoare triple {51#true} havoc #t~ite1.base, #t~ite1.offset; {51#true} is VALID [2020-07-11 01:07:14,547 INFO L280 TraceCheckUtils]: 16: Hoare triple {51#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {51#true} is VALID [2020-07-11 01:07:14,547 INFO L280 TraceCheckUtils]: 17: Hoare triple {51#true} SUMMARY for call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L16-1 {51#true} is VALID [2020-07-11 01:07:14,548 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#true} havoc #t~nondet2; {51#true} is VALID [2020-07-11 01:07:14,549 INFO L280 TraceCheckUtils]: 19: Hoare triple {51#true} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {51#true} is VALID [2020-07-11 01:07:14,552 INFO L280 TraceCheckUtils]: 20: Hoare triple {51#true} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L18 {51#true} is VALID [2020-07-11 01:07:14,553 INFO L280 TraceCheckUtils]: 21: Hoare triple {51#true} #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {51#true} is VALID [2020-07-11 01:07:14,555 INFO L280 TraceCheckUtils]: 22: Hoare triple {51#true} assume !#t~short4; {58#(not |main_#t~short4|)} is VALID [2020-07-11 01:07:14,556 INFO L280 TraceCheckUtils]: 23: Hoare triple {58#(not |main_#t~short4|)} assume #t~short4; {52#false} is VALID [2020-07-11 01:07:14,556 INFO L280 TraceCheckUtils]: 24: Hoare triple {52#false} havoc #t~mem3; {52#false} is VALID [2020-07-11 01:07:14,556 INFO L280 TraceCheckUtils]: 25: Hoare triple {52#false} havoc #t~short4; {52#false} is VALID [2020-07-11 01:07:14,557 INFO L280 TraceCheckUtils]: 26: Hoare triple {52#false} assume !false; {52#false} is VALID [2020-07-11 01:07:14,567 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-11 01:07:14,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1269804990] [2020-07-11 01:07:14,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:14,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:07:14,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889250324] [2020-07-11 01:07:14,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-11 01:07:14,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:14,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:07:14,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:14,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:07:14,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:07:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:07:14,695 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2020-07-11 01:07:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:15,080 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2020-07-11 01:07:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 01:07:15,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-11 01:07:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:07:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2020-07-11 01:07:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:07:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2020-07-11 01:07:15,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2020-07-11 01:07:15,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:15,221 INFO L225 Difference]: With dead ends: 57 [2020-07-11 01:07:15,222 INFO L226 Difference]: Without dead ends: 32 [2020-07-11 01:07:15,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:07:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-11 01:07:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-11 01:07:15,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:15,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-11 01:07:15,288 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 01:07:15,288 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 01:07:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:15,293 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-11 01:07:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 01:07:15,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:15,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:15,295 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-11 01:07:15,295 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-11 01:07:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:15,300 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-11 01:07:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 01:07:15,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:15,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:15,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:15,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 01:07:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-11 01:07:15,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2020-07-11 01:07:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:15,308 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-11 01:07:15,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:07:15,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-11 01:07:15,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 01:07:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 01:07:15,355 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:15,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:07:15,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:07:15,356 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash -403696930, now seen corresponding path program 1 times [2020-07-11 01:07:15,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:15,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519714772] [2020-07-11 01:07:15,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:07:15,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {315#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {304#true} is VALID [2020-07-11 01:07:15,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#true} #valid := #valid[0 := 0]; {304#true} is VALID [2020-07-11 01:07:15,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {304#true} assume 0 < #StackHeapBarrier; {304#true} is VALID [2020-07-11 01:07:15,548 INFO L280 TraceCheckUtils]: 3: Hoare triple {304#true} assume true; {304#true} is VALID [2020-07-11 01:07:15,548 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {304#true} {304#true} #65#return; {304#true} is VALID [2020-07-11 01:07:15,550 INFO L263 TraceCheckUtils]: 0: Hoare triple {304#true} call ULTIMATE.init(); {315#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:07:15,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {315#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {304#true} is VALID [2020-07-11 01:07:15,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {304#true} #valid := #valid[0 := 0]; {304#true} is VALID [2020-07-11 01:07:15,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {304#true} assume 0 < #StackHeapBarrier; {304#true} is VALID [2020-07-11 01:07:15,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {304#true} assume true; {304#true} is VALID [2020-07-11 01:07:15,552 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {304#true} {304#true} #65#return; {304#true} is VALID [2020-07-11 01:07:15,552 INFO L263 TraceCheckUtils]: 6: Hoare triple {304#true} call #t~ret5 := main(); {304#true} is VALID [2020-07-11 01:07:15,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {304#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {311#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-11 01:07:15,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {311#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4); srcloc: L13 {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:15,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:15,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:15,560 INFO L280 TraceCheckUtils]: 11: Hoare triple {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:15,561 INFO L280 TraceCheckUtils]: 12: Hoare triple {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume !(0 != ~n~0); {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-11 01:07:15,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {312#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {313#(not (= |main_~#d1~0.base| |main_#t~ite1.base|))} is VALID [2020-07-11 01:07:15,567 INFO L280 TraceCheckUtils]: 14: Hoare triple {313#(not (= |main_~#d1~0.base| |main_#t~ite1.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:15,568 INFO L280 TraceCheckUtils]: 15: Hoare triple {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} havoc #t~ite1.base, #t~ite1.offset; {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:15,569 INFO L280 TraceCheckUtils]: 16: Hoare triple {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:15,570 INFO L280 TraceCheckUtils]: 17: Hoare triple {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} SUMMARY for call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L16-1 {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:15,571 INFO L280 TraceCheckUtils]: 18: Hoare triple {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} havoc #t~nondet2; {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-11 01:07:15,572 INFO L280 TraceCheckUtils]: 19: Hoare triple {314#(not (= |main_~#d1~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {305#false} is VALID [2020-07-11 01:07:15,572 INFO L280 TraceCheckUtils]: 20: Hoare triple {305#false} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L18 {305#false} is VALID [2020-07-11 01:07:15,572 INFO L280 TraceCheckUtils]: 21: Hoare triple {305#false} #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {305#false} is VALID [2020-07-11 01:07:15,573 INFO L280 TraceCheckUtils]: 22: Hoare triple {305#false} assume #t~short4; {305#false} is VALID [2020-07-11 01:07:15,573 INFO L280 TraceCheckUtils]: 23: Hoare triple {305#false} SUMMARY for call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4); srcloc: L22-1 {305#false} is VALID [2020-07-11 01:07:15,574 INFO L280 TraceCheckUtils]: 24: Hoare triple {305#false} #t~short4 := 0 != #t~mem3; {305#false} is VALID [2020-07-11 01:07:15,574 INFO L280 TraceCheckUtils]: 25: Hoare triple {305#false} assume #t~short4; {305#false} is VALID [2020-07-11 01:07:15,574 INFO L280 TraceCheckUtils]: 26: Hoare triple {305#false} havoc #t~mem3; {305#false} is VALID [2020-07-11 01:07:15,574 INFO L280 TraceCheckUtils]: 27: Hoare triple {305#false} havoc #t~short4; {305#false} is VALID [2020-07-11 01:07:15,575 INFO L280 TraceCheckUtils]: 28: Hoare triple {305#false} assume !false; {305#false} is VALID [2020-07-11 01:07:15,580 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-11 01:07:15,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519714772] [2020-07-11 01:07:15,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:07:15,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:07:15,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294571417] [2020-07-11 01:07:15,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-11 01:07:15,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:07:15,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:07:15,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:15,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:07:15,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:07:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:07:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:07:15,621 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-07-11 01:07:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:16,089 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-11 01:07:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 01:07:16,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-11 01:07:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:07:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:07:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2020-07-11 01:07:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:07:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2020-07-11 01:07:16,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2020-07-11 01:07:16,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:16,178 INFO L225 Difference]: With dead ends: 58 [2020-07-11 01:07:16,178 INFO L226 Difference]: Without dead ends: 48 [2020-07-11 01:07:16,180 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-11 01:07:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-11 01:07:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-11 01:07:16,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:07:16,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 38 states. [2020-07-11 01:07:16,281 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 38 states. [2020-07-11 01:07:16,281 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 38 states. [2020-07-11 01:07:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:16,286 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-11 01:07:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-11 01:07:16,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:16,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:16,287 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 48 states. [2020-07-11 01:07:16,287 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 48 states. [2020-07-11 01:07:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:07:16,291 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-11 01:07:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-11 01:07:16,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:07:16,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:07:16,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:07:16,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:07:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-11 01:07:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-11 01:07:16,296 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 29 [2020-07-11 01:07:16,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:07:16,297 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-11 01:07:16,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:07:16,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2020-07-11 01:07:16,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:07:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-11 01:07:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 01:07:16,356 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:07:16,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:07:16,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:07:16,357 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:07:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:07:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2120633538, now seen corresponding path program 1 times [2020-07-11 01:07:16,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:07:16,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [8392477] [2020-07-11 01:07:16,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:07:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:07:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:07:16,426 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:07:16,426 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:07:16,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:07:16,463 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:07:16,463 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:07:16,464 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:07:16,464 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:07:16,464 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:07:16,464 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:07:16,464 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:07:16,464 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 01:07:16,464 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 01:07:16,465 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-11 01:07:16,466 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-11 01:07:16,466 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2020-07-11 01:07:16,466 WARN L170 areAnnotationChecker]: L15-5 has no Hoare annotation [2020-07-11 01:07:16,466 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-11 01:07:16,466 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-11 01:07:16,466 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-11 01:07:16,466 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 01:07:16,466 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 01:07:16,467 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 01:07:16,467 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-11 01:07:16,467 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-11 01:07:16,467 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 01:07:16,467 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 01:07:16,467 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-11 01:07:16,467 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-11 01:07:16,467 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-11 01:07:16,468 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-11 01:07:16,468 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2020-07-11 01:07:16,468 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2020-07-11 01:07:16,468 WARN L170 areAnnotationChecker]: L22-6 has no Hoare annotation [2020-07-11 01:07:16,468 WARN L170 areAnnotationChecker]: L22-8 has no Hoare annotation [2020-07-11 01:07:16,468 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 01:07:16,468 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 01:07:16,468 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 01:07:16,469 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 01:07:16,469 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-11 01:07:16,469 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 01:07:16,469 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 01:07:16,469 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 01:07:16,469 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-11 01:07:16,469 WARN L170 areAnnotationChecker]: L13-8 has no Hoare annotation [2020-07-11 01:07:16,470 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-11 01:07:16,470 WARN L170 areAnnotationChecker]: L13-9 has no Hoare annotation [2020-07-11 01:07:16,470 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 01:07:16,470 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:07:16,470 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-11 01:07:16,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:07:16 BoogieIcfgContainer [2020-07-11 01:07:16,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:07:16,477 INFO L168 Benchmark]: Toolchain (without parser) took 3438.60 ms. Allocated memory was 144.7 MB in the beginning and 244.8 MB in the end (delta: 100.1 MB). Free memory was 103.0 MB in the beginning and 191.3 MB in the end (delta: -88.3 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:16,478 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 01:07:16,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.19 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 92.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:16,480 INFO L168 Benchmark]: Boogie Preprocessor took 149.33 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 92.5 MB in the beginning and 180.9 MB in the end (delta: -88.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:16,481 INFO L168 Benchmark]: RCFGBuilder took 501.23 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 157.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:16,482 INFO L168 Benchmark]: TraceAbstraction took 2463.22 ms. Allocated memory was 203.4 MB in the beginning and 244.8 MB in the end (delta: 41.4 MB). Free memory was 157.2 MB in the beginning and 191.3 MB in the end (delta: -34.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. [2020-07-11 01:07:16,486 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.16 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 313.19 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 92.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 149.33 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 92.5 MB in the beginning and 180.9 MB in the end (delta: -88.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 501.23 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 157.8 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2463.22 ms. Allocated memory was 203.4 MB in the beginning and 244.8 MB in the end (delta: 41.4 MB). Free memory was 157.2 MB in the beginning and 191.3 MB in the end (delta: -34.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 28]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] union dummy d1, d2; VAL [d1={3:0}, d2={2:0}] [L14] int n = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, d1={3:0}, d2={2:0}, n=0] [L15] EXPR n ? &d1 : &d2 VAL [d1={3:0}, d2={2:0}, n=0, n ? &d1 : &d2={2:0}] [L15] union dummy *pd = n ? &d1 : &d2; VAL [d1={3:0}, d2={2:0}, n=0, n ? &d1 : &d2={2:0}, pd={2:0}] [L16] d1.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, d1={3:0}, d2={2:0}, n=0, pd={2:0}] [L17] COND FALSE !(pd == &d1) VAL [d1={3:0}, d2={2:0}, n=0, pd={2:0}] [L20] pd->b = 0 VAL [d1={3:0}, d2={2:0}, n=0, pd={2:0}] [L22] pd == &d2 && d1.a != 0 VAL [d1={3:0}, d2={2:0}, n=0, pd={2:0}, pd == &d2 && d1.a != 0=1] [L22] EXPR d1.a VAL [d1={3:0}, d1.a=-1, d2={2:0}, n=0, pd={2:0}, pd == &d2 && d1.a != 0=1] [L22] pd == &d2 && d1.a != 0 VAL [d1={3:0}, d1.a=-1, d2={2:0}, n=0, pd={2:0}, pd == &d2 && d1.a != 0=1] [L22] COND TRUE pd == &d2 && d1.a != 0 VAL [d1={3:0}, d1.a=-1, d2={2:0}, n=0, pd={2:0}, pd == &d2 && d1.a != 0=1] [L28] __VERIFIER_error() VAL [d1={3:0}, d2={2:0}, n=0, pd={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 65 SDtfs, 87 SDslu, 98 SDs, 0 SdLazy, 111 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 3008 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...