/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/mutex_lock_int.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:04:13,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:04:13,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:04:13,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:04:13,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:04:13,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:04:13,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:04:13,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:04:13,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:04:13,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:04:13,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:04:13,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:04:13,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:04:13,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:04:13,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:04:13,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:04:13,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:04:13,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:04:13,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:04:13,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:04:13,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:04:13,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:04:13,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:04:13,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:04:13,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:04:13,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:04:13,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:04:13,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:04:13,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:04:13,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:04:13,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:04:13,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:04:13,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:04:13,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:04:13,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:04:13,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:04:13,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:04:13,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:04:13,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:04:13,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:04:13,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:04:13,571 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:04:13,584 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:04:13,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:04:13,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:04:13,585 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:04:13,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:04:13,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:04:13,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:04:13,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:04:13,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:04:13,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:04:13,587 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:04:13,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:04:13,587 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:04:13,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:04:13,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:04:13,588 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:04:13,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:04:13,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:04:13,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:04:13,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:04:13,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:04:13,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:04:13,589 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:04:13,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:04:13,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:04:13,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:04:13,884 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:04:13,885 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:04:13,885 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/mutex_lock_int.c_1.i [2020-07-11 01:04:13,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71d42dde4/e7a6d02b9e1f47bea8a72ee1870b2925/FLAGede4aa8eb [2020-07-11 01:04:14,386 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:04:14,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/mutex_lock_int.c_1.i [2020-07-11 01:04:14,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71d42dde4/e7a6d02b9e1f47bea8a72ee1870b2925/FLAGede4aa8eb [2020-07-11 01:04:14,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71d42dde4/e7a6d02b9e1f47bea8a72ee1870b2925 [2020-07-11 01:04:14,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:04:14,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:04:14,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:04:14,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:04:14,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:04:14,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:04:14" (1/1) ... [2020-07-11 01:04:14,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172af72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:14, skipping insertion in model container [2020-07-11 01:04:14,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:04:14" (1/1) ... [2020-07-11 01:04:14,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:04:14,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:04:15,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:04:15,140 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:04:15,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:04:15,183 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:04:15,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15 WrapperNode [2020-07-11 01:04:15,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:04:15,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:04:15,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:04:15,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:04:15,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (1/1) ... [2020-07-11 01:04:15,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (1/1) ... [2020-07-11 01:04:15,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (1/1) ... [2020-07-11 01:04:15,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (1/1) ... [2020-07-11 01:04:15,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (1/1) ... [2020-07-11 01:04:15,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (1/1) ... [2020-07-11 01:04:15,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (1/1) ... [2020-07-11 01:04:15,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:04:15,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:04:15,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:04:15,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:04:15,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (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:04:15,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:04:15,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:04:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure err [2020-07-11 01:04:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2020-07-11 01:04:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2020-07-11 01:04:15,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:04:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:04:15,410 INFO L130 BoogieDeclarations]: Found specification of procedure err [2020-07-11 01:04:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2020-07-11 01:04:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:04:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:04:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2020-07-11 01:04:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:04:15,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 01:04:15,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:04:15,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:04:15,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:04:15,688 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:04:15,688 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 01:04:15,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:04:15 BoogieIcfgContainer [2020-07-11 01:04:15,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:04:15,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:04:15,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:04:15,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:04:15,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:04:14" (1/3) ... [2020-07-11 01:04:15,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c9900e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:04:15, skipping insertion in model container [2020-07-11 01:04:15,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:04:15" (2/3) ... [2020-07-11 01:04:15,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c9900e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:04:15, skipping insertion in model container [2020-07-11 01:04:15,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:04:15" (3/3) ... [2020-07-11 01:04:15,706 INFO L109 eAbstractionObserver]: Analyzing ICFG mutex_lock_int.c_1.i [2020-07-11 01:04:15,729 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:04:15,744 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:04:15,773 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:04:15,799 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:04:15,800 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:04:15,800 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:04:15,800 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:04:15,800 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:04:15,800 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:04:15,801 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:04:15,801 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:04:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-11 01:04:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-11 01:04:15,830 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:04:15,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:04:15,832 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:04:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:04:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1355543847, now seen corresponding path program 1 times [2020-07-11 01:04:15,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:04:15,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386783444] [2020-07-11 01:04:15,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:04:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:04:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:04:16,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {42#true} is VALID [2020-07-11 01:04:16,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} #valid := #valid[0 := 0]; {42#true} is VALID [2020-07-11 01:04:16,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} assume 0 < #StackHeapBarrier; {42#true} is VALID [2020-07-11 01:04:16,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-11 01:04:16,176 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {42#true} {42#true} #48#return; {42#true} is VALID [2020-07-11 01:04:16,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {53#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:04:16,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {53#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {42#true} is VALID [2020-07-11 01:04:16,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} #valid := #valid[0 := 0]; {42#true} is VALID [2020-07-11 01:04:16,181 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#true} assume 0 < #StackHeapBarrier; {42#true} is VALID [2020-07-11 01:04:16,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-11 01:04:16,182 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#true} {42#true} #48#return; {42#true} is VALID [2020-07-11 01:04:16,183 INFO L263 TraceCheckUtils]: 6: Hoare triple {42#true} call #t~ret2 := main(); {42#true} is VALID [2020-07-11 01:04:16,183 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#true} SUMMARY for call ~#m~0.base, ~#m~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {42#true} is VALID [2020-07-11 01:04:16,185 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#true} SUMMARY for call write~int(0, ~#m~0.base, ~#m~0.offset, 4); srcloc: L30 {49#(= 0 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} is VALID [2020-07-11 01:04:16,188 INFO L263 TraceCheckUtils]: 9: Hoare triple {49#(= 0 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} call mutex_lock(~#m~0.base, ~#m~0.offset); {50#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 0)} is VALID [2020-07-11 01:04:16,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 0)} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {51#(= 0 (select (select |#memory_int| mutex_lock_~a.base) mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:16,191 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#(= 0 (select (select |#memory_int| mutex_lock_~a.base) mutex_lock_~a.offset))} SUMMARY for call #t~mem0 := read~int(~a.base, ~a.offset, 4); srcloc: L18 {52#(= 0 |mutex_lock_#t~mem0|)} is VALID [2020-07-11 01:04:16,192 INFO L280 TraceCheckUtils]: 12: Hoare triple {52#(= 0 |mutex_lock_#t~mem0|)} assume 1 == #t~mem0; {43#false} is VALID [2020-07-11 01:04:16,193 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#false} havoc #t~mem0; {43#false} is VALID [2020-07-11 01:04:16,193 INFO L263 TraceCheckUtils]: 14: Hoare triple {43#false} call err(); {43#false} is VALID [2020-07-11 01:04:16,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#false} assume !false; {43#false} is VALID [2020-07-11 01:04:16,197 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:04:16,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386783444] [2020-07-11 01:04:16,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:04:16,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:04:16,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161358936] [2020-07-11 01:04:16,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-11 01:04:16,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:04:16,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:04:16,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:04:16,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:04:16,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:04:16,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:04:16,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:04:16,303 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 7 states. [2020-07-11 01:04:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:04:16,944 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-11 01:04:16,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 01:04:16,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-11 01:04:16,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:04:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:04:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-11 01:04:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:04:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-11 01:04:16,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-11 01:04:17,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:04:17,083 INFO L225 Difference]: With dead ends: 60 [2020-07-11 01:04:17,083 INFO L226 Difference]: Without dead ends: 25 [2020-07-11 01:04:17,087 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:04:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-11 01:04:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-11 01:04:17,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:04:17,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-11 01:04:17,178 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-11 01:04:17,178 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-11 01:04:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:04:17,182 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-11 01:04:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-11 01:04:17,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:04:17,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:04:17,184 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-11 01:04:17,184 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-11 01:04:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:04:17,187 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-11 01:04:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-11 01:04:17,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:04:17,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:04:17,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:04:17,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:04:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-11 01:04:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2020-07-11 01:04:17,193 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 16 [2020-07-11 01:04:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:04:17,194 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2020-07-11 01:04:17,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:04:17,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 24 transitions. [2020-07-11 01:04:17,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:04:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-11 01:04:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 01:04:17,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:04:17,234 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] [2020-07-11 01:04:17,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:04:17,234 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:04:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:04:17,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1044574925, now seen corresponding path program 1 times [2020-07-11 01:04:17,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:04:17,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2036373504] [2020-07-11 01:04:17,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:04:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:04:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:04:17,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {300#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {282#true} is VALID [2020-07-11 01:04:17,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} #valid := #valid[0 := 0]; {282#true} is VALID [2020-07-11 01:04:17,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-11 01:04:17,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-11 01:04:17,356 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-11 01:04:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:04:17,435 INFO L280 TraceCheckUtils]: 0: Hoare triple {301#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:17,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} SUMMARY for call #t~mem0 := read~int(~a.base, ~a.offset, 4); srcloc: L18 {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:17,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} assume !(1 == #t~mem0); {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:17,439 INFO L280 TraceCheckUtils]: 3: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} havoc #t~mem0; {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:17,440 INFO L280 TraceCheckUtils]: 4: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} SUMMARY for call write~int(1, ~a.base, ~a.offset, 4); srcloc: L18-6 {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} is VALID [2020-07-11 01:04:17,442 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} assume true; {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} is VALID [2020-07-11 01:04:17,443 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} {282#true} #52#return; {296#(= 1 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} is VALID [2020-07-11 01:04:17,445 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {300#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:04:17,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {282#true} is VALID [2020-07-11 01:04:17,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} #valid := #valid[0 := 0]; {282#true} is VALID [2020-07-11 01:04:17,447 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-11 01:04:17,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-11 01:04:17,447 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-11 01:04:17,448 INFO L263 TraceCheckUtils]: 6: Hoare triple {282#true} call #t~ret2 := main(); {282#true} is VALID [2020-07-11 01:04:17,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {282#true} SUMMARY for call ~#m~0.base, ~#m~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {282#true} is VALID [2020-07-11 01:04:17,448 INFO L280 TraceCheckUtils]: 8: Hoare triple {282#true} SUMMARY for call write~int(0, ~#m~0.base, ~#m~0.offset, 4); srcloc: L30 {282#true} is VALID [2020-07-11 01:04:17,450 INFO L263 TraceCheckUtils]: 9: Hoare triple {282#true} call mutex_lock(~#m~0.base, ~#m~0.offset); {301#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 01:04:17,451 INFO L280 TraceCheckUtils]: 10: Hoare triple {301#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:17,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} SUMMARY for call #t~mem0 := read~int(~a.base, ~a.offset, 4); srcloc: L18 {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:17,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} assume !(1 == #t~mem0); {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:17,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} havoc #t~mem0; {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-11 01:04:17,457 INFO L280 TraceCheckUtils]: 14: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} SUMMARY for call write~int(1, ~a.base, ~a.offset, 4); srcloc: L18-6 {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} is VALID [2020-07-11 01:04:17,458 INFO L280 TraceCheckUtils]: 15: Hoare triple {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} assume true; {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} is VALID [2020-07-11 01:04:17,460 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} {282#true} #52#return; {296#(= 1 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} is VALID [2020-07-11 01:04:17,462 INFO L263 TraceCheckUtils]: 17: Hoare triple {296#(= 1 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} call mutex_unlock(~#m~0.base, ~#m~0.offset); {297#(= (select (select |#memory_int| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|) 1)} is VALID [2020-07-11 01:04:17,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {297#(= (select (select |#memory_int| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|) 1)} ~b.base, ~b.offset := #in~b.base, #in~b.offset; {298#(= 1 (select (select |#memory_int| mutex_unlock_~b.base) mutex_unlock_~b.offset))} is VALID [2020-07-11 01:04:17,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {298#(= 1 (select (select |#memory_int| mutex_unlock_~b.base) mutex_unlock_~b.offset))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset, 4); srcloc: L24 {299#(= 1 |mutex_unlock_#t~mem1|)} is VALID [2020-07-11 01:04:17,466 INFO L280 TraceCheckUtils]: 20: Hoare triple {299#(= 1 |mutex_unlock_#t~mem1|)} assume 1 != #t~mem1; {283#false} is VALID [2020-07-11 01:04:17,466 INFO L280 TraceCheckUtils]: 21: Hoare triple {283#false} havoc #t~mem1; {283#false} is VALID [2020-07-11 01:04:17,466 INFO L263 TraceCheckUtils]: 22: Hoare triple {283#false} call err(); {283#false} is VALID [2020-07-11 01:04:17,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-11 01:04:17,469 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:04:17,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2036373504] [2020-07-11 01:04:17,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:04:17,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 01:04:17,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694599181] [2020-07-11 01:04:17,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-11 01:04:17,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:04:17,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 01:04:17,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:04:17,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 01:04:17,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:04:17,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 01:04:17,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:04:17,510 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 10 states. [2020-07-11 01:04:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:04:18,140 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-11 01:04:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 01:04:18,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-11 01:04:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:04:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:04:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2020-07-11 01:04:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:04:18,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2020-07-11 01:04:18,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2020-07-11 01:04:18,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:04:18,182 INFO L225 Difference]: With dead ends: 25 [2020-07-11 01:04:18,182 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 01:04:18,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:04:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 01:04:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 01:04:18,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:04:18,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 01:04:18,184 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:04:18,185 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:04:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:04:18,185 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:04:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:04:18,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:04:18,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:04:18,186 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 01:04:18,186 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 01:04:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:04:18,187 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 01:04:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:04:18,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:04:18,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:04:18,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:04:18,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:04:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 01:04:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 01:04:18,188 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-11 01:04:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:04:18,189 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 01:04:18,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 01:04:18,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 01:04:18,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:04:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 01:04:18,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:04:18,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:04:18,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 01:04:18,740 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (and (= 1 (select (select |#memory_int| mutex_unlock_~b.base) mutex_unlock_~b.offset)) (= |#memory_int| |old(#memory_int)|)) (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|)))) [2020-07-11 01:04:18,740 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|))) (and (= 1 |mutex_unlock_#t~mem1|) (= 1 (select (select |#memory_int| mutex_unlock_~b.base) mutex_unlock_~b.offset)) (= |#memory_int| |old(#memory_int)|))) [2020-07-11 01:04:18,741 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|))) [2020-07-11 01:04:18,741 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|))) [2020-07-11 01:04:18,741 INFO L271 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: true [2020-07-11 01:04:18,741 INFO L271 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: true [2020-07-11 01:04:18,741 INFO L264 CegarLoopResult]: At program point mutex_unlockENTRY(lines 22 26) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|))) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 01:04:18,741 INFO L271 CegarLoopResult]: At program point mutex_unlockEXIT(lines 22 26) the Hoare annotation is: true [2020-07-11 01:04:18,742 INFO L271 CegarLoopResult]: At program point mutex_unlockFINAL(lines 22 26) the Hoare annotation is: true [2020-07-11 01:04:18,742 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:04:18,742 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-11 01:04:18,742 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:04:18,742 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-11 01:04:18,743 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:04:18,743 INFO L271 CegarLoopResult]: At program point errErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: true [2020-07-11 01:04:18,743 INFO L271 CegarLoopResult]: At program point errEXIT(lines 13 14) the Hoare annotation is: true [2020-07-11 01:04:18,743 INFO L271 CegarLoopResult]: At program point errENTRY(lines 13 14) the Hoare annotation is: true [2020-07-11 01:04:18,743 INFO L271 CegarLoopResult]: At program point errFINAL(lines 13 14) the Hoare annotation is: true [2020-07-11 01:04:18,744 INFO L264 CegarLoopResult]: At program point mutex_lockENTRY(lines 16 20) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-11 01:04:18,744 INFO L264 CegarLoopResult]: At program point mutex_lockEXIT(lines 16 20) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-11 01:04:18,744 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-11 01:04:18,744 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset) (= 0 |mutex_lock_#t~mem0|) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-11 01:04:18,745 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))) [2020-07-11 01:04:18,745 INFO L264 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))) [2020-07-11 01:04:18,745 INFO L264 CegarLoopResult]: At program point L18-5(line 18) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset) (= 0 |mutex_lock_#t~mem0|) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-11 01:04:18,745 INFO L264 CegarLoopResult]: At program point L18-6(line 18) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-11 01:04:18,745 INFO L264 CegarLoopResult]: At program point mutex_lockFINAL(lines 16 20) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-11 01:04:18,746 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 01:04:18,746 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 01:04:18,746 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 01:04:18,746 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 01:04:18,746 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (= 1 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) [2020-07-11 01:04:18,746 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (= 0 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) [2020-07-11 01:04:18,747 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-11 01:04:18,747 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 28 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 01:04:18,747 INFO L271 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-07-11 01:04:18,747 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 28 40) the Hoare annotation is: true [2020-07-11 01:04:18,747 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 28 40) the Hoare annotation is: true [2020-07-11 01:04:18,748 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-11 01:04:18,767 INFO L163 areAnnotationChecker]: CFG has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:04:18,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-11 01:04:18,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-11 01:04:18,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:04:18 BoogieIcfgContainer [2020-07-11 01:04:18,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:04:18,787 INFO L168 Benchmark]: Toolchain (without parser) took 3959.78 ms. Allocated memory was 143.7 MB in the beginning and 251.1 MB in the end (delta: 107.5 MB). Free memory was 101.7 MB in the beginning and 212.0 MB in the end (delta: -110.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 01:04:18,788 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 01:04:18,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.49 ms. Allocated memory is still 143.7 MB. Free memory was 101.2 MB in the beginning and 91.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:04:18,790 INFO L168 Benchmark]: Boogie Preprocessor took 143.06 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 91.4 MB in the beginning and 178.6 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-11 01:04:18,791 INFO L168 Benchmark]: RCFGBuilder took 365.10 ms. Allocated memory is still 200.8 MB. Free memory was 178.6 MB in the beginning and 159.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2020-07-11 01:04:18,792 INFO L168 Benchmark]: TraceAbstraction took 3089.21 ms. Allocated memory was 200.8 MB in the beginning and 251.1 MB in the end (delta: 50.3 MB). Free memory was 158.4 MB in the beginning and 212.0 MB in the end (delta: -53.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 01:04:18,795 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.25 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 353.49 ms. Allocated memory is still 143.7 MB. Free memory was 101.2 MB in the beginning and 91.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.06 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 91.4 MB in the beginning and 178.6 MB in the end (delta: -87.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 365.10 ms. Allocated memory is still 200.8 MB. Free memory was 178.6 MB in the beginning and 159.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3089.21 ms. Allocated memory was 200.8 MB in the beginning and 251.1 MB in the end (delta: 50.3 MB). Free memory was 158.4 MB in the beginning and 212.0 MB in the end (delta: -53.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 22]: Procedure Contract for mutex_unlock Derived contract for procedure mutex_unlock: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for err Derived contract for procedure err: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for mutex_lock [2020-07-11 01:04:18,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-11 01:04:18,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-11 01:04:18,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-11 01:04:18,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure mutex_lock: ((a == a && unknown-#memory_int-unknown[a][a] == 1) && a == a) || !(0 == \old(unknown-#memory_int-unknown)[a][a]) - ProcedureContractResult [Line: 28]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.3s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 42 SDtfs, 43 SDslu, 89 SDs, 0 SdLazy, 179 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 56 PreInvPairs, 69 NumberOfFragments, 281 HoareAnnotationTreeSize, 56 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 39 FomulaSimplificationsInter, 265 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 2730 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 correct! Received shutdown request...