./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad29ac750d7eee43ee0f4c2b7f90b5e7c26b142d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:11:16,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:11:16,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:11:16,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:11:16,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:11:16,498 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:11:16,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:11:16,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:11:16,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:11:16,504 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:11:16,505 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:11:16,505 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:11:16,506 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:11:16,507 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:11:16,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:11:16,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:11:16,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:11:16,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:11:16,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:11:16,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:11:16,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:11:16,520 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:11:16,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:11:16,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:11:16,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:11:16,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:11:16,526 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:11:16,527 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:11:16,528 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:11:16,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:11:16,529 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:11:16,530 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:11:16,530 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:11:16,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:11:16,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:11:16,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:11:16,533 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:11:16,553 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:11:16,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:11:16,554 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:11:16,554 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:11:16,556 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:11:16,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:11:16,558 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:11:16,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:11:16,558 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:11:16,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:11:16,558 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:11:16,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:11:16,559 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:11:16,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:11:16,559 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:11:16,559 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:11:16,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:11:16,560 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:11:16,560 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:11:16,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:11:16,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:11:16,560 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:11:16,561 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:11:16,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:11:16,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:11:16,562 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:11:16,562 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:11:16,562 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:11:16,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:11:16,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:11:16,563 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad29ac750d7eee43ee0f4c2b7f90b5e7c26b142d [2018-11-28 18:11:16,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:11:16,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:11:16,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:11:16,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:11:16,627 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:11:16,628 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i [2018-11-28 18:11:16,689 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddfd86b54/d00d4059105e44cda9b730eef2f38994/FLAG0be10617a [2018-11-28 18:11:17,168 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:11:17,168 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-sets/test_mutex_double_lock_false-unreach-call_true-termination.i [2018-11-28 18:11:17,204 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddfd86b54/d00d4059105e44cda9b730eef2f38994/FLAG0be10617a [2018-11-28 18:11:17,464 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddfd86b54/d00d4059105e44cda9b730eef2f38994 [2018-11-28 18:11:17,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:11:17,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:11:17,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:11:17,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:11:17,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:11:17,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:17" (1/1) ... [2018-11-28 18:11:17,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@144a5e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:17, skipping insertion in model container [2018-11-28 18:11:17,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:17" (1/1) ... [2018-11-28 18:11:17,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:11:17,566 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:11:18,014 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:11:18,035 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:11:18,217 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:11:18,301 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:11:18,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18 WrapperNode [2018-11-28 18:11:18,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:11:18,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:11:18,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:11:18,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:11:18,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:11:18,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:11:18,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:11:18,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:11:18,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (1/1) ... [2018-11-28 18:11:18,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:11:18,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:11:18,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:11:18,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:11:18,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (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-28 18:11:18,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:11:18,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-28 18:11:18,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-28 18:11:18,477 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-11-28 18:11:18,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-11-28 18:11:18,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_empty [2018-11-28 18:11:18,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_empty [2018-11-28 18:11:18,477 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-11-28 18:11:18,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-11-28 18:11:18,478 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2018-11-28 18:11:18,478 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2018-11-28 18:11:18,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-11-28 18:11:18,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-11-28 18:11:18,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:11:18,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:11:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-28 18:11:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-11-28 18:11:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:11:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:11:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:11:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2018-11-28 18:11:18,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2018-11-28 18:11:18,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2018-11-28 18:11:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2018-11-28 18:11:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:11:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_empty [2018-11-28 18:11:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_empty [2018-11-28 18:11:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:11:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 18:11:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-28 18:11:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-28 18:11:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-11-28 18:11:18,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-11-28 18:11:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2018-11-28 18:11:18,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2018-11-28 18:11:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-28 18:11:18,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-28 18:11:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_del [2018-11-28 18:11:18,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_del [2018-11-28 18:11:18,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:11:18,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:11:19,256 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:11:19,256 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 18:11:19,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:19 BoogieIcfgContainer [2018-11-28 18:11:19,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:11:19,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:11:19,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:11:19,261 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:11:19,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:17" (1/3) ... [2018-11-28 18:11:19,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae502c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:19, skipping insertion in model container [2018-11-28 18:11:19,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:18" (2/3) ... [2018-11-28 18:11:19,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae502c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:19, skipping insertion in model container [2018-11-28 18:11:19,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:19" (3/3) ... [2018-11-28 18:11:19,265 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock_false-unreach-call_true-termination.i [2018-11-28 18:11:19,275 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:11:19,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 18:11:19,302 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 18:11:19,335 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:11:19,336 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:11:19,337 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:11:19,337 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:11:19,337 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:11:19,337 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:11:19,337 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:11:19,338 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:11:19,338 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:11:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-11-28 18:11:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:11:19,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:19,369 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-28 18:11:19,372 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:19,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:19,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1594759354, now seen corresponding path program 1 times [2018-11-28 18:11:19,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:19,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:19,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:19,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:19,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:19,576 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-28 18:11:19,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:11:19,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:11:19,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:11:19,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:11:19,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:11:19,608 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-11-28 18:11:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:19,645 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2018-11-28 18:11:19,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:11:19,647 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-28 18:11:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:19,661 INFO L225 Difference]: With dead ends: 188 [2018-11-28 18:11:19,661 INFO L226 Difference]: Without dead ends: 92 [2018-11-28 18:11:19,668 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-28 18:11:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-28 18:11:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-28 18:11:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 18:11:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-28 18:11:19,728 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 30 [2018-11-28 18:11:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:19,730 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-28 18:11:19,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:11:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-28 18:11:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:11:19,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:19,732 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-28 18:11:19,733 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:19,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:19,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1879861572, now seen corresponding path program 1 times [2018-11-28 18:11:19,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:19,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:19,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:19,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:19,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:19,886 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-28 18:11:19,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:11:19,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:11:19,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:11:19,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:11:19,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:11:19,889 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2018-11-28 18:11:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:19,960 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-11-28 18:11:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:11:19,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-28 18:11:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:19,966 INFO L225 Difference]: With dead ends: 98 [2018-11-28 18:11:19,967 INFO L226 Difference]: Without dead ends: 96 [2018-11-28 18:11:19,968 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-28 18:11:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-28 18:11:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-11-28 18:11:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 18:11:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-11-28 18:11:19,993 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-11-28 18:11:19,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:19,994 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-11-28 18:11:19,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:11:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-11-28 18:11:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:11:19,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:19,996 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-28 18:11:19,997 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:19,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash -305258267, now seen corresponding path program 1 times [2018-11-28 18:11:19,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:20,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:20,243 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-28 18:11:20,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:11:20,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:11:20,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:11:20,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:11:20,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:11:20,245 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 5 states. [2018-11-28 18:11:20,736 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-28 18:11:21,190 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 18:11:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:21,799 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2018-11-28 18:11:21,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:11:21,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-28 18:11:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:21,805 INFO L225 Difference]: With dead ends: 257 [2018-11-28 18:11:21,806 INFO L226 Difference]: Without dead ends: 175 [2018-11-28 18:11:21,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:11:21,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-28 18:11:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 140. [2018-11-28 18:11:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-28 18:11:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2018-11-28 18:11:21,839 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 30 [2018-11-28 18:11:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:21,839 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2018-11-28 18:11:21,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:11:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2018-11-28 18:11:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 18:11:21,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:21,844 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-28 18:11:21,845 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:21,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:21,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1875239642, now seen corresponding path program 1 times [2018-11-28 18:11:21,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:21,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:21,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:21,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:21,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:22,011 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-28 18:11:22,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:11:22,012 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-28 18:11:22,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:22,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:11:22,188 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-28 18:11:22,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:11:22,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-28 18:11:22,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:11:22,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:11:22,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:11:22,222 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand 4 states. [2018-11-28 18:11:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:22,273 INFO L93 Difference]: Finished difference Result 254 states and 306 transitions. [2018-11-28 18:11:22,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:11:22,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 18:11:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:22,278 INFO L225 Difference]: With dead ends: 254 [2018-11-28 18:11:22,279 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 18:11:22,280 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-28 18:11:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 18:11:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-28 18:11:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-28 18:11:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2018-11-28 18:11:22,305 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 78 [2018-11-28 18:11:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:22,306 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2018-11-28 18:11:22,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:11:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-11-28 18:11:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 18:11:22,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:22,312 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-28 18:11:22,312 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:22,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash 885640952, now seen corresponding path program 1 times [2018-11-28 18:11:22,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:22,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:22,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:22,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:22,822 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-28 18:11:23,120 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-28 18:11:23,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:11:23,121 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-28 18:11:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:11:23,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:11:23,482 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-28 18:11:23,485 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-28 18:11:23,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,554 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-28 18:11:23,564 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-28 18:11:23,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-28 18:11:23,649 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-28 18:11:23,660 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-28 18:11:23,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,699 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-28 18:11:23,702 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-28 18:11:23,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:11:23,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-28 18:11:24,122 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-28 18:11:24,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:11:24,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2018-11-28 18:11:24,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 18:11:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 18:11:24,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-11-28 18:11:24,143 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 21 states. [2018-11-28 18:11:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:11:27,712 INFO L93 Difference]: Finished difference Result 362 states and 428 transitions. [2018-11-28 18:11:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 18:11:27,713 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-11-28 18:11:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:11:27,718 INFO L225 Difference]: With dead ends: 362 [2018-11-28 18:11:27,718 INFO L226 Difference]: Without dead ends: 230 [2018-11-28 18:11:27,725 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-28 18:11:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-28 18:11:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 160. [2018-11-28 18:11:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-28 18:11:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-11-28 18:11:27,768 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 78 [2018-11-28 18:11:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:11:27,768 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-11-28 18:11:27,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 18:11:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-11-28 18:11:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 18:11:27,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:11:27,771 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-28 18:11:27,772 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mutex_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:11:27,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:11:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash 559822637, now seen corresponding path program 1 times [2018-11-28 18:11:27,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:11:27,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:11:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:11:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:11:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:11:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:11:27,933 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:11:28,006 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-11-28 18:11:28,007 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-11-28 18:11:28,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:11:28 BoogieIcfgContainer [2018-11-28 18:11:28,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:11:28,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:11:28,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:11:28,032 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:11:28,034 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:19" (3/4) ... [2018-11-28 18:11:28,037 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:11:28,048 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-11-28 18:11:28,048 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-11-28 18:11:28,130 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:11:28,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:11:28,135 INFO L168 Benchmark]: Toolchain (without parser) took 10665.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 946.0 MB in the beginning and 822.8 MB in the end (delta: 123.2 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:28,136 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:11:28,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:28,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:11:28,138 INFO L168 Benchmark]: Boogie Preprocessor took 44.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:11:28,139 INFO L168 Benchmark]: RCFGBuilder took 851.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:28,139 INFO L168 Benchmark]: TraceAbstraction took 8774.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 831.0 MB in the end (delta: 221.8 MB). Peak memory consumption was 309.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:28,140 INFO L168 Benchmark]: Witness Printer took 98.42 ms. Allocated memory is still 1.2 GB. Free memory was 831.0 MB in the beginning and 822.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:11:28,144 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 829.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 851.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8774.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 831.0 MB in the end (delta: 221.8 MB). Peak memory consumption was 309.3 MB. Max. memory is 11.5 GB. * Witness Printer took 98.42 ms. Allocated memory is still 1.2 GB. Free memory was 831.0 MB in the beginning and 822.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 15 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 656]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L652] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; VAL [\old(mutexes)=null, \old(mutexes)=null, mutexes={19:0}] [L679] CALL foo() VAL [mutexes={19:0}] [L668] FCALL ldv_initialize() VAL [mutexes={19:0}] [L669] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [\old(size)=8, mutexes={19:0}] [L563] void *ptr = malloc(size); [L565] return ptr; VAL [\old(size)=8, \result={14:0}, malloc(size)={14:0}, mutexes={19:0}, ptr={14:0}, size=8] [L669] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={14:0}, mutexes={19:0}] [L669] struct mutex *m1 = ldv_successful_malloc(sizeof(struct mutex)); [L670] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [\old(size)=8, mutexes={19:0}] [L563] void *ptr = malloc(size); [L565] return ptr; VAL [\old(size)=8, \result={20:0}, malloc(size)={20:0}, mutexes={19:0}, ptr={20:0}, size=8] [L670] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) VAL [ldv_successful_malloc(sizeof(struct mutex))={20:0}, m1={14:0}, mutexes={19:0}] [L670] struct mutex *m2 = ldv_successful_malloc(sizeof(struct mutex)); [L671] CALL mutex_lock(m1) VAL [m={14:0}, mutexes={19:0}] [L656] CALL ldv_is_in_set(m, &mutexes) VAL [e={14:0}, mutexes={19:0}, s={19:0}] [L641] struct ldv_list_element *m; [L642] EXPR (s)->next [L642] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L642] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L642] COND FALSE !(&m->list != (s)) VAL [__mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L647] return 0; VAL [\result=0, __mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L656] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=0, m={14:0}, m={14:0}, mutexes={19:0}] [L656] COND FALSE !(ldv_is_in_set(m, &mutexes)) [L657] CALL ldv_set_add(m, &mutexes) VAL [mutexes={19:0}, new={14:0}, s={19:0}] [L623] CALL, EXPR ldv_is_in_set(new, s) VAL [e={14:0}, mutexes={19:0}, s={19:0}] [L641] struct ldv_list_element *m; [L642] EXPR (s)->next [L642] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L642] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L642] COND FALSE !(&m->list != (s)) VAL [__mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L647] return 0; VAL [\result=0, __mptr={19:0}, e={14:0}, e={14:0}, m={19:-4}, mutexes={19:0}, s={19:0}, s={19:0}] [L623] RET, EXPR ldv_is_in_set(new, s) VAL [ldv_is_in_set(new, s)=0, mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L623] COND TRUE !ldv_is_in_set(new, s) [L624] struct ldv_list_element *le; VAL [mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L625] CALL, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [\old(size)=12, mutexes={19:0}] [L563] void *ptr = malloc(size); [L565] return ptr; VAL [\old(size)=12, \result={16:0}, malloc(size)={16:0}, mutexes={19:0}, ptr={16:0}, size=12] [L625] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) VAL [ldv_successful_malloc(sizeof(struct ldv_list_element))={16:0}, mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L625] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L626] le->e = new VAL [le={16:0}, mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L627] CALL ldv_list_add(&le->list, s) VAL [head={19:0}, mutexes={19:0}, new={16:4}] [L595] EXPR head->next VAL [head={19:0}, head={19:0}, head->next={19:0}, mutexes={19:0}, new={16:4}, new={16:4}] [L595] CALL __ldv_list_add(new, head, head->next) VAL [mutexes={19:0}, new={16:4}, next={19:0}, prev={19:0}] [L583] next->prev = new [L584] new->next = next [L585] new->prev = prev [L586] prev->next = new VAL [mutexes={19:0}, new={16:4}, new={16:4}, next={19:0}, next={19:0}, prev={19:0}, prev={19:0}] [L595] RET __ldv_list_add(new, head, head->next) VAL [head={19:0}, head={19:0}, head->next={19:0}, mutexes={19:0}, new={16:4}, new={16:4}] [L627] RET ldv_list_add(&le->list, s) VAL [le={16:0}, mutexes={19:0}, new={14:0}, new={14:0}, s={19:0}, s={19:0}] [L657] RET ldv_set_add(m, &mutexes) VAL [m={14:0}, m={14:0}, mutexes={19:0}] [L671] RET mutex_lock(m1) VAL [m1={14:0}, m2={20:0}, mutexes={19:0}] [L672] CALL mutex_lock(m1) VAL [m={14:0}, mutexes={19:0}] [L656] CALL ldv_is_in_set(m, &mutexes) VAL [e={14:0}, mutexes={19:0}, s={19:0}] [L641] struct ldv_list_element *m; [L642] EXPR (s)->next [L642] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L642] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={16:4}, e={14:0}, e={14:0}, m={16:0}, mutexes={19:0}, s={19:0}, s={19:0}] [L642] COND TRUE &m->list != (s) [L643] EXPR m->e VAL [__mptr={16:4}, e={14:0}, e={14:0}, m={16:0}, m->e={14:0}, mutexes={19:0}, s={19:0}, s={19:0}] [L643] COND TRUE m->e == e [L644] return 1; VAL [\result=1, __mptr={16:4}, e={14:0}, e={14:0}, m={16:0}, mutexes={19:0}, s={19:0}, s={19:0}] [L656] RET ldv_is_in_set(m, &mutexes) VAL [ldv_is_in_set(m, &mutexes)=1, m={14:0}, m={14:0}, mutexes={19:0}] [L656] COND TRUE ldv_is_in_set(m, &mutexes) [L656] __VERIFIER_error() VAL [m={14:0}, m={14:0}, mutexes={19:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 101 locations, 3 error locations. UNSAFE Result, 8.7s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 554 SDtfs, 634 SDslu, 1181 SDs, 0 SdLazy, 1544 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 105 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 470 NumberOfCodeBlocks, 470 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 121260 SizeOfPredicates, 16 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 213/261 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...