java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:56:04,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:56:04,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:56:04,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:56:04,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:56:04,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:56:04,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:56:04,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:56:04,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:56:04,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:56:04,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:56:04,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:56:04,583 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:56:04,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:56:04,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:56:04,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:56:04,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:56:04,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:56:04,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:56:04,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:56:04,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:56:04,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:56:04,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:56:04,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:56:04,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:56:04,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:56:04,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:56:04,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:56:04,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:56:04,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:56:04,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:56:04,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:56:04,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:56:04,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:56:04,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:56:04,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:56:04,607 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:56:04,629 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:56:04,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:56:04,630 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:56:04,631 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:56:04,632 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:56:04,632 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:56:04,633 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:56:04,633 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:56:04,633 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:56:04,633 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:56:04,633 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:56:04,634 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:56:04,634 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:56:04,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:56:04,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:56:04,635 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:56:04,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:56:04,635 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:56:04,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:56:04,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:56:04,636 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:56:04,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:56:04,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:56:04,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:56:04,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:56:04,637 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:56:04,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:56:04,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:56:04,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:56:04,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:56:04,638 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:56:04,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:56:04,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:56:04,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:56:04,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:56:04,713 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:56:04,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock_false-unreach-call.i [2018-11-23 12:56:04,788 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64f306b3/88194dc3388b4c09ac97a03cada2a88b/FLAG49096f394 [2018-11-23 12:56:05,292 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:56:05,293 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_unlock_false-unreach-call.i [2018-11-23 12:56:05,309 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64f306b3/88194dc3388b4c09ac97a03cada2a88b/FLAG49096f394 [2018-11-23 12:56:05,574 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e64f306b3/88194dc3388b4c09ac97a03cada2a88b [2018-11-23 12:56:05,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:56:05,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:56:05,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:05,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:56:05,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:56:05,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:05" (1/1) ... [2018-11-23 12:56:05,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17278fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:05, skipping insertion in model container [2018-11-23 12:56:05,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:05" (1/1) ... [2018-11-23 12:56:05,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:56:05,687 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:56:06,168 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:06,183 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:56:06,400 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:06,486 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:56:06,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06 WrapperNode [2018-11-23 12:56:06,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:06,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:06,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:56:06,488 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:56:06,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:06,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:56:06,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:56:06,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:56:06,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (1/1) ... [2018-11-23 12:56:06,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:56:06,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:56:06,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:56:06,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:56:06,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (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 [2018-11-23 12:56:06,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:56:06,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-23 12:56:06,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-23 12:56:06,684 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-11-23 12:56:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-11-23 12:56:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2018-11-23 12:56:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2018-11-23 12:56:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-11-23 12:56:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-11-23 12:56:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2018-11-23 12:56:06,686 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2018-11-23 12:56:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-11-23 12:56:06,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-11-23 12:56:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:56:06,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:56:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-23 12:56:06,687 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-11-23 12:56:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:56:06,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:56:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:56:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2018-11-23 12:56:06,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2018-11-23 12:56:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2018-11-23 12:56:06,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2018-11-23 12:56:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2018-11-23 12:56:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2018-11-23 12:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 12:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 12:56:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 12:56:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-11-23 12:56:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-11-23 12:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2018-11-23 12:56:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2018-11-23 12:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-23 12:56:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-23 12:56:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2018-11-23 12:56:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2018-11-23 12:56:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:56:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:56:07,943 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:56:07,943 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:56:07,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:07 BoogieIcfgContainer [2018-11-23 12:56:07,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:56:07,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:56:07,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:56:07,949 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:56:07,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:56:05" (1/3) ... [2018-11-23 12:56:07,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d51b932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:07, skipping insertion in model container [2018-11-23 12:56:07,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:06" (2/3) ... [2018-11-23 12:56:07,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d51b932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:56:07, skipping insertion in model container [2018-11-23 12:56:07,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:07" (3/3) ... [2018-11-23 12:56:07,953 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_unlock_false-unreach-call.i [2018-11-23 12:56:07,964 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:56:07,974 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 12:56:07,994 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 12:56:08,029 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:56:08,030 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:56:08,031 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:56:08,031 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:56:08,031 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:56:08,031 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:56:08,031 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:56:08,031 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:56:08,033 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:56:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-11-23 12:56:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:56:08,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:08,070 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-23 12:56:08,073 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:08,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:08,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1594759354, now seen corresponding path program 1 times [2018-11-23 12:56:08,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:08,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:08,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {104#true} call ULTIMATE.init(); {104#true} is VALID [2018-11-23 12:56:08,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {104#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); {104#true} is VALID [2018-11-23 12:56:08,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {104#true} assume true; {104#true} is VALID [2018-11-23 12:56:08,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {104#true} {104#true} #175#return; {104#true} is VALID [2018-11-23 12:56:08,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {104#true} call #t~ret32 := main(); {104#true} is VALID [2018-11-23 12:56:08,366 INFO L256 TraceCheckUtils]: 5: Hoare triple {104#true} call foo(); {104#true} is VALID [2018-11-23 12:56:08,366 INFO L256 TraceCheckUtils]: 6: Hoare triple {104#true} call ldv_initialize(); {104#true} is VALID [2018-11-23 12:56:08,366 INFO L273 TraceCheckUtils]: 7: Hoare triple {104#true} assume true; {104#true} is VALID [2018-11-23 12:56:08,367 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {104#true} {104#true} #135#return; {104#true} is VALID [2018-11-23 12:56:08,367 INFO L256 TraceCheckUtils]: 9: Hoare triple {104#true} call #t~ret30.base, #t~ret30.offset := ldv_successful_malloc(8); {104#true} is VALID [2018-11-23 12:56:08,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {104#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {104#true} is VALID [2018-11-23 12:56:08,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {104#true} assume true; {104#true} is VALID [2018-11-23 12:56:08,368 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {104#true} {104#true} #137#return; {104#true} is VALID [2018-11-23 12:56:08,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {104#true} ~m1~0.base, ~m1~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {104#true} is VALID [2018-11-23 12:56:08,369 INFO L256 TraceCheckUtils]: 14: Hoare triple {104#true} call #t~ret31.base, #t~ret31.offset := ldv_successful_malloc(8); {104#true} is VALID [2018-11-23 12:56:08,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {104#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {104#true} is VALID [2018-11-23 12:56:08,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {104#true} assume true; {104#true} is VALID [2018-11-23 12:56:08,371 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {104#true} {104#true} #139#return; {104#true} is VALID [2018-11-23 12:56:08,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {104#true} ~m2~0.base, ~m2~0.offset := #t~ret31.base, #t~ret31.offset;havoc #t~ret31.base, #t~ret31.offset; {104#true} is VALID [2018-11-23 12:56:08,371 INFO L256 TraceCheckUtils]: 19: Hoare triple {104#true} call mutex_lock(~m1~0.base, ~m1~0.offset); {104#true} is VALID [2018-11-23 12:56:08,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {104#true} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {104#true} is VALID [2018-11-23 12:56:08,372 INFO L256 TraceCheckUtils]: 21: Hoare triple {104#true} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {104#true} is VALID [2018-11-23 12:56:08,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {104#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {104#true} is VALID [2018-11-23 12:56:08,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {104#true} assume !true; {105#false} is VALID [2018-11-23 12:56:08,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {105#false} #res := 0; {105#false} is VALID [2018-11-23 12:56:08,387 INFO L273 TraceCheckUtils]: 25: Hoare triple {105#false} assume true; {105#false} is VALID [2018-11-23 12:56:08,387 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {105#false} {104#true} #165#return; {105#false} is VALID [2018-11-23 12:56:08,388 INFO L273 TraceCheckUtils]: 27: Hoare triple {105#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {105#false} is VALID [2018-11-23 12:56:08,388 INFO L273 TraceCheckUtils]: 28: Hoare triple {105#false} assume 0 != #t~ret27;havoc #t~ret27; {105#false} is VALID [2018-11-23 12:56:08,388 INFO L273 TraceCheckUtils]: 29: Hoare triple {105#false} assume !false; {105#false} is VALID [2018-11-23 12:56:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:56:08,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:08,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:56:08,405 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-23 12:56:08,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:08,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:56:08,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:08,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:56:08,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:56:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:56:08,624 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-11-23 12:56:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:09,520 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2018-11-23 12:56:09,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:56:09,520 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-23 12:56:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:56:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 225 transitions. [2018-11-23 12:56:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:56:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 225 transitions. [2018-11-23 12:56:09,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 225 transitions. [2018-11-23 12:56:10,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:10,222 INFO L225 Difference]: With dead ends: 188 [2018-11-23 12:56:10,222 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:56:10,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:56:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:56:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 12:56:10,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:10,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-23 12:56:10,351 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 12:56:10,351 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 12:56:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:10,368 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-23 12:56:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-23 12:56:10,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:10,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:10,372 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-23 12:56:10,372 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-23 12:56:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:10,395 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-23 12:56:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-23 12:56:10,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:10,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:10,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:10,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:56:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-23 12:56:10,412 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 30 [2018-11-23 12:56:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:10,413 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-23 12:56:10,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:56:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-23 12:56:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:56:10,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:10,415 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-23 12:56:10,415 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:10,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1879861572, now seen corresponding path program 1 times [2018-11-23 12:56:10,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:10,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:10,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:10,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:10,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {680#true} call ULTIMATE.init(); {680#true} is VALID [2018-11-23 12:56:10,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {680#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); {680#true} is VALID [2018-11-23 12:56:10,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {680#true} assume true; {680#true} is VALID [2018-11-23 12:56:10,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {680#true} {680#true} #175#return; {680#true} is VALID [2018-11-23 12:56:10,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {680#true} call #t~ret32 := main(); {680#true} is VALID [2018-11-23 12:56:10,555 INFO L256 TraceCheckUtils]: 5: Hoare triple {680#true} call foo(); {680#true} is VALID [2018-11-23 12:56:10,555 INFO L256 TraceCheckUtils]: 6: Hoare triple {680#true} call ldv_initialize(); {680#true} is VALID [2018-11-23 12:56:10,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {680#true} assume true; {680#true} is VALID [2018-11-23 12:56:10,556 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {680#true} {680#true} #135#return; {680#true} is VALID [2018-11-23 12:56:10,556 INFO L256 TraceCheckUtils]: 9: Hoare triple {680#true} call #t~ret30.base, #t~ret30.offset := ldv_successful_malloc(8); {680#true} is VALID [2018-11-23 12:56:10,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {680#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {680#true} is VALID [2018-11-23 12:56:10,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#true} assume true; {680#true} is VALID [2018-11-23 12:56:10,557 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {680#true} {680#true} #137#return; {680#true} is VALID [2018-11-23 12:56:10,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {680#true} ~m1~0.base, ~m1~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {680#true} is VALID [2018-11-23 12:56:10,557 INFO L256 TraceCheckUtils]: 14: Hoare triple {680#true} call #t~ret31.base, #t~ret31.offset := ldv_successful_malloc(8); {680#true} is VALID [2018-11-23 12:56:10,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {680#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {680#true} is VALID [2018-11-23 12:56:10,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#true} assume true; {680#true} is VALID [2018-11-23 12:56:10,558 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {680#true} {680#true} #139#return; {680#true} is VALID [2018-11-23 12:56:10,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {680#true} ~m2~0.base, ~m2~0.offset := #t~ret31.base, #t~ret31.offset;havoc #t~ret31.base, #t~ret31.offset; {680#true} is VALID [2018-11-23 12:56:10,559 INFO L256 TraceCheckUtils]: 19: Hoare triple {680#true} call mutex_lock(~m1~0.base, ~m1~0.offset); {680#true} is VALID [2018-11-23 12:56:10,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#true} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {680#true} is VALID [2018-11-23 12:56:10,559 INFO L256 TraceCheckUtils]: 21: Hoare triple {680#true} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {680#true} is VALID [2018-11-23 12:56:10,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {680#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {680#true} is VALID [2018-11-23 12:56:10,560 INFO L273 TraceCheckUtils]: 23: Hoare triple {680#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {680#true} is VALID [2018-11-23 12:56:10,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {680#true} #res := 0; {682#(= 0 |ldv_is_in_set_#res|)} is VALID [2018-11-23 12:56:10,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {682#(= 0 |ldv_is_in_set_#res|)} assume true; {682#(= 0 |ldv_is_in_set_#res|)} is VALID [2018-11-23 12:56:10,569 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {682#(= 0 |ldv_is_in_set_#res|)} {680#true} #165#return; {683#(= |mutex_lock_#t~ret27| 0)} is VALID [2018-11-23 12:56:10,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {683#(= |mutex_lock_#t~ret27| 0)} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {683#(= |mutex_lock_#t~ret27| 0)} is VALID [2018-11-23 12:56:10,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {683#(= |mutex_lock_#t~ret27| 0)} assume 0 != #t~ret27;havoc #t~ret27; {681#false} is VALID [2018-11-23 12:56:10,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {681#false} assume !false; {681#false} is VALID [2018-11-23 12:56:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:56:10,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:10,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:56:10,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 12:56:10,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:10,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:56:10,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:10,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:56:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:56:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:56:10,696 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2018-11-23 12:56:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:11,210 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-11-23 12:56:11,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:56:11,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 12:56:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:56:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2018-11-23 12:56:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:56:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2018-11-23 12:56:11,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 110 transitions. [2018-11-23 12:56:11,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:11,412 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:56:11,412 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:56:11,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:56:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:56:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-23 12:56:11,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:11,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2018-11-23 12:56:11,483 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:56:11,483 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:56:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:11,491 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-11-23 12:56:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-23 12:56:11,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:11,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:11,494 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2018-11-23 12:56:11,494 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2018-11-23 12:56:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:11,501 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-11-23 12:56:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-23 12:56:11,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:11,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:11,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:11,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 12:56:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-11-23 12:56:11,510 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-11-23 12:56:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:11,510 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-11-23 12:56:11,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:56:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-23 12:56:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:56:11,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:11,512 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-23 12:56:11,513 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:11,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:11,513 INFO L82 PathProgramCache]: Analyzing trace with hash -305258267, now seen corresponding path program 1 times [2018-11-23 12:56:11,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:11,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:11,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:11,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {1150#true} call ULTIMATE.init(); {1150#true} is VALID [2018-11-23 12:56:11,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {1150#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} assume true; {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} {1150#true} #175#return; {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call #t~ret32 := main(); {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,824 INFO L256 TraceCheckUtils]: 5: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call foo(); {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,824 INFO L256 TraceCheckUtils]: 6: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call ldv_initialize(); {1150#true} is VALID [2018-11-23 12:56:11,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {1150#true} assume true; {1150#true} is VALID [2018-11-23 12:56:11,825 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1150#true} {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #135#return; {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,825 INFO L256 TraceCheckUtils]: 9: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call #t~ret30.base, #t~ret30.offset := ldv_successful_malloc(8); {1150#true} is VALID [2018-11-23 12:56:11,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {1150#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {1150#true} is VALID [2018-11-23 12:56:11,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {1150#true} assume true; {1150#true} is VALID [2018-11-23 12:56:11,827 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1150#true} {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #137#return; {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} ~m1~0.base, ~m1~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,828 INFO L256 TraceCheckUtils]: 14: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call #t~ret31.base, #t~ret31.offset := ldv_successful_malloc(8); {1150#true} is VALID [2018-11-23 12:56:11,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {1150#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {1150#true} is VALID [2018-11-23 12:56:11,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {1150#true} assume true; {1150#true} is VALID [2018-11-23 12:56:11,830 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1150#true} {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #139#return; {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} ~m2~0.base, ~m2~0.offset := #t~ret31.base, #t~ret31.offset;havoc #t~ret31.base, #t~ret31.offset; {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,832 INFO L256 TraceCheckUtils]: 19: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call mutex_lock(~m1~0.base, ~m1~0.offset); {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:11,833 INFO L256 TraceCheckUtils]: 21: Hoare triple {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {1150#true} is VALID [2018-11-23 12:56:11,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {1150#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {1153#(and (= ldv_is_in_set_~s.base |ldv_is_in_set_#in~s.base|) (<= (+ ldv_is_in_set_~m~1.offset 4) (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (<= (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset) (+ ldv_is_in_set_~m~1.offset 4)) (= ldv_is_in_set_~s.offset |ldv_is_in_set_#in~s.offset|) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)))} is VALID [2018-11-23 12:56:11,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {1153#(and (= ldv_is_in_set_~s.base |ldv_is_in_set_#in~s.base|) (<= (+ ldv_is_in_set_~m~1.offset 4) (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (<= (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset) (+ ldv_is_in_set_~m~1.offset 4)) (= ldv_is_in_set_~s.offset |ldv_is_in_set_#in~s.offset|) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)))} assume !!(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~m~1.base, ~m~1.offset, 4); {1154#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} is VALID [2018-11-23 12:56:11,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {1154#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} assume #t~mem25.base == ~e.base && #t~mem25.offset == ~e.offset;havoc #t~mem25.base, #t~mem25.offset;#res := 1; {1154#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} is VALID [2018-11-23 12:56:11,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {1154#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} assume true; {1154#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} is VALID [2018-11-23 12:56:11,841 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1154#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} {1152#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #165#return; {1151#false} is VALID [2018-11-23 12:56:11,842 INFO L273 TraceCheckUtils]: 27: Hoare triple {1151#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {1151#false} is VALID [2018-11-23 12:56:11,842 INFO L273 TraceCheckUtils]: 28: Hoare triple {1151#false} assume 0 != #t~ret27;havoc #t~ret27; {1151#false} is VALID [2018-11-23 12:56:11,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {1151#false} assume !false; {1151#false} is VALID [2018-11-23 12:56:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:56:11,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:11,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:11,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 12:56:11,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:11,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:56:11,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:11,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:56:11,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:11,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:11,929 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 5 states. [2018-11-23 12:56:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:14,312 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2018-11-23 12:56:14,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:56:14,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 12:56:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 295 transitions. [2018-11-23 12:56:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 295 transitions. [2018-11-23 12:56:14,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 295 transitions. [2018-11-23 12:56:14,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:14,964 INFO L225 Difference]: With dead ends: 257 [2018-11-23 12:56:14,964 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 12:56:14,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:56:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 12:56:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2018-11-23 12:56:15,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:15,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 140 states. [2018-11-23 12:56:15,206 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 140 states. [2018-11-23 12:56:15,207 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 140 states. [2018-11-23 12:56:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:15,220 INFO L93 Difference]: Finished difference Result 175 states and 210 transitions. [2018-11-23 12:56:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 210 transitions. [2018-11-23 12:56:15,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:15,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:15,223 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 175 states. [2018-11-23 12:56:15,223 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 175 states. [2018-11-23 12:56:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:15,233 INFO L93 Difference]: Finished difference Result 175 states and 210 transitions. [2018-11-23 12:56:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 210 transitions. [2018-11-23 12:56:15,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:15,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:15,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:15,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 12:56:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2018-11-23 12:56:15,243 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 30 [2018-11-23 12:56:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:15,243 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2018-11-23 12:56:15,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2018-11-23 12:56:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:56:15,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:15,246 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 12:56:15,247 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:15,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1875239642, now seen corresponding path program 1 times [2018-11-23 12:56:15,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:15,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:15,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:15,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:15,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:15,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {2066#true} call ULTIMATE.init(); {2066#true} is VALID [2018-11-23 12:56:15,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {2066#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); {2066#true} is VALID [2018-11-23 12:56:15,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2066#true} {2066#true} #175#return; {2066#true} is VALID [2018-11-23 12:56:15,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {2066#true} call #t~ret32 := main(); {2066#true} is VALID [2018-11-23 12:56:15,382 INFO L256 TraceCheckUtils]: 5: Hoare triple {2066#true} call foo(); {2066#true} is VALID [2018-11-23 12:56:15,382 INFO L256 TraceCheckUtils]: 6: Hoare triple {2066#true} call ldv_initialize(); {2066#true} is VALID [2018-11-23 12:56:15,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,383 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {2066#true} {2066#true} #135#return; {2066#true} is VALID [2018-11-23 12:56:15,383 INFO L256 TraceCheckUtils]: 9: Hoare triple {2066#true} call #t~ret30.base, #t~ret30.offset := ldv_successful_malloc(8); {2066#true} is VALID [2018-11-23 12:56:15,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {2066#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {2066#true} is VALID [2018-11-23 12:56:15,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,384 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2066#true} {2066#true} #137#return; {2066#true} is VALID [2018-11-23 12:56:15,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {2066#true} ~m1~0.base, ~m1~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2066#true} is VALID [2018-11-23 12:56:15,384 INFO L256 TraceCheckUtils]: 14: Hoare triple {2066#true} call #t~ret31.base, #t~ret31.offset := ldv_successful_malloc(8); {2066#true} is VALID [2018-11-23 12:56:15,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {2066#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {2066#true} is VALID [2018-11-23 12:56:15,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,385 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2066#true} {2066#true} #139#return; {2066#true} is VALID [2018-11-23 12:56:15,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {2066#true} ~m2~0.base, ~m2~0.offset := #t~ret31.base, #t~ret31.offset;havoc #t~ret31.base, #t~ret31.offset; {2066#true} is VALID [2018-11-23 12:56:15,386 INFO L256 TraceCheckUtils]: 19: Hoare triple {2066#true} call mutex_lock(~m1~0.base, ~m1~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {2066#true} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {2066#true} is VALID [2018-11-23 12:56:15,386 INFO L256 TraceCheckUtils]: 21: Hoare triple {2066#true} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {2066#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2066#true} is VALID [2018-11-23 12:56:15,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {2066#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {2066#true} #res := 0; {2066#true} is VALID [2018-11-23 12:56:15,387 INFO L273 TraceCheckUtils]: 25: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,388 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2066#true} {2066#true} #165#return; {2066#true} is VALID [2018-11-23 12:56:15,388 INFO L273 TraceCheckUtils]: 27: Hoare triple {2066#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {2066#true} is VALID [2018-11-23 12:56:15,388 INFO L273 TraceCheckUtils]: 28: Hoare triple {2066#true} assume !(0 != #t~ret27);havoc #t~ret27; {2066#true} is VALID [2018-11-23 12:56:15,389 INFO L256 TraceCheckUtils]: 29: Hoare triple {2066#true} call ldv_set_add(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {2066#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset; {2066#true} is VALID [2018-11-23 12:56:15,389 INFO L256 TraceCheckUtils]: 31: Hoare triple {2066#true} call #t~ret17 := ldv_is_in_set(~new.base, ~new.offset, ~s.base, ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,389 INFO L273 TraceCheckUtils]: 32: Hoare triple {2066#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2066#true} is VALID [2018-11-23 12:56:15,390 INFO L273 TraceCheckUtils]: 33: Hoare triple {2066#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {2066#true} #res := 0; {2068#(= 0 |ldv_is_in_set_#res|)} is VALID [2018-11-23 12:56:15,400 INFO L273 TraceCheckUtils]: 35: Hoare triple {2068#(= 0 |ldv_is_in_set_#res|)} assume true; {2068#(= 0 |ldv_is_in_set_#res|)} is VALID [2018-11-23 12:56:15,404 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2068#(= 0 |ldv_is_in_set_#res|)} {2066#true} #169#return; {2069#(= |ldv_set_add_#t~ret17| 0)} is VALID [2018-11-23 12:56:15,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {2069#(= |ldv_set_add_#t~ret17| 0)} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {2069#(= |ldv_set_add_#t~ret17| 0)} is VALID [2018-11-23 12:56:15,413 INFO L273 TraceCheckUtils]: 38: Hoare triple {2069#(= |ldv_set_add_#t~ret17| 0)} assume !(0 == #t~ret17);havoc #t~ret17; {2067#false} is VALID [2018-11-23 12:56:15,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,413 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2067#false} {2066#true} #167#return; {2067#false} is VALID [2018-11-23 12:56:15,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,414 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2067#false} {2066#true} #141#return; {2067#false} is VALID [2018-11-23 12:56:15,414 INFO L256 TraceCheckUtils]: 43: Hoare triple {2067#false} call mutex_lock(~m2~0.base, ~m2~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,414 INFO L273 TraceCheckUtils]: 44: Hoare triple {2066#true} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {2066#true} is VALID [2018-11-23 12:56:15,414 INFO L256 TraceCheckUtils]: 45: Hoare triple {2066#true} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {2066#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2066#true} is VALID [2018-11-23 12:56:15,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {2066#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {2066#true} #res := 0; {2066#true} is VALID [2018-11-23 12:56:15,415 INFO L273 TraceCheckUtils]: 49: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,415 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {2066#true} {2066#true} #165#return; {2066#true} is VALID [2018-11-23 12:56:15,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {2066#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {2066#true} is VALID [2018-11-23 12:56:15,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {2066#true} assume !(0 != #t~ret27);havoc #t~ret27; {2066#true} is VALID [2018-11-23 12:56:15,416 INFO L256 TraceCheckUtils]: 53: Hoare triple {2066#true} call ldv_set_add(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,416 INFO L273 TraceCheckUtils]: 54: Hoare triple {2066#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset; {2066#true} is VALID [2018-11-23 12:56:15,416 INFO L256 TraceCheckUtils]: 55: Hoare triple {2066#true} call #t~ret17 := ldv_is_in_set(~new.base, ~new.offset, ~s.base, ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,416 INFO L273 TraceCheckUtils]: 56: Hoare triple {2066#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2066#true} is VALID [2018-11-23 12:56:15,417 INFO L273 TraceCheckUtils]: 57: Hoare triple {2066#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {2066#true} #res := 0; {2066#true} is VALID [2018-11-23 12:56:15,417 INFO L273 TraceCheckUtils]: 59: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,417 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2066#true} {2066#true} #169#return; {2066#true} is VALID [2018-11-23 12:56:15,417 INFO L273 TraceCheckUtils]: 61: Hoare triple {2066#true} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {2066#true} is VALID [2018-11-23 12:56:15,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {2066#true} assume !(0 == #t~ret17);havoc #t~ret17; {2066#true} is VALID [2018-11-23 12:56:15,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,418 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {2066#true} {2066#true} #167#return; {2066#true} is VALID [2018-11-23 12:56:15,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,418 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2066#true} {2067#false} #143#return; {2067#false} is VALID [2018-11-23 12:56:15,418 INFO L256 TraceCheckUtils]: 67: Hoare triple {2067#false} call mutex_unlock(~m1~0.base, ~m1~0.offset); {2067#false} is VALID [2018-11-23 12:56:15,419 INFO L273 TraceCheckUtils]: 68: Hoare triple {2067#false} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {2067#false} is VALID [2018-11-23 12:56:15,419 INFO L256 TraceCheckUtils]: 69: Hoare triple {2067#false} call #t~ret28 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,419 INFO L273 TraceCheckUtils]: 70: Hoare triple {2066#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2066#true} is VALID [2018-11-23 12:56:15,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {2066#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,419 INFO L273 TraceCheckUtils]: 72: Hoare triple {2066#true} #res := 0; {2066#true} is VALID [2018-11-23 12:56:15,420 INFO L273 TraceCheckUtils]: 73: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,420 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {2066#true} {2067#false} #155#return; {2067#false} is VALID [2018-11-23 12:56:15,420 INFO L273 TraceCheckUtils]: 75: Hoare triple {2067#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {2067#false} is VALID [2018-11-23 12:56:15,420 INFO L273 TraceCheckUtils]: 76: Hoare triple {2067#false} assume 0 == #t~ret28;havoc #t~ret28; {2067#false} is VALID [2018-11-23 12:56:15,421 INFO L273 TraceCheckUtils]: 77: Hoare triple {2067#false} assume !false; {2067#false} is VALID [2018-11-23 12:56:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 12:56:15,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:15,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:56:15,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:15,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:15,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {2066#true} call ULTIMATE.init(); {2066#true} is VALID [2018-11-23 12:56:15,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {2066#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); {2066#true} is VALID [2018-11-23 12:56:15,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2066#true} {2066#true} #175#return; {2066#true} is VALID [2018-11-23 12:56:15,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {2066#true} call #t~ret32 := main(); {2066#true} is VALID [2018-11-23 12:56:15,721 INFO L256 TraceCheckUtils]: 5: Hoare triple {2066#true} call foo(); {2066#true} is VALID [2018-11-23 12:56:15,721 INFO L256 TraceCheckUtils]: 6: Hoare triple {2066#true} call ldv_initialize(); {2066#true} is VALID [2018-11-23 12:56:15,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,722 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {2066#true} {2066#true} #135#return; {2066#true} is VALID [2018-11-23 12:56:15,722 INFO L256 TraceCheckUtils]: 9: Hoare triple {2066#true} call #t~ret30.base, #t~ret30.offset := ldv_successful_malloc(8); {2066#true} is VALID [2018-11-23 12:56:15,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {2066#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {2066#true} is VALID [2018-11-23 12:56:15,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,723 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2066#true} {2066#true} #137#return; {2066#true} is VALID [2018-11-23 12:56:15,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {2066#true} ~m1~0.base, ~m1~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {2066#true} is VALID [2018-11-23 12:56:15,723 INFO L256 TraceCheckUtils]: 14: Hoare triple {2066#true} call #t~ret31.base, #t~ret31.offset := ldv_successful_malloc(8); {2066#true} is VALID [2018-11-23 12:56:15,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {2066#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {2066#true} is VALID [2018-11-23 12:56:15,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,724 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2066#true} {2066#true} #139#return; {2066#true} is VALID [2018-11-23 12:56:15,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {2066#true} ~m2~0.base, ~m2~0.offset := #t~ret31.base, #t~ret31.offset;havoc #t~ret31.base, #t~ret31.offset; {2066#true} is VALID [2018-11-23 12:56:15,724 INFO L256 TraceCheckUtils]: 19: Hoare triple {2066#true} call mutex_lock(~m1~0.base, ~m1~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {2066#true} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {2066#true} is VALID [2018-11-23 12:56:15,725 INFO L256 TraceCheckUtils]: 21: Hoare triple {2066#true} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {2066#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2066#true} is VALID [2018-11-23 12:56:15,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {2066#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,725 INFO L273 TraceCheckUtils]: 24: Hoare triple {2066#true} #res := 0; {2066#true} is VALID [2018-11-23 12:56:15,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {2066#true} assume true; {2066#true} is VALID [2018-11-23 12:56:15,726 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2066#true} {2066#true} #165#return; {2066#true} is VALID [2018-11-23 12:56:15,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {2066#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {2066#true} is VALID [2018-11-23 12:56:15,726 INFO L273 TraceCheckUtils]: 28: Hoare triple {2066#true} assume !(0 != #t~ret27);havoc #t~ret27; {2066#true} is VALID [2018-11-23 12:56:15,726 INFO L256 TraceCheckUtils]: 29: Hoare triple {2066#true} call ldv_set_add(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2066#true} is VALID [2018-11-23 12:56:15,726 INFO L273 TraceCheckUtils]: 30: Hoare triple {2066#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset; {2066#true} is VALID [2018-11-23 12:56:15,727 INFO L256 TraceCheckUtils]: 31: Hoare triple {2066#true} call #t~ret17 := ldv_is_in_set(~new.base, ~new.offset, ~s.base, ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,727 INFO L273 TraceCheckUtils]: 32: Hoare triple {2066#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2066#true} is VALID [2018-11-23 12:56:15,727 INFO L273 TraceCheckUtils]: 33: Hoare triple {2066#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2066#true} is VALID [2018-11-23 12:56:15,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {2066#true} #res := 0; {2068#(= 0 |ldv_is_in_set_#res|)} is VALID [2018-11-23 12:56:15,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {2068#(= 0 |ldv_is_in_set_#res|)} assume true; {2068#(= 0 |ldv_is_in_set_#res|)} is VALID [2018-11-23 12:56:15,738 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2068#(= 0 |ldv_is_in_set_#res|)} {2066#true} #169#return; {2069#(= |ldv_set_add_#t~ret17| 0)} is VALID [2018-11-23 12:56:15,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {2069#(= |ldv_set_add_#t~ret17| 0)} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {2069#(= |ldv_set_add_#t~ret17| 0)} is VALID [2018-11-23 12:56:15,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {2069#(= |ldv_set_add_#t~ret17| 0)} assume !(0 == #t~ret17);havoc #t~ret17; {2067#false} is VALID [2018-11-23 12:56:15,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,743 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2067#false} {2066#true} #167#return; {2067#false} is VALID [2018-11-23 12:56:15,743 INFO L273 TraceCheckUtils]: 41: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,744 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2067#false} {2066#true} #141#return; {2067#false} is VALID [2018-11-23 12:56:15,744 INFO L256 TraceCheckUtils]: 43: Hoare triple {2067#false} call mutex_lock(~m2~0.base, ~m2~0.offset); {2067#false} is VALID [2018-11-23 12:56:15,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {2067#false} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {2067#false} is VALID [2018-11-23 12:56:15,744 INFO L256 TraceCheckUtils]: 45: Hoare triple {2067#false} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2067#false} is VALID [2018-11-23 12:56:15,744 INFO L273 TraceCheckUtils]: 46: Hoare triple {2067#false} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2067#false} is VALID [2018-11-23 12:56:15,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {2067#false} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2067#false} is VALID [2018-11-23 12:56:15,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {2067#false} #res := 0; {2067#false} is VALID [2018-11-23 12:56:15,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,745 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {2067#false} {2067#false} #165#return; {2067#false} is VALID [2018-11-23 12:56:15,745 INFO L273 TraceCheckUtils]: 51: Hoare triple {2067#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {2067#false} is VALID [2018-11-23 12:56:15,745 INFO L273 TraceCheckUtils]: 52: Hoare triple {2067#false} assume !(0 != #t~ret27);havoc #t~ret27; {2067#false} is VALID [2018-11-23 12:56:15,745 INFO L256 TraceCheckUtils]: 53: Hoare triple {2067#false} call ldv_set_add(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2067#false} is VALID [2018-11-23 12:56:15,746 INFO L273 TraceCheckUtils]: 54: Hoare triple {2067#false} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset; {2067#false} is VALID [2018-11-23 12:56:15,746 INFO L256 TraceCheckUtils]: 55: Hoare triple {2067#false} call #t~ret17 := ldv_is_in_set(~new.base, ~new.offset, ~s.base, ~s.offset); {2067#false} is VALID [2018-11-23 12:56:15,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {2067#false} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2067#false} is VALID [2018-11-23 12:56:15,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {2067#false} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2067#false} is VALID [2018-11-23 12:56:15,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {2067#false} #res := 0; {2067#false} is VALID [2018-11-23 12:56:15,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,747 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2067#false} {2067#false} #169#return; {2067#false} is VALID [2018-11-23 12:56:15,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {2067#false} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {2067#false} is VALID [2018-11-23 12:56:15,747 INFO L273 TraceCheckUtils]: 62: Hoare triple {2067#false} assume !(0 == #t~ret17);havoc #t~ret17; {2067#false} is VALID [2018-11-23 12:56:15,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,748 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {2067#false} {2067#false} #167#return; {2067#false} is VALID [2018-11-23 12:56:15,748 INFO L273 TraceCheckUtils]: 65: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,748 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2067#false} {2067#false} #143#return; {2067#false} is VALID [2018-11-23 12:56:15,748 INFO L256 TraceCheckUtils]: 67: Hoare triple {2067#false} call mutex_unlock(~m1~0.base, ~m1~0.offset); {2067#false} is VALID [2018-11-23 12:56:15,748 INFO L273 TraceCheckUtils]: 68: Hoare triple {2067#false} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {2067#false} is VALID [2018-11-23 12:56:15,749 INFO L256 TraceCheckUtils]: 69: Hoare triple {2067#false} call #t~ret28 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {2067#false} is VALID [2018-11-23 12:56:15,749 INFO L273 TraceCheckUtils]: 70: Hoare triple {2067#false} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {2067#false} is VALID [2018-11-23 12:56:15,749 INFO L273 TraceCheckUtils]: 71: Hoare triple {2067#false} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {2067#false} is VALID [2018-11-23 12:56:15,749 INFO L273 TraceCheckUtils]: 72: Hoare triple {2067#false} #res := 0; {2067#false} is VALID [2018-11-23 12:56:15,750 INFO L273 TraceCheckUtils]: 73: Hoare triple {2067#false} assume true; {2067#false} is VALID [2018-11-23 12:56:15,750 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {2067#false} {2067#false} #155#return; {2067#false} is VALID [2018-11-23 12:56:15,750 INFO L273 TraceCheckUtils]: 75: Hoare triple {2067#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {2067#false} is VALID [2018-11-23 12:56:15,750 INFO L273 TraceCheckUtils]: 76: Hoare triple {2067#false} assume 0 == #t~ret28;havoc #t~ret28; {2067#false} is VALID [2018-11-23 12:56:15,751 INFO L273 TraceCheckUtils]: 77: Hoare triple {2067#false} assume !false; {2067#false} is VALID [2018-11-23 12:56:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 12:56:15,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:56:15,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-23 12:56:15,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 12:56:15,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:15,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:56:16,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:16,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:56:16,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:56:16,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:56:16,155 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 4 states. [2018-11-23 12:56:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:16,727 INFO L93 Difference]: Finished difference Result 254 states and 306 transitions. [2018-11-23 12:56:16,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:56:16,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 12:56:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:56:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2018-11-23 12:56:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:56:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2018-11-23 12:56:16,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2018-11-23 12:56:16,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:17,005 INFO L225 Difference]: With dead ends: 254 [2018-11-23 12:56:17,005 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:56:17,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:56:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:56:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-23 12:56:17,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:17,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 146 states. [2018-11-23 12:56:17,184 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 146 states. [2018-11-23 12:56:17,184 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 146 states. [2018-11-23 12:56:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:17,192 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2018-11-23 12:56:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-11-23 12:56:17,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:17,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:17,193 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 146 states. [2018-11-23 12:56:17,194 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 146 states. [2018-11-23 12:56:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:17,201 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2018-11-23 12:56:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-11-23 12:56:17,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:17,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:17,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:17,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:56:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2018-11-23 12:56:17,210 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 78 [2018-11-23 12:56:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:17,210 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2018-11-23 12:56:17,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:56:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-11-23 12:56:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:56:17,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:17,212 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 12:56:17,212 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:17,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:17,213 INFO L82 PathProgramCache]: Analyzing trace with hash 885640952, now seen corresponding path program 1 times [2018-11-23 12:56:17,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:17,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:17,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:17,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {3149#true} call ULTIMATE.init(); {3149#true} is VALID [2018-11-23 12:56:17,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {3149#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} assume true; {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} {3149#true} #175#return; {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} call #t~ret32 := main(); {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,838 INFO L256 TraceCheckUtils]: 5: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} call foo(); {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,838 INFO L256 TraceCheckUtils]: 6: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} call ldv_initialize(); {3149#true} is VALID [2018-11-23 12:56:17,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {3149#true} assume true; {3149#true} is VALID [2018-11-23 12:56:17,840 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3149#true} {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} #135#return; {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,841 INFO L256 TraceCheckUtils]: 9: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} call #t~ret30.base, #t~ret30.offset := ldv_successful_malloc(8); {3149#true} is VALID [2018-11-23 12:56:17,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {3149#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {3149#true} is VALID [2018-11-23 12:56:17,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {3149#true} assume true; {3149#true} is VALID [2018-11-23 12:56:17,845 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {3149#true} {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} #137#return; {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} ~m1~0.base, ~m1~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,846 INFO L256 TraceCheckUtils]: 14: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} call #t~ret31.base, #t~ret31.offset := ldv_successful_malloc(8); {3149#true} is VALID [2018-11-23 12:56:17,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {3149#true} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {3149#true} is VALID [2018-11-23 12:56:17,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {3149#true} assume true; {3149#true} is VALID [2018-11-23 12:56:17,847 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3149#true} {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} #139#return; {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} ~m2~0.base, ~m2~0.offset := #t~ret31.base, #t~ret31.offset;havoc #t~ret31.base, #t~ret31.offset; {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} is VALID [2018-11-23 12:56:17,848 INFO L256 TraceCheckUtils]: 19: Hoare triple {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} call mutex_lock(~m1~0.base, ~m1~0.offset); {3152#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} is VALID [2018-11-23 12:56:17,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {3152#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {3152#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} is VALID [2018-11-23 12:56:17,849 INFO L256 TraceCheckUtils]: 21: Hoare triple {3152#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3149#true} is VALID [2018-11-23 12:56:17,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {3149#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3153#(and (= ldv_is_in_set_~s.offset |ldv_is_in_set_#in~s.offset|) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)))} is VALID [2018-11-23 12:56:17,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {3153#(and (= ldv_is_in_set_~s.offset |ldv_is_in_set_#in~s.offset|) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)))} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {3154#(= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))} is VALID [2018-11-23 12:56:17,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {3154#(= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))} #res := 0; {3154#(= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))} is VALID [2018-11-23 12:56:17,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {3154#(= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))} assume true; {3154#(= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))} is VALID [2018-11-23 12:56:17,854 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3154#(= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|))} {3152#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)} #165#return; {3155#(and (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,855 INFO L273 TraceCheckUtils]: 27: Hoare triple {3155#(and (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {3155#(and (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,856 INFO L273 TraceCheckUtils]: 28: Hoare triple {3155#(and (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~ret27);havoc #t~ret27; {3155#(and (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,857 INFO L256 TraceCheckUtils]: 29: Hoare triple {3155#(and (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ldv_set_add(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3156#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,858 INFO L273 TraceCheckUtils]: 30: Hoare triple {3156#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset; {3157#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= ldv_set_add_~s.offset |ldv_set_add_#in~s.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,859 INFO L256 TraceCheckUtils]: 31: Hoare triple {3157#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= ldv_set_add_~s.offset |ldv_set_add_#in~s.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret17 := ldv_is_in_set(~new.base, ~new.offset, ~s.base, ~s.offset); {3149#true} is VALID [2018-11-23 12:56:17,860 INFO L273 TraceCheckUtils]: 32: Hoare triple {3149#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3158#(and (= ldv_is_in_set_~s.base |ldv_is_in_set_#in~s.base|) (<= (+ ldv_is_in_set_~m~1.offset 4) (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (<= (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset) (+ ldv_is_in_set_~m~1.offset 4)) (= ldv_is_in_set_~s.offset |ldv_is_in_set_#in~s.offset|) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)))} is VALID [2018-11-23 12:56:17,862 INFO L273 TraceCheckUtils]: 33: Hoare triple {3158#(and (= ldv_is_in_set_~s.base |ldv_is_in_set_#in~s.base|) (<= (+ ldv_is_in_set_~m~1.offset 4) (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (<= (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset) (+ ldv_is_in_set_~m~1.offset 4)) (= ldv_is_in_set_~s.offset |ldv_is_in_set_#in~s.offset|) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)))} assume !!(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~m~1.base, ~m~1.offset, 4); {3159#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} is VALID [2018-11-23 12:56:17,862 INFO L273 TraceCheckUtils]: 34: Hoare triple {3159#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} assume #t~mem25.base == ~e.base && #t~mem25.offset == ~e.offset;havoc #t~mem25.base, #t~mem25.offset;#res := 1; {3159#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} is VALID [2018-11-23 12:56:17,863 INFO L273 TraceCheckUtils]: 35: Hoare triple {3159#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} assume true; {3159#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} is VALID [2018-11-23 12:56:17,864 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3159#(or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.base|)))} {3157#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= ldv_set_add_~s.offset |ldv_set_add_#in~s.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #169#return; {3160#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,865 INFO L273 TraceCheckUtils]: 37: Hoare triple {3160#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {3160#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {3160#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 == #t~ret17);havoc #t~ret17; {3160#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {3160#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume true; {3160#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,868 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3160#(and (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} {3155#(and (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #167#return; {3161#(and (not (= (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,869 INFO L273 TraceCheckUtils]: 41: Hoare triple {3161#(and (not (= (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume true; {3161#(and (not (= (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:17,871 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3161#(and (not (= (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} {3151#(= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))} #141#return; {3150#false} is VALID [2018-11-23 12:56:17,871 INFO L256 TraceCheckUtils]: 43: Hoare triple {3150#false} call mutex_lock(~m2~0.base, ~m2~0.offset); {3149#true} is VALID [2018-11-23 12:56:17,871 INFO L273 TraceCheckUtils]: 44: Hoare triple {3149#true} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {3149#true} is VALID [2018-11-23 12:56:17,872 INFO L256 TraceCheckUtils]: 45: Hoare triple {3149#true} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3149#true} is VALID [2018-11-23 12:56:17,872 INFO L273 TraceCheckUtils]: 46: Hoare triple {3149#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3149#true} is VALID [2018-11-23 12:56:17,873 INFO L273 TraceCheckUtils]: 47: Hoare triple {3149#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {3149#true} is VALID [2018-11-23 12:56:17,873 INFO L273 TraceCheckUtils]: 48: Hoare triple {3149#true} #res := 0; {3149#true} is VALID [2018-11-23 12:56:17,873 INFO L273 TraceCheckUtils]: 49: Hoare triple {3149#true} assume true; {3149#true} is VALID [2018-11-23 12:56:17,874 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3149#true} {3149#true} #165#return; {3149#true} is VALID [2018-11-23 12:56:17,874 INFO L273 TraceCheckUtils]: 51: Hoare triple {3149#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {3149#true} is VALID [2018-11-23 12:56:17,874 INFO L273 TraceCheckUtils]: 52: Hoare triple {3149#true} assume !(0 != #t~ret27);havoc #t~ret27; {3149#true} is VALID [2018-11-23 12:56:17,875 INFO L256 TraceCheckUtils]: 53: Hoare triple {3149#true} call ldv_set_add(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3149#true} is VALID [2018-11-23 12:56:17,875 INFO L273 TraceCheckUtils]: 54: Hoare triple {3149#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset; {3149#true} is VALID [2018-11-23 12:56:17,875 INFO L256 TraceCheckUtils]: 55: Hoare triple {3149#true} call #t~ret17 := ldv_is_in_set(~new.base, ~new.offset, ~s.base, ~s.offset); {3149#true} is VALID [2018-11-23 12:56:17,875 INFO L273 TraceCheckUtils]: 56: Hoare triple {3149#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3149#true} is VALID [2018-11-23 12:56:17,875 INFO L273 TraceCheckUtils]: 57: Hoare triple {3149#true} assume !!(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~m~1.base, ~m~1.offset, 4); {3149#true} is VALID [2018-11-23 12:56:17,876 INFO L273 TraceCheckUtils]: 58: Hoare triple {3149#true} assume #t~mem25.base == ~e.base && #t~mem25.offset == ~e.offset;havoc #t~mem25.base, #t~mem25.offset;#res := 1; {3149#true} is VALID [2018-11-23 12:56:17,876 INFO L273 TraceCheckUtils]: 59: Hoare triple {3149#true} assume true; {3149#true} is VALID [2018-11-23 12:56:17,876 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {3149#true} {3149#true} #169#return; {3149#true} is VALID [2018-11-23 12:56:17,876 INFO L273 TraceCheckUtils]: 61: Hoare triple {3149#true} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {3149#true} is VALID [2018-11-23 12:56:17,876 INFO L273 TraceCheckUtils]: 62: Hoare triple {3149#true} assume !(0 == #t~ret17);havoc #t~ret17; {3149#true} is VALID [2018-11-23 12:56:17,877 INFO L273 TraceCheckUtils]: 63: Hoare triple {3149#true} assume true; {3149#true} is VALID [2018-11-23 12:56:17,877 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3149#true} {3149#true} #167#return; {3149#true} is VALID [2018-11-23 12:56:17,877 INFO L273 TraceCheckUtils]: 65: Hoare triple {3149#true} assume true; {3149#true} is VALID [2018-11-23 12:56:17,877 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3149#true} {3150#false} #143#return; {3150#false} is VALID [2018-11-23 12:56:17,878 INFO L256 TraceCheckUtils]: 67: Hoare triple {3150#false} call mutex_unlock(~m1~0.base, ~m1~0.offset); {3150#false} is VALID [2018-11-23 12:56:17,878 INFO L273 TraceCheckUtils]: 68: Hoare triple {3150#false} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {3150#false} is VALID [2018-11-23 12:56:17,878 INFO L256 TraceCheckUtils]: 69: Hoare triple {3150#false} call #t~ret28 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3149#true} is VALID [2018-11-23 12:56:17,878 INFO L273 TraceCheckUtils]: 70: Hoare triple {3149#true} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3149#true} is VALID [2018-11-23 12:56:17,878 INFO L273 TraceCheckUtils]: 71: Hoare triple {3149#true} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {3149#true} is VALID [2018-11-23 12:56:17,879 INFO L273 TraceCheckUtils]: 72: Hoare triple {3149#true} #res := 0; {3149#true} is VALID [2018-11-23 12:56:17,879 INFO L273 TraceCheckUtils]: 73: Hoare triple {3149#true} assume true; {3149#true} is VALID [2018-11-23 12:56:17,879 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {3149#true} {3150#false} #155#return; {3150#false} is VALID [2018-11-23 12:56:17,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {3150#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {3150#false} is VALID [2018-11-23 12:56:17,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {3150#false} assume 0 == #t~ret28;havoc #t~ret28; {3150#false} is VALID [2018-11-23 12:56:17,879 INFO L273 TraceCheckUtils]: 77: Hoare triple {3150#false} assume !false; {3150#false} is VALID [2018-11-23 12:56:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:56:17,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:17,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:56:17,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:18,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:18,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-23 12:56:18,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:56:18,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-23 12:56:18,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:56:18,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 12:56:18,634 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:18,634 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_BEFORE_CALL_3|, |v_#memory_$Pointer$.base_BEFORE_CALL_3|]. (and (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_3| |~#mutexes~0.base|) |~#mutexes~0.offset|) |~#mutexes~0.offset|) (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_3| |~#mutexes~0.base|) |~#mutexes~0.offset|) |~#mutexes~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-23 12:56:18,635 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-23 12:56:18,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-23 12:56:18,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:56:18,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-23 12:56:18,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 12:56:18,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:18,899 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-23 12:56:18,902 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:18,903 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_BEFORE_CALL_7|, |v_#memory_$Pointer$.base_BEFORE_CALL_7|]. (and (= 0 |~#mutexes~0.offset|) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_7| |~#mutexes~0.base|) |~#mutexes~0.offset|) |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |~#mutexes~0.base| (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_7| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-23 12:56:18,903 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-23 12:56:19,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {3149#true} call ULTIMATE.init(); {3149#true} is VALID [2018-11-23 12:56:19,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {3149#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, ~#mutexes~0.offset, 4);call write~init~$Pointer$(~#mutexes~0.base, ~#mutexes~0.offset, ~#mutexes~0.base, 4 + ~#mutexes~0.offset, 4); {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} assume true; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} {3149#true} #175#return; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call #t~ret32 := main(); {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,403 INFO L256 TraceCheckUtils]: 5: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call foo(); {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,406 INFO L256 TraceCheckUtils]: 6: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call ldv_initialize(); {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} assume true; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,407 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #135#return; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,408 INFO L256 TraceCheckUtils]: 9: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call #t~ret30.base, #t~ret30.offset := ldv_successful_malloc(8); {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} assume true; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,410 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #137#return; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} ~m1~0.base, ~m1~0.offset := #t~ret30.base, #t~ret30.offset;havoc #t~ret30.base, #t~ret30.offset; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,412 INFO L256 TraceCheckUtils]: 14: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call #t~ret31.base, #t~ret31.offset := ldv_successful_malloc(8); {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} ~size := #in~size;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(~size);~ptr~0.base, ~ptr~0.offset := #t~malloc5.base, #t~malloc5.offset;assume 0 != (if ~ptr~0.base != 0 || ~ptr~0.offset != 0 then 1 else 0);#res.base, #res.offset := ~ptr~0.base, ~ptr~0.offset; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} assume true; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,416 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #139#return; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} ~m2~0.base, ~m2~0.offset := #t~ret31.base, #t~ret31.offset;havoc #t~ret31.base, #t~ret31.offset; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,418 INFO L256 TraceCheckUtils]: 19: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call mutex_lock(~m1~0.base, ~m1~0.offset); {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,419 INFO L273 TraceCheckUtils]: 20: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,421 INFO L256 TraceCheckUtils]: 21: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} #res := 0; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,423 INFO L273 TraceCheckUtils]: 25: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} assume true; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,428 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3230#(= 0 |~#mutexes~0.offset|)} {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #165#return; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,429 INFO L273 TraceCheckUtils]: 27: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,430 INFO L273 TraceCheckUtils]: 28: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~ret27);havoc #t~ret27; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,431 INFO L256 TraceCheckUtils]: 29: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ldv_set_add(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,432 INFO L256 TraceCheckUtils]: 31: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret17 := ldv_is_in_set(~new.base, ~new.offset, ~s.base, ~s.offset); {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} assume !!(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~m~1.base, ~m~1.offset, 4); {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,434 INFO L273 TraceCheckUtils]: 34: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} assume #t~mem25.base == ~e.base && #t~mem25.offset == ~e.offset;havoc #t~mem25.base, #t~mem25.offset;#res := 1; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,435 INFO L273 TraceCheckUtils]: 35: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} assume true; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,436 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3230#(= 0 |~#mutexes~0.offset|)} {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #169#return; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,437 INFO L273 TraceCheckUtils]: 37: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 == #t~ret17);havoc #t~ret17; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,439 INFO L273 TraceCheckUtils]: 39: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume true; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,440 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #167#return; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,441 INFO L273 TraceCheckUtils]: 41: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume true; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,443 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #141#return; {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} is VALID [2018-11-23 12:56:19,445 INFO L256 TraceCheckUtils]: 43: Hoare triple {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} call mutex_lock(~m2~0.base, ~m2~0.offset); {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,446 INFO L256 TraceCheckUtils]: 45: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret27 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,446 INFO L273 TraceCheckUtils]: 46: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,447 INFO L273 TraceCheckUtils]: 47: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,447 INFO L273 TraceCheckUtils]: 48: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} #res := 0; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,448 INFO L273 TraceCheckUtils]: 49: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} assume true; {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,450 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3230#(= 0 |~#mutexes~0.offset|)} {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #165#return; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,451 INFO L273 TraceCheckUtils]: 51: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~ret27);havoc #t~ret27; {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,453 INFO L256 TraceCheckUtils]: 53: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call ldv_set_add(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset; {3330#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= ldv_set_add_~s.offset |ldv_set_add_#in~s.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,456 INFO L256 TraceCheckUtils]: 55: Hoare triple {3330#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= ldv_set_add_~s.offset |ldv_set_add_#in~s.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} call #t~ret17 := ldv_is_in_set(~new.base, ~new.offset, ~s.base, ~s.offset); {3230#(= 0 |~#mutexes~0.offset|)} is VALID [2018-11-23 12:56:19,457 INFO L273 TraceCheckUtils]: 56: Hoare triple {3230#(= 0 |~#mutexes~0.offset|)} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3337#(and (= 0 |~#mutexes~0.offset|) (= (+ ldv_is_in_set_~m~1.offset 4) (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (= |ldv_is_in_set_#in~s.offset| ldv_is_in_set_~s.offset) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)))} is VALID [2018-11-23 12:56:19,458 INFO L273 TraceCheckUtils]: 57: Hoare triple {3337#(and (= 0 |~#mutexes~0.offset|) (= (+ ldv_is_in_set_~m~1.offset 4) (select (select |#memory_$Pointer$.offset| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)) (= |ldv_is_in_set_#in~s.offset| ldv_is_in_set_~s.offset) (= |ldv_is_in_set_#in~s.base| ldv_is_in_set_~s.base) (= ldv_is_in_set_~m~1.base (select (select |#memory_$Pointer$.base| ldv_is_in_set_~s.base) ldv_is_in_set_~s.offset)))} assume !!(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~m~1.base, ~m~1.offset, 4); {3341#(and (= 0 |~#mutexes~0.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|)))))} is VALID [2018-11-23 12:56:19,462 INFO L273 TraceCheckUtils]: 58: Hoare triple {3341#(and (= 0 |~#mutexes~0.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|)))))} assume #t~mem25.base == ~e.base && #t~mem25.offset == ~e.offset;havoc #t~mem25.base, #t~mem25.offset;#res := 1; {3341#(and (= 0 |~#mutexes~0.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|)))))} is VALID [2018-11-23 12:56:19,463 INFO L273 TraceCheckUtils]: 59: Hoare triple {3341#(and (= 0 |~#mutexes~0.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|)))))} assume true; {3341#(and (= 0 |~#mutexes~0.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|)))))} is VALID [2018-11-23 12:56:19,465 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {3341#(and (= 0 |~#mutexes~0.offset|) (or (not (= (select (select |#memory_$Pointer$.offset| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|) |ldv_is_in_set_#in~s.offset|)) (not (= |ldv_is_in_set_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_is_in_set_#in~s.base|) |ldv_is_in_set_#in~s.offset|)))))} {3330#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_set_add_~s.base |ldv_set_add_#in~s.base|) (= ldv_set_add_~s.offset |ldv_set_add_#in~s.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #169#return; {3351#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} is VALID [2018-11-23 12:56:19,466 INFO L273 TraceCheckUtils]: 61: Hoare triple {3351#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; {3351#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} is VALID [2018-11-23 12:56:19,472 INFO L273 TraceCheckUtils]: 62: Hoare triple {3351#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} assume !(0 == #t~ret17);havoc #t~ret17; {3351#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} is VALID [2018-11-23 12:56:19,473 INFO L273 TraceCheckUtils]: 63: Hoare triple {3351#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} assume true; {3351#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} is VALID [2018-11-23 12:56:19,474 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3351#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (not (= |ldv_set_add_#in~s.base| (select (select |#memory_$Pointer$.base| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ldv_set_add_#in~s.base|) |ldv_set_add_#in~s.offset|) |ldv_set_add_#in~s.offset|))))} {3223#(and (= 0 |~#mutexes~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #167#return; {3364#(and (= 0 |~#mutexes~0.offset|) (or (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,475 INFO L273 TraceCheckUtils]: 65: Hoare triple {3364#(and (= 0 |~#mutexes~0.offset|) (or (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume true; {3364#(and (= 0 |~#mutexes~0.offset|) (or (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2018-11-23 12:56:19,476 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3364#(and (= 0 |~#mutexes~0.offset|) (or (not (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|))) (not (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} {3168#(and (= |~#mutexes~0.offset| (select (select |#memory_$Pointer$.offset| |~#mutexes~0.base|) |~#mutexes~0.offset|)) (= 0 |~#mutexes~0.offset|) (= |~#mutexes~0.base| (select (select |#memory_$Pointer$.base| |~#mutexes~0.base|) |~#mutexes~0.offset|)))} #143#return; {3150#false} is VALID [2018-11-23 12:56:19,476 INFO L256 TraceCheckUtils]: 67: Hoare triple {3150#false} call mutex_unlock(~m1~0.base, ~m1~0.offset); {3150#false} is VALID [2018-11-23 12:56:19,477 INFO L273 TraceCheckUtils]: 68: Hoare triple {3150#false} ~m.base, ~m.offset := #in~m.base, #in~m.offset; {3150#false} is VALID [2018-11-23 12:56:19,477 INFO L256 TraceCheckUtils]: 69: Hoare triple {3150#false} call #t~ret28 := ldv_is_in_set(~m.base, ~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset); {3150#false} is VALID [2018-11-23 12:56:19,477 INFO L273 TraceCheckUtils]: 70: Hoare triple {3150#false} ~e.base, ~e.offset := #in~e.base, #in~e.offset;~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~m~1.base, ~m~1.offset;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s.base, ~s.offset, 4);~__mptr~3.base, ~__mptr~3.offset := #t~mem23.base, #t~mem23.offset;havoc #t~mem23.base, #t~mem23.offset;~m~1.base, ~m~1.offset := ~__mptr~3.base, ~__mptr~3.offset - 4; {3150#false} is VALID [2018-11-23 12:56:19,477 INFO L273 TraceCheckUtils]: 71: Hoare triple {3150#false} assume !(~m~1.base != ~s.base || 4 + ~m~1.offset != ~s.offset); {3150#false} is VALID [2018-11-23 12:56:19,478 INFO L273 TraceCheckUtils]: 72: Hoare triple {3150#false} #res := 0; {3150#false} is VALID [2018-11-23 12:56:19,478 INFO L273 TraceCheckUtils]: 73: Hoare triple {3150#false} assume true; {3150#false} is VALID [2018-11-23 12:56:19,478 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {3150#false} {3150#false} #155#return; {3150#false} is VALID [2018-11-23 12:56:19,478 INFO L273 TraceCheckUtils]: 75: Hoare triple {3150#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {3150#false} is VALID [2018-11-23 12:56:19,479 INFO L273 TraceCheckUtils]: 76: Hoare triple {3150#false} assume 0 == #t~ret28;havoc #t~ret28; {3150#false} is VALID [2018-11-23 12:56:19,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {3150#false} assume !false; {3150#false} is VALID [2018-11-23 12:56:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 12:56:19,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:56:19,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2018-11-23 12:56:19,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-11-23 12:56:19,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:19,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:56:19,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:19,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:56:19,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:56:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:56:19,701 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 21 states. [2018-11-23 12:56:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:30,506 INFO L93 Difference]: Finished difference Result 362 states and 428 transitions. [2018-11-23 12:56:30,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:56:30,506 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-11-23 12:56:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:56:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 358 transitions. [2018-11-23 12:56:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:56:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 358 transitions. [2018-11-23 12:56:30,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 358 transitions. [2018-11-23 12:56:31,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:31,212 INFO L225 Difference]: With dead ends: 362 [2018-11-23 12:56:31,213 INFO L226 Difference]: Without dead ends: 230 [2018-11-23 12:56:31,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=433, Invalid=1729, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:56:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-23 12:56:32,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 160. [2018-11-23 12:56:32,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:32,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand 160 states. [2018-11-23 12:56:32,075 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 160 states. [2018-11-23 12:56:32,075 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 160 states. [2018-11-23 12:56:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:32,087 INFO L93 Difference]: Finished difference Result 230 states and 272 transitions. [2018-11-23 12:56:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 272 transitions. [2018-11-23 12:56:32,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:32,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:32,089 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 230 states. [2018-11-23 12:56:32,089 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 230 states. [2018-11-23 12:56:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:32,099 INFO L93 Difference]: Finished difference Result 230 states and 272 transitions. [2018-11-23 12:56:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 272 transitions. [2018-11-23 12:56:32,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:32,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:32,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:32,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 12:56:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-11-23 12:56:32,107 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 78 [2018-11-23 12:56:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:32,108 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-11-23 12:56:32,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:56:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-11-23 12:56:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:56:32,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:32,109 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:32,110 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:32,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:32,110 INFO L82 PathProgramCache]: Analyzing trace with hash 559822637, now seen corresponding path program 1 times [2018-11-23 12:56:32,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:32,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:32,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:32,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:32,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:33,554 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-11-23 12:56:33,891 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-11-23 12:56:34,765 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:56:34,770 INFO L168 Benchmark]: Toolchain (without parser) took 29185.55 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -435.5 MB). Peak memory consumption was 660.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:34,771 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:34,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 900.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:34,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:34,773 INFO L168 Benchmark]: Boogie Preprocessor took 71.75 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:34,773 INFO L168 Benchmark]: RCFGBuilder took 1327.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 65.6 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:34,774 INFO L168 Benchmark]: TraceAbstraction took 26823.59 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 332.9 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 296.1 MB). Peak memory consumption was 629.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:34,777 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 900.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.2 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.75 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1327.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 65.6 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26823.59 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 332.9 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 296.1 MB). Peak memory consumption was 629.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...