/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test29-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 16:24:36,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:24:36,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:24:36,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:24:36,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:24:36,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:24:36,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:24:36,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:24:36,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:24:36,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:24:36,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:24:36,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:24:36,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:24:36,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:24:36,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:24:36,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:24:36,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:24:36,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:24:36,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:24:36,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:24:36,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:24:36,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:24:36,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:24:36,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:24:36,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:24:36,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:24:36,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:24:36,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:24:36,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:24:36,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:24:36,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:24:36,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:24:36,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:24:36,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:24:36,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:24:36,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:24:36,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:24:36,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:24:36,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:24:36,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:24:36,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:24:36,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 16:24:36,205 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:24:36,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:24:36,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:24:36,207 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:24:36,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:24:36,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:24:36,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:24:36,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:24:36,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:24:36,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:24:36,208 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:24:36,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:24:36,209 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:24:36,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:24:36,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:24:36,209 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:24:36,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:24:36,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:24:36,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:24:36,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:24:36,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:24:36,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:24:36,211 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:24:36,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:24:36,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:24:36,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:24:36,523 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:24:36,523 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:24:36,525 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-08 16:24:36,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343bd6674/cd956857083844aaaebc92699c8e1e48/FLAG1a24fc9f6 [2020-07-08 16:24:37,044 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:24:37,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-1.c [2020-07-08 16:24:37,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343bd6674/cd956857083844aaaebc92699c8e1e48/FLAG1a24fc9f6 [2020-07-08 16:24:37,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/343bd6674/cd956857083844aaaebc92699c8e1e48 [2020-07-08 16:24:37,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:24:37,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:24:37,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:24:37,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:24:37,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:24:37,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67951c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37, skipping insertion in model container [2020-07-08 16:24:37,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:24:37,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:24:37,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:24:37,635 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:24:37,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:24:37,676 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:24:37,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37 WrapperNode [2020-07-08 16:24:37,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:24:37,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:24:37,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:24:37,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:24:37,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (1/1) ... [2020-07-08 16:24:37,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:24:37,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:24:37,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:24:37,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:24:37,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (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 16:24:37,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:24:37,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:24:37,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:24:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:24:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 16:24:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:24:37,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 16:24:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 16:24:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 16:24:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 16:24:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:24:37,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:24:38,266 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:24:38,266 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 16:24:38,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:24:38 BoogieIcfgContainer [2020-07-08 16:24:38,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:24:38,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:24:38,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:24:38,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:24:38,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:24:37" (1/3) ... [2020-07-08 16:24:38,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dd62b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:24:38, skipping insertion in model container [2020-07-08 16:24:38,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:24:37" (2/3) ... [2020-07-08 16:24:38,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dd62b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:24:38, skipping insertion in model container [2020-07-08 16:24:38,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:24:38" (3/3) ... [2020-07-08 16:24:38,279 INFO L109 eAbstractionObserver]: Analyzing ICFG test29-1.c [2020-07-08 16:24:38,288 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:24:38,295 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 16:24:38,306 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 16:24:38,325 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:24:38,325 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:24:38,325 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:24:38,326 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:24:38,326 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:24:38,326 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:24:38,326 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:24:38,326 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:24:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-07-08 16:24:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 16:24:38,351 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:24:38,352 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-08 16:24:38,352 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:24:38,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:24:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1161029953, now seen corresponding path program 1 times [2020-07-08 16:24:38,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:24:38,364 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1314459662] [2020-07-08 16:24:38,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:24:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:38,659 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-08 16:24:38,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} #valid := #valid[0 := 0]; {51#true} is VALID [2020-07-08 16:24:38,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {51#true} assume 0 < #StackHeapBarrier; {51#true} is VALID [2020-07-08 16:24:38,661 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-08 16:24:38,661 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {51#true} {51#true} #65#return; {51#true} is VALID [2020-07-08 16:24:38,666 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-08 16:24:38,666 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-08 16:24:38,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {51#true} #valid := #valid[0 := 0]; {51#true} is VALID [2020-07-08 16:24:38,667 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#true} assume 0 < #StackHeapBarrier; {51#true} is VALID [2020-07-08 16:24:38,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-08 16:24:38,668 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {51#true} {51#true} #65#return; {51#true} is VALID [2020-07-08 16:24:38,668 INFO L263 TraceCheckUtils]: 6: Hoare triple {51#true} call #t~ret5 := main(); {51#true} is VALID [2020-07-08 16:24:38,669 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-08 16:24:38,669 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-08 16:24:38,670 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {51#true} is VALID [2020-07-08 16:24:38,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#true} ~n~0 := #t~nondet0; {51#true} is VALID [2020-07-08 16:24:38,671 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#true} havoc #t~nondet0; {51#true} is VALID [2020-07-08 16:24:38,671 INFO L280 TraceCheckUtils]: 12: Hoare triple {51#true} assume !(0 != ~n~0); {51#true} is VALID [2020-07-08 16:24:38,672 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-08 16:24:38,672 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-08 16:24:38,673 INFO L280 TraceCheckUtils]: 15: Hoare triple {51#true} havoc #t~ite1.base, #t~ite1.offset; {51#true} is VALID [2020-07-08 16:24:38,673 INFO L280 TraceCheckUtils]: 16: Hoare triple {51#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {51#true} is VALID [2020-07-08 16:24:38,674 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-08 16:24:38,674 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#true} havoc #t~nondet2; {51#true} is VALID [2020-07-08 16:24:38,675 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-08 16:24:38,675 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-08 16:24:38,676 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-08 16:24:38,677 INFO L280 TraceCheckUtils]: 22: Hoare triple {51#true} assume !#t~short4; {58#(not |main_#t~short4|)} is VALID [2020-07-08 16:24:38,679 INFO L280 TraceCheckUtils]: 23: Hoare triple {58#(not |main_#t~short4|)} assume #t~short4; {52#false} is VALID [2020-07-08 16:24:38,680 INFO L280 TraceCheckUtils]: 24: Hoare triple {52#false} havoc #t~mem3; {52#false} is VALID [2020-07-08 16:24:38,681 INFO L280 TraceCheckUtils]: 25: Hoare triple {52#false} havoc #t~short4; {52#false} is VALID [2020-07-08 16:24:38,681 INFO L280 TraceCheckUtils]: 26: Hoare triple {52#false} assume !false; {52#false} is VALID [2020-07-08 16:24:38,685 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 16:24:38,686 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:24:38,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1314459662] [2020-07-08 16:24:38,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:24:38,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 16:24:38,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756581561] [2020-07-08 16:24:38,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-08 16:24:38,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:24:38,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 16:24:38,766 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-08 16:24:38,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 16:24:38,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:24:38,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 16:24:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 16:24:38,780 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2020-07-08 16:24:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:39,056 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2020-07-08 16:24:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 16:24:39,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-08 16:24:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:24:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:24:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2020-07-08 16:24:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 16:24:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2020-07-08 16:24:39,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2020-07-08 16:24:39,184 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-08 16:24:39,196 INFO L225 Difference]: With dead ends: 57 [2020-07-08 16:24:39,197 INFO L226 Difference]: Without dead ends: 32 [2020-07-08 16:24:39,200 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-08 16:24:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-08 16:24:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-08 16:24:39,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:24:39,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-08 16:24:39,260 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 16:24:39,260 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 16:24:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:39,265 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-08 16:24:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 16:24:39,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:39,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:24:39,267 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-08 16:24:39,267 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-08 16:24:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:39,272 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-08 16:24:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 16:24:39,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:39,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:24:39,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:24:39,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:24:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 16:24:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-08 16:24:39,278 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2020-07-08 16:24:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:24:39,279 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-08 16:24:39,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 16:24:39,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-08 16:24:39,323 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-08 16:24:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 16:24:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 16:24:39,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:24:39,325 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-08 16:24:39,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:24:39,325 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:24:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:24:39,326 INFO L82 PathProgramCache]: Analyzing trace with hash -403696930, now seen corresponding path program 1 times [2020-07-08 16:24:39,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:24:39,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1991889968] [2020-07-08 16:24:39,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:24:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:24:39,484 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-08 16:24:39,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {304#true} #valid := #valid[0 := 0]; {304#true} is VALID [2020-07-08 16:24:39,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {304#true} assume 0 < #StackHeapBarrier; {304#true} is VALID [2020-07-08 16:24:39,486 INFO L280 TraceCheckUtils]: 3: Hoare triple {304#true} assume true; {304#true} is VALID [2020-07-08 16:24:39,486 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {304#true} {304#true} #65#return; {304#true} is VALID [2020-07-08 16:24:39,487 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-08 16:24:39,488 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-08 16:24:39,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {304#true} #valid := #valid[0 := 0]; {304#true} is VALID [2020-07-08 16:24:39,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {304#true} assume 0 < #StackHeapBarrier; {304#true} is VALID [2020-07-08 16:24:39,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {304#true} assume true; {304#true} is VALID [2020-07-08 16:24:39,489 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {304#true} {304#true} #65#return; {304#true} is VALID [2020-07-08 16:24:39,489 INFO L263 TraceCheckUtils]: 6: Hoare triple {304#true} call #t~ret5 := main(); {304#true} is VALID [2020-07-08 16:24:39,490 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-08 16:24:39,491 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-08 16:24:39,492 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-08 16:24:39,493 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-08 16:24:39,493 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-08 16:24:39,494 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-08 16:24:39,495 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#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-08 16:24:39,496 INFO L280 TraceCheckUtils]: 14: Hoare triple {313#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 16:24:39,497 INFO L280 TraceCheckUtils]: 15: Hoare triple {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} havoc #t~ite1.base, #t~ite1.offset; {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 16:24:39,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 16:24:39,498 INFO L280 TraceCheckUtils]: 17: Hoare triple {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} SUMMARY for call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L16-1 {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 16:24:39,499 INFO L280 TraceCheckUtils]: 18: Hoare triple {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} havoc #t~nondet2; {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 16:24:39,500 INFO L280 TraceCheckUtils]: 19: Hoare triple {314#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {305#false} is VALID [2020-07-08 16:24:39,501 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-08 16:24:39,501 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-08 16:24:39,501 INFO L280 TraceCheckUtils]: 22: Hoare triple {305#false} assume #t~short4; {305#false} is VALID [2020-07-08 16:24:39,501 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-08 16:24:39,502 INFO L280 TraceCheckUtils]: 24: Hoare triple {305#false} #t~short4 := 0 != #t~mem3; {305#false} is VALID [2020-07-08 16:24:39,502 INFO L280 TraceCheckUtils]: 25: Hoare triple {305#false} assume #t~short4; {305#false} is VALID [2020-07-08 16:24:39,502 INFO L280 TraceCheckUtils]: 26: Hoare triple {305#false} havoc #t~mem3; {305#false} is VALID [2020-07-08 16:24:39,503 INFO L280 TraceCheckUtils]: 27: Hoare triple {305#false} havoc #t~short4; {305#false} is VALID [2020-07-08 16:24:39,503 INFO L280 TraceCheckUtils]: 28: Hoare triple {305#false} assume !false; {305#false} is VALID [2020-07-08 16:24:39,505 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 16:24:39,506 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:24:39,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1991889968] [2020-07-08 16:24:39,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:24:39,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 16:24:39,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425324019] [2020-07-08 16:24:39,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-08 16:24:39,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:24:39,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 16:24:39,541 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-08 16:24:39,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 16:24:39,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:24:39,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 16:24:39,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 16:24:39,542 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-07-08 16:24:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:39,959 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-08 16:24:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 16:24:39,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-08 16:24:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:24:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 16:24:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2020-07-08 16:24:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 16:24:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2020-07-08 16:24:39,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2020-07-08 16:24:40,049 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-08 16:24:40,052 INFO L225 Difference]: With dead ends: 58 [2020-07-08 16:24:40,052 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 16:24:40,054 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-08 16:24:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 16:24:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-08 16:24:40,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:24:40,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 38 states. [2020-07-08 16:24:40,157 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 38 states. [2020-07-08 16:24:40,157 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 38 states. [2020-07-08 16:24:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:40,163 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-08 16:24:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-08 16:24:40,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:40,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:24:40,165 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 48 states. [2020-07-08 16:24:40,165 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 48 states. [2020-07-08 16:24:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:24:40,169 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-08 16:24:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-08 16:24:40,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:24:40,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:24:40,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:24:40,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:24:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 16:24:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-07-08 16:24:40,174 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 29 [2020-07-08 16:24:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:24:40,174 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-07-08 16:24:40,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 16:24:40,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 39 transitions. [2020-07-08 16:24:40,239 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-08 16:24:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-08 16:24:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 16:24:40,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:24:40,240 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-08 16:24:40,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:24:40,241 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:24:40,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:24:40,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2120633538, now seen corresponding path program 1 times [2020-07-08 16:24:40,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:24:40,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181737474] [2020-07-08 16:24:40,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:24:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 16:24:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 16:24:40,309 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:24:40,309 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 16:24:40,310 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 16:24:40,310 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 16:24:40,326 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 16:24:40,326 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 16:24:40,326 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 16:24:40,326 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 16:24:40,326 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 16:24:40,327 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 16:24:40,327 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 16:24:40,327 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 16:24:40,327 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 16:24:40,327 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 16:24:40,327 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 16:24:40,327 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 16:24:40,328 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 16:24:40,328 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 16:24:40,328 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-08 16:24:40,328 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 16:24:40,328 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 16:24:40,328 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-08 16:24:40,328 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-08 16:24:40,328 WARN L170 areAnnotationChecker]: L15-4 has no Hoare annotation [2020-07-08 16:24:40,329 WARN L170 areAnnotationChecker]: L15-5 has no Hoare annotation [2020-07-08 16:24:40,329 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-08 16:24:40,329 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-08 16:24:40,329 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-08 16:24:40,329 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 16:24:40,329 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 16:24:40,330 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-08 16:24:40,330 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 16:24:40,330 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 16:24:40,330 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 16:24:40,330 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 16:24:40,330 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 16:24:40,330 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-08 16:24:40,330 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2020-07-08 16:24:40,331 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-08 16:24:40,331 WARN L170 areAnnotationChecker]: L22-5 has no Hoare annotation [2020-07-08 16:24:40,331 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2020-07-08 16:24:40,331 WARN L170 areAnnotationChecker]: L22-6 has no Hoare annotation [2020-07-08 16:24:40,331 WARN L170 areAnnotationChecker]: L22-8 has no Hoare annotation [2020-07-08 16:24:40,331 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 16:24:40,332 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 16:24:40,332 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 16:24:40,332 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 16:24:40,332 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-08 16:24:40,332 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-08 16:24:40,332 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 16:24:40,332 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-08 16:24:40,333 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-08 16:24:40,333 WARN L170 areAnnotationChecker]: L13-8 has no Hoare annotation [2020-07-08 16:24:40,333 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-08 16:24:40,333 WARN L170 areAnnotationChecker]: L13-9 has no Hoare annotation [2020-07-08 16:24:40,333 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 16:24:40,333 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 16:24:40,333 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 16:24:40,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 04:24:40 BoogieIcfgContainer [2020-07-08 16:24:40,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 16:24:40,340 INFO L168 Benchmark]: Toolchain (without parser) took 2966.91 ms. Allocated memory was 144.7 MB in the beginning and 246.9 MB in the end (delta: 102.2 MB). Free memory was 102.8 MB in the beginning and 196.0 MB in the end (delta: -93.2 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:40,341 INFO L168 Benchmark]: CDTParser took 0.30 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-08 16:24:40,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.96 ms. Allocated memory is still 144.7 MB. Free memory was 102.6 MB in the beginning and 92.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:40,344 INFO L168 Benchmark]: Boogie Preprocessor took 123.69 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.2 MB in the beginning and 179.9 MB in the end (delta: -87.6 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:40,346 INFO L168 Benchmark]: RCFGBuilder took 469.55 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 156.9 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:40,347 INFO L168 Benchmark]: TraceAbstraction took 2064.99 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 156.2 MB in the beginning and 196.0 MB in the end (delta: -39.8 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2020-07-08 16:24:40,354 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 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 301.96 ms. Allocated memory is still 144.7 MB. Free memory was 102.6 MB in the beginning and 92.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.69 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.2 MB in the beginning and 179.9 MB in the end (delta: -87.6 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.55 ms. Allocated memory is still 201.9 MB. Free memory was 179.9 MB in the beginning and 156.9 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2064.99 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 156.2 MB in the beginning and 196.0 MB in the end (delta: -39.8 MB). Peak memory consumption was 5.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; [L14] int n = __VERIFIER_nondet_int(); [L15] EXPR n ? &d1 : &d2 [L15] union dummy *pd = n ? &d1 : &d2; [L16] d1.a = __VERIFIER_nondet_int() [L17] COND FALSE !(pd == &d1) [L20] pd->b = 0 [L22] pd == &d2 && d1.a != 0 [L22] EXPR d1.a [L22] pd == &d2 && d1.a != 0 [L22] COND TRUE pd == &d2 && d1.a != 0 [L28] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 65 SDtfs, 87 SDslu, 84 SDs, 0 SdLazy, 109 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, 4 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: No data available, 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...