./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.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 e05a36db10b472207b2b78b987f386d5acacc68d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-8bd4bc6 [2020-07-28 18:03:33,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:03:33,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:03:33,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:03:33,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:03:33,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:03:33,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:03:34,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:03:34,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:03:34,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:03:34,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:03:34,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:03:34,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:03:34,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:03:34,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:03:34,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:03:34,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:03:34,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:03:34,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:03:34,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:03:34,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:03:34,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:03:34,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:03:34,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:03:34,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:03:34,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:03:34,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:03:34,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:03:34,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:03:34,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:03:34,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:03:34,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:03:34,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:03:34,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:03:34,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:03:34,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:03:34,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:03:34,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:03:34,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:03:34,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:03:34,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:03:34,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:03:34,053 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:03:34,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:03:34,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:03:34,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:03:34,055 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:03:34,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:03:34,056 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:03:34,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:03:34,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:03:34,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:03:34,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:03:34,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:03:34,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:03:34,057 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:03:34,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:03:34,058 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:03:34,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:03:34,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:03:34,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:03:34,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:03:34,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:03:34,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:03:34,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:03:34,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:03:34,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:03:34,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:03:34,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:03:34,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:03:34,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:03:34,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> e05a36db10b472207b2b78b987f386d5acacc68d [2020-07-28 18:03:34,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:03:34,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:03:34,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:03:34,392 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:03:34,393 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:03:34,394 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2020-07-28 18:03:34,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f743d19db/6a15f00c538346988cf13b73ee2af740/FLAG6d5cbf5cf [2020-07-28 18:03:34,947 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:03:34,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_double_lock.i [2020-07-28 18:03:34,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f743d19db/6a15f00c538346988cf13b73ee2af740/FLAG6d5cbf5cf [2020-07-28 18:03:35,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f743d19db/6a15f00c538346988cf13b73ee2af740 [2020-07-28 18:03:35,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:03:35,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:03:35,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:03:35,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:03:35,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:03:35,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:35,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32274351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35, skipping insertion in model container [2020-07-28 18:03:35,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:35,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:03:35,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:03:35,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:03:35,812 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:03:35,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:03:35,936 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:03:35,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35 WrapperNode [2020-07-28 18:03:35,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:03:35,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:03:35,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:03:35,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:03:35,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:35,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:36,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:03:36,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:03:36,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:03:36,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:03:36,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:36,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:36,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:36,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:36,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:36,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:36,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... [2020-07-28 18:03:36,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:03:36,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:03:36,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:03:36,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:03:36,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:03:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 18:03:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 18:03:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 18:03:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 18:03:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:03:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-28 18:03:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:03:36,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:03:37,127 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:03:37,128 INFO L295 CfgBuilder]: Removed 82 assume(true) statements. [2020-07-28 18:03:37,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:03:37 BoogieIcfgContainer [2020-07-28 18:03:37,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:03:37,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:03:37,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:03:37,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:03:37,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:03:35" (1/3) ... [2020-07-28 18:03:37,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7056bd7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:03:37, skipping insertion in model container [2020-07-28 18:03:37,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:03:35" (2/3) ... [2020-07-28 18:03:37,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7056bd7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:03:37, skipping insertion in model container [2020-07-28 18:03:37,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:03:37" (3/3) ... [2020-07-28 18:03:37,144 INFO L109 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.i [2020-07-28 18:03:37,156 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:03:37,164 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-07-28 18:03:37,181 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-07-28 18:03:37,209 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:03:37,209 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:03:37,209 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:03:37,209 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:03:37,210 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:03:37,210 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:03:37,210 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:03:37,211 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:03:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-28 18:03:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:03:37,239 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:03:37,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:03:37,240 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:03:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:03:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash 912087840, now seen corresponding path program 1 times [2020-07-28 18:03:37,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:03:37,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456648171] [2020-07-28 18:03:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:03:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:03:37,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(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); {91#true} is VALID [2020-07-28 18:03:37,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} havoc main_#res;havoc foo_#t~ret29.base, foo_#t~ret29.offset, foo_#t~ret30.base, foo_#t~ret30.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; {91#true} is VALID [2020-07-28 18:03:37,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#true} ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {91#true} is VALID [2020-07-28 18:03:37,454 INFO L280 TraceCheckUtils]: 3: Hoare triple {91#true} assume 0 == assume_abort_if_not_~cond;assume false; {92#false} is VALID [2020-07-28 18:03:37,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#false} ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; {92#false} is VALID [2020-07-28 18:03:37,455 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#false} foo_#t~ret29.base, foo_#t~ret29.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret29.base, foo_#t~ret29.offset;havoc foo_#t~ret29.base, foo_#t~ret29.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {92#false} is VALID [2020-07-28 18:03:37,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {92#false} assume 0 == assume_abort_if_not_~cond;assume false; {92#false} is VALID [2020-07-28 18:03:37,456 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#false} ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; {92#false} is VALID [2020-07-28 18:03:37,457 INFO L280 TraceCheckUtils]: 8: Hoare triple {92#false} foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret26, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset;havoc ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; {92#false} is VALID [2020-07-28 18:03:37,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {92#false} assume !true; {92#false} is VALID [2020-07-28 18:03:37,457 INFO L280 TraceCheckUtils]: 10: Hoare triple {92#false} ldv_is_in_set_#res := 0; {92#false} is VALID [2020-07-28 18:03:37,458 INFO L280 TraceCheckUtils]: 11: Hoare triple {92#false} mutex_lock_#t~ret26 := ldv_is_in_set_#res;assume -2147483648 <= mutex_lock_#t~ret26 && mutex_lock_#t~ret26 <= 2147483647; {92#false} is VALID [2020-07-28 18:03:37,458 INFO L280 TraceCheckUtils]: 12: Hoare triple {92#false} assume 0 != mutex_lock_#t~ret26;havoc mutex_lock_#t~ret26; {92#false} is VALID [2020-07-28 18:03:37,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-28 18:03:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:03:37,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456648171] [2020-07-28 18:03:37,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:03:37,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:03:37,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298784386] [2020-07-28 18:03:37,472 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-28 18:03:37,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:03:37,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:03:37,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:37,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:03:37,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:03:37,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:03:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:03:37,519 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 2 states. [2020-07-28 18:03:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:37,710 INFO L93 Difference]: Finished difference Result 172 states and 239 transitions. [2020-07-28 18:03:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:03:37,710 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-28 18:03:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:03:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:03:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2020-07-28 18:03:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:03:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2020-07-28 18:03:37,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 239 transitions. [2020-07-28 18:03:38,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:38,137 INFO L225 Difference]: With dead ends: 172 [2020-07-28 18:03:38,137 INFO L226 Difference]: Without dead ends: 84 [2020-07-28 18:03:38,147 INFO L675 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 [2020-07-28 18:03:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-28 18:03:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-07-28 18:03:38,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:03:38,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2020-07-28 18:03:38,208 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2020-07-28 18:03:38,209 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2020-07-28 18:03:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:38,225 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2020-07-28 18:03:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2020-07-28 18:03:38,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:38,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:38,228 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2020-07-28 18:03:38,228 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2020-07-28 18:03:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:38,241 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2020-07-28 18:03:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2020-07-28 18:03:38,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:38,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:38,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:03:38,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:03:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-28 18:03:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2020-07-28 18:03:38,254 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 14 [2020-07-28 18:03:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:03:38,255 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2020-07-28 18:03:38,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:03:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2020-07-28 18:03:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:03:38,257 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:03:38,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:03:38,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:03:38,259 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:03:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:03:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash 793647061, now seen corresponding path program 1 times [2020-07-28 18:03:38,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:03:38,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306387373] [2020-07-28 18:03:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:03:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:03:38,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {581#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(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); {581#true} is VALID [2020-07-28 18:03:38,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} havoc main_#res;havoc foo_#t~ret29.base, foo_#t~ret29.offset, foo_#t~ret30.base, foo_#t~ret30.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; {581#true} is VALID [2020-07-28 18:03:38,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {581#true} ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {581#true} is VALID [2020-07-28 18:03:38,454 INFO L280 TraceCheckUtils]: 3: Hoare triple {581#true} assume !(0 == assume_abort_if_not_~cond); {581#true} is VALID [2020-07-28 18:03:38,455 INFO L280 TraceCheckUtils]: 4: Hoare triple {581#true} ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; {581#true} is VALID [2020-07-28 18:03:38,455 INFO L280 TraceCheckUtils]: 5: Hoare triple {581#true} foo_#t~ret29.base, foo_#t~ret29.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret29.base, foo_#t~ret29.offset;havoc foo_#t~ret29.base, foo_#t~ret29.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {581#true} is VALID [2020-07-28 18:03:38,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {581#true} assume !(0 == assume_abort_if_not_~cond); {581#true} is VALID [2020-07-28 18:03:38,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {581#true} ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; {581#true} is VALID [2020-07-28 18:03:38,458 INFO L280 TraceCheckUtils]: 8: Hoare triple {581#true} foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret26, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset;havoc ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; {581#true} is VALID [2020-07-28 18:03:38,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {581#true} assume !(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset); {581#true} is VALID [2020-07-28 18:03:38,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {581#true} ldv_is_in_set_#res := 0; {583#(= 0 |ULTIMATE.start_ldv_is_in_set_#res|)} is VALID [2020-07-28 18:03:38,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {583#(= 0 |ULTIMATE.start_ldv_is_in_set_#res|)} mutex_lock_#t~ret26 := ldv_is_in_set_#res;assume -2147483648 <= mutex_lock_#t~ret26 && mutex_lock_#t~ret26 <= 2147483647; {584#(= 0 |ULTIMATE.start_mutex_lock_#t~ret26|)} is VALID [2020-07-28 18:03:38,464 INFO L280 TraceCheckUtils]: 12: Hoare triple {584#(= 0 |ULTIMATE.start_mutex_lock_#t~ret26|)} assume 0 != mutex_lock_#t~ret26;havoc mutex_lock_#t~ret26; {582#false} is VALID [2020-07-28 18:03:38,464 INFO L280 TraceCheckUtils]: 13: Hoare triple {582#false} assume !false; {582#false} is VALID [2020-07-28 18:03:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:03:38,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306387373] [2020-07-28 18:03:38,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:03:38,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:03:38,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379416246] [2020-07-28 18:03:38,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 18:03:38,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:03:38,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:03:38,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:38,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:03:38,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:03:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:03:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:03:38,506 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 4 states. [2020-07-28 18:03:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:39,012 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2020-07-28 18:03:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:03:39,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 18:03:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:03:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:03:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2020-07-28 18:03:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:03:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2020-07-28 18:03:39,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2020-07-28 18:03:39,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:39,305 INFO L225 Difference]: With dead ends: 135 [2020-07-28 18:03:39,306 INFO L226 Difference]: Without dead ends: 131 [2020-07-28 18:03:39,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:03:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-07-28 18:03:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-07-28 18:03:39,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:03:39,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 88 states. [2020-07-28 18:03:39,335 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 88 states. [2020-07-28 18:03:39,335 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 88 states. [2020-07-28 18:03:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:39,343 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2020-07-28 18:03:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2020-07-28 18:03:39,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:39,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:39,345 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 131 states. [2020-07-28 18:03:39,345 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 131 states. [2020-07-28 18:03:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:39,384 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2020-07-28 18:03:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2020-07-28 18:03:39,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:39,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:39,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:03:39,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:03:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-28 18:03:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2020-07-28 18:03:39,396 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 14 [2020-07-28 18:03:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:03:39,396 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2020-07-28 18:03:39,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:03:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2020-07-28 18:03:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:03:39,398 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:03:39,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:03:39,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:03:39,398 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:03:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:03:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash 795255775, now seen corresponding path program 1 times [2020-07-28 18:03:39,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:03:39,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671835216] [2020-07-28 18:03:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:03:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:03:39,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#mutexes~0.base, ~#mutexes~0.offset := #Ultimate.allocOnStack(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); {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} is VALID [2020-07-28 18:03:39,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} havoc main_#res;havoc foo_#t~ret29.base, foo_#t~ret29.offset, foo_#t~ret30.base, foo_#t~ret30.offset, foo_~m1~0.base, foo_~m1~0.offset, foo_~m2~0.base, foo_~m2~0.offset; {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} is VALID [2020-07-28 18:03:39,610 INFO L280 TraceCheckUtils]: 2: Hoare triple {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} is VALID [2020-07-28 18:03:39,611 INFO L280 TraceCheckUtils]: 3: Hoare triple {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} assume !(0 == assume_abort_if_not_~cond); {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} is VALID [2020-07-28 18:03:39,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} is VALID [2020-07-28 18:03:39,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} foo_#t~ret29.base, foo_#t~ret29.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m1~0.base, foo_~m1~0.offset := foo_#t~ret29.base, foo_#t~ret29.offset;havoc foo_#t~ret29.base, foo_#t~ret29.offset;ldv_successful_malloc_#in~size := 8;havoc ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;havoc ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset, ldv_successful_malloc_~size, ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset;ldv_successful_malloc_~size := ldv_successful_malloc_#in~size;call ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size);ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset := ldv_successful_malloc_#t~malloc4.base, ldv_successful_malloc_#t~malloc4.offset;assume_abort_if_not_#in~cond := (if ldv_successful_malloc_~ptr~0.base != 0 || ldv_successful_malloc_~ptr~0.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} is VALID [2020-07-28 18:03:39,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} assume !(0 == assume_abort_if_not_~cond); {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} is VALID [2020-07-28 18:03:39,616 INFO L280 TraceCheckUtils]: 7: Hoare triple {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset := ldv_successful_malloc_~ptr~0.base, ldv_successful_malloc_~ptr~0.offset; {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} is VALID [2020-07-28 18:03:39,619 INFO L280 TraceCheckUtils]: 8: Hoare triple {1130#(and (= 0 (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|)) (= 0 |~#mutexes~0.offset|))} foo_#t~ret30.base, foo_#t~ret30.offset := ldv_successful_malloc_#res.base, ldv_successful_malloc_#res.offset;foo_~m2~0.base, foo_~m2~0.offset := foo_#t~ret30.base, foo_#t~ret30.offset;havoc foo_#t~ret30.base, foo_#t~ret30.offset;mutex_lock_#in~m.base, mutex_lock_#in~m.offset := foo_~m1~0.base, foo_~m1~0.offset;havoc mutex_lock_#t~ret26, mutex_lock_~m.base, mutex_lock_~m.offset;mutex_lock_~m.base, mutex_lock_~m.offset := mutex_lock_#in~m.base, mutex_lock_#in~m.offset;ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset, ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset := mutex_lock_~m.base, mutex_lock_~m.offset, ~#mutexes~0.base, ~#mutexes~0.offset;havoc ldv_is_in_set_#res;havoc ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset, ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset, ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset, ldv_is_in_set_#t~mem23.base, ldv_is_in_set_#t~mem23.offset, ldv_is_in_set_~__mptr~4.base, ldv_is_in_set_~__mptr~4.offset, ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset, ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;ldv_is_in_set_~e.base, ldv_is_in_set_~e.offset := ldv_is_in_set_#in~e.base, ldv_is_in_set_#in~e.offset;ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset := ldv_is_in_set_#in~s.base, ldv_is_in_set_#in~s.offset;havoc ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset;call ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset := read~$Pointer$(ldv_is_in_set_~s.base, ldv_is_in_set_~s.offset, 4);ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset := ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset;havoc ldv_is_in_set_#t~mem22.base, ldv_is_in_set_#t~mem22.offset;ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset := ldv_is_in_set_~__mptr~3.base, ldv_is_in_set_~__mptr~3.offset - 4; {1131#(and (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4) ULTIMATE.start_ldv_is_in_set_~s.offset) (= 0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4)))} is VALID [2020-07-28 18:03:39,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {1131#(and (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4) ULTIMATE.start_ldv_is_in_set_~s.offset) (= 0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4)))} assume !!(ldv_is_in_set_~m~1.base != ldv_is_in_set_~s.base || 4 + ldv_is_in_set_~m~1.offset != ldv_is_in_set_~s.offset);call ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset := read~$Pointer$(ldv_is_in_set_~m~1.base, ldv_is_in_set_~m~1.offset, 4); {1129#false} is VALID [2020-07-28 18:03:39,620 INFO L280 TraceCheckUtils]: 10: Hoare triple {1129#false} assume ldv_is_in_set_#t~mem24.base == ldv_is_in_set_~e.base && ldv_is_in_set_#t~mem24.offset == ldv_is_in_set_~e.offset;havoc ldv_is_in_set_#t~mem24.base, ldv_is_in_set_#t~mem24.offset;ldv_is_in_set_#res := 1; {1129#false} is VALID [2020-07-28 18:03:39,621 INFO L280 TraceCheckUtils]: 11: Hoare triple {1129#false} mutex_lock_#t~ret26 := ldv_is_in_set_#res;assume -2147483648 <= mutex_lock_#t~ret26 && mutex_lock_#t~ret26 <= 2147483647; {1129#false} is VALID [2020-07-28 18:03:39,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {1129#false} assume 0 != mutex_lock_#t~ret26;havoc mutex_lock_#t~ret26; {1129#false} is VALID [2020-07-28 18:03:39,622 INFO L280 TraceCheckUtils]: 13: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2020-07-28 18:03:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:03:39,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671835216] [2020-07-28 18:03:39,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:03:39,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:03:39,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427415679] [2020-07-28 18:03:39,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 18:03:39,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:03:39,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:03:39,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:39,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:03:39,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:03:39,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:03:39,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:03:39,650 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand 4 states. [2020-07-28 18:03:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:40,542 INFO L93 Difference]: Finished difference Result 219 states and 262 transitions. [2020-07-28 18:03:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:03:40,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 18:03:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:03:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:03:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 256 transitions. [2020-07-28 18:03:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:03:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 256 transitions. [2020-07-28 18:03:40,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 256 transitions. [2020-07-28 18:03:40,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:03:40,961 INFO L225 Difference]: With dead ends: 219 [2020-07-28 18:03:40,962 INFO L226 Difference]: Without dead ends: 140 [2020-07-28 18:03:40,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:03:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-07-28 18:03:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 101. [2020-07-28 18:03:41,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:03:41,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 101 states. [2020-07-28 18:03:41,055 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 101 states. [2020-07-28 18:03:41,055 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 101 states. [2020-07-28 18:03:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:41,061 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2020-07-28 18:03:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2020-07-28 18:03:41,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:41,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:41,062 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 140 states. [2020-07-28 18:03:41,062 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 140 states. [2020-07-28 18:03:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:03:41,068 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2020-07-28 18:03:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2020-07-28 18:03:41,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:03:41,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:03:41,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:03:41,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:03:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-28 18:03:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2020-07-28 18:03:41,073 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 14 [2020-07-28 18:03:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:03:41,073 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2020-07-28 18:03:41,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:03:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2020-07-28 18:03:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-28 18:03:41,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:03:41,074 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:03:41,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 18:03:41,075 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:03:41,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:03:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1115638045, now seen corresponding path program 1 times [2020-07-28 18:03:41,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:03:41,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900859990] [2020-07-28 18:03:41,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:03:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:03:41,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:03:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:03:41,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:03:41,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 18:03:41,226 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 18:03:41,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 18:03:41,321 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:03:41,322 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:03:41,322 WARN L170 areAnnotationChecker]: L655 has no Hoare annotation [2020-07-28 18:03:41,322 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2020-07-28 18:03:41,322 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2020-07-28 18:03:41,323 WARN L170 areAnnotationChecker]: L553 has no Hoare annotation [2020-07-28 18:03:41,323 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-28 18:03:41,323 WARN L170 areAnnotationChecker]: L554-2 has no Hoare annotation [2020-07-28 18:03:41,323 WARN L170 areAnnotationChecker]: L554-2 has no Hoare annotation [2020-07-28 18:03:41,323 WARN L170 areAnnotationChecker]: L553-1 has no Hoare annotation [2020-07-28 18:03:41,323 WARN L170 areAnnotationChecker]: L567-1 has no Hoare annotation [2020-07-28 18:03:41,324 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-28 18:03:41,324 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-28 18:03:41,324 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-28 18:03:41,324 WARN L170 areAnnotationChecker]: L644-4 has no Hoare annotation [2020-07-28 18:03:41,324 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2020-07-28 18:03:41,324 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2020-07-28 18:03:41,325 WARN L170 areAnnotationChecker]: L649 has no Hoare annotation [2020-07-28 18:03:41,325 WARN L170 areAnnotationChecker]: L644-2 has no Hoare annotation [2020-07-28 18:03:41,325 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2020-07-28 18:03:41,325 WARN L170 areAnnotationChecker]: L658 has no Hoare annotation [2020-07-28 18:03:41,325 WARN L170 areAnnotationChecker]: L658-1 has no Hoare annotation [2020-07-28 18:03:41,326 WARN L170 areAnnotationChecker]: L658-1 has no Hoare annotation [2020-07-28 18:03:41,326 WARN L170 areAnnotationChecker]: L658-3 has no Hoare annotation [2020-07-28 18:03:41,326 WARN L170 areAnnotationChecker]: L644-8 has no Hoare annotation [2020-07-28 18:03:41,326 WARN L170 areAnnotationChecker]: L644-8 has no Hoare annotation [2020-07-28 18:03:41,326 WARN L170 areAnnotationChecker]: L644-8 has no Hoare annotation [2020-07-28 18:03:41,326 WARN L170 areAnnotationChecker]: L644-9 has no Hoare annotation [2020-07-28 18:03:41,327 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2020-07-28 18:03:41,327 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2020-07-28 18:03:41,327 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2020-07-28 18:03:41,327 WARN L170 areAnnotationChecker]: L644-7 has no Hoare annotation [2020-07-28 18:03:41,327 WARN L170 areAnnotationChecker]: L625 has no Hoare annotation [2020-07-28 18:03:41,328 WARN L170 areAnnotationChecker]: L625 has no Hoare annotation [2020-07-28 18:03:41,328 WARN L170 areAnnotationChecker]: L554-4 has no Hoare annotation [2020-07-28 18:03:41,328 WARN L170 areAnnotationChecker]: L554-4 has no Hoare annotation [2020-07-28 18:03:41,328 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2020-07-28 18:03:41,328 WARN L170 areAnnotationChecker]: L553-2 has no Hoare annotation [2020-07-28 18:03:41,328 WARN L170 areAnnotationChecker]: L644-13 has no Hoare annotation [2020-07-28 18:03:41,329 WARN L170 areAnnotationChecker]: L644-13 has no Hoare annotation [2020-07-28 18:03:41,329 WARN L170 areAnnotationChecker]: L644-13 has no Hoare annotation [2020-07-28 18:03:41,329 WARN L170 areAnnotationChecker]: L567-2 has no Hoare annotation [2020-07-28 18:03:41,329 WARN L170 areAnnotationChecker]: L644-14 has no Hoare annotation [2020-07-28 18:03:41,329 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2020-07-28 18:03:41,329 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2020-07-28 18:03:41,330 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-28 18:03:41,330 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-28 18:03:41,330 WARN L170 areAnnotationChecker]: L644-12 has no Hoare annotation [2020-07-28 18:03:41,330 WARN L170 areAnnotationChecker]: L658-4 has no Hoare annotation [2020-07-28 18:03:41,330 WARN L170 areAnnotationChecker]: L658-4 has no Hoare annotation [2020-07-28 18:03:41,331 WARN L170 areAnnotationChecker]: L658-5 has no Hoare annotation [2020-07-28 18:03:41,331 WARN L170 areAnnotationChecker]: L658-5 has no Hoare annotation [2020-07-28 18:03:41,331 WARN L170 areAnnotationChecker]: L658-7 has no Hoare annotation [2020-07-28 18:03:41,331 WARN L170 areAnnotationChecker]: L644-18 has no Hoare annotation [2020-07-28 18:03:41,331 WARN L170 areAnnotationChecker]: L644-18 has no Hoare annotation [2020-07-28 18:03:41,331 WARN L170 areAnnotationChecker]: L644-18 has no Hoare annotation [2020-07-28 18:03:41,332 WARN L170 areAnnotationChecker]: L644-19 has no Hoare annotation [2020-07-28 18:03:41,332 WARN L170 areAnnotationChecker]: L645-3 has no Hoare annotation [2020-07-28 18:03:41,332 WARN L170 areAnnotationChecker]: L645-3 has no Hoare annotation [2020-07-28 18:03:41,332 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2020-07-28 18:03:41,332 WARN L170 areAnnotationChecker]: L644-17 has no Hoare annotation [2020-07-28 18:03:41,333 WARN L170 areAnnotationChecker]: L625-1 has no Hoare annotation [2020-07-28 18:03:41,333 WARN L170 areAnnotationChecker]: L625-1 has no Hoare annotation [2020-07-28 18:03:41,333 WARN L170 areAnnotationChecker]: L554-6 has no Hoare annotation [2020-07-28 18:03:41,333 WARN L170 areAnnotationChecker]: L554-6 has no Hoare annotation [2020-07-28 18:03:41,333 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2020-07-28 18:03:41,334 WARN L170 areAnnotationChecker]: L553-3 has no Hoare annotation [2020-07-28 18:03:41,334 WARN L170 areAnnotationChecker]: L644-23 has no Hoare annotation [2020-07-28 18:03:41,334 WARN L170 areAnnotationChecker]: L644-23 has no Hoare annotation [2020-07-28 18:03:41,334 WARN L170 areAnnotationChecker]: L644-23 has no Hoare annotation [2020-07-28 18:03:41,334 WARN L170 areAnnotationChecker]: L567-3 has no Hoare annotation [2020-07-28 18:03:41,334 WARN L170 areAnnotationChecker]: L644-24 has no Hoare annotation [2020-07-28 18:03:41,335 WARN L170 areAnnotationChecker]: L645-4 has no Hoare annotation [2020-07-28 18:03:41,335 WARN L170 areAnnotationChecker]: L645-4 has no Hoare annotation [2020-07-28 18:03:41,335 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2020-07-28 18:03:41,335 WARN L170 areAnnotationChecker]: L649-4 has no Hoare annotation [2020-07-28 18:03:41,335 WARN L170 areAnnotationChecker]: L644-22 has no Hoare annotation [2020-07-28 18:03:41,336 WARN L170 areAnnotationChecker]: L662 has no Hoare annotation [2020-07-28 18:03:41,336 WARN L170 areAnnotationChecker]: L662 has no Hoare annotation [2020-07-28 18:03:41,336 WARN L170 areAnnotationChecker]: L662-1 has no Hoare annotation [2020-07-28 18:03:41,336 WARN L170 areAnnotationChecker]: L662-1 has no Hoare annotation [2020-07-28 18:03:41,336 WARN L170 areAnnotationChecker]: L662-3 has no Hoare annotation [2020-07-28 18:03:41,336 WARN L170 areAnnotationChecker]: L635-3 has no Hoare annotation [2020-07-28 18:03:41,337 WARN L170 areAnnotationChecker]: L635-3 has no Hoare annotation [2020-07-28 18:03:41,337 WARN L170 areAnnotationChecker]: L635-3 has no Hoare annotation [2020-07-28 18:03:41,337 WARN L170 areAnnotationChecker]: L632 has no Hoare annotation [2020-07-28 18:03:41,337 WARN L170 areAnnotationChecker]: L636 has no Hoare annotation [2020-07-28 18:03:41,337 WARN L170 areAnnotationChecker]: L636 has no Hoare annotation [2020-07-28 18:03:41,338 WARN L170 areAnnotationChecker]: L644-28 has no Hoare annotation [2020-07-28 18:03:41,338 WARN L170 areAnnotationChecker]: L644-28 has no Hoare annotation [2020-07-28 18:03:41,338 WARN L170 areAnnotationChecker]: L644-28 has no Hoare annotation [2020-07-28 18:03:41,338 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2020-07-28 18:03:41,338 WARN L170 areAnnotationChecker]: L635-2 has no Hoare annotation [2020-07-28 18:03:41,339 WARN L170 areAnnotationChecker]: L644-29 has no Hoare annotation [2020-07-28 18:03:41,339 WARN L170 areAnnotationChecker]: L645-5 has no Hoare annotation [2020-07-28 18:03:41,339 WARN L170 areAnnotationChecker]: L645-5 has no Hoare annotation [2020-07-28 18:03:41,339 WARN L170 areAnnotationChecker]: L603 has no Hoare annotation [2020-07-28 18:03:41,339 WARN L170 areAnnotationChecker]: L649-5 has no Hoare annotation [2020-07-28 18:03:41,340 WARN L170 areAnnotationChecker]: L644-27 has no Hoare annotation [2020-07-28 18:03:41,340 WARN L170 areAnnotationChecker]: L662-4 has no Hoare annotation [2020-07-28 18:03:41,340 WARN L170 areAnnotationChecker]: L662-4 has no Hoare annotation [2020-07-28 18:03:41,340 WARN L170 areAnnotationChecker]: L662-5 has no Hoare annotation [2020-07-28 18:03:41,340 WARN L170 areAnnotationChecker]: L662-5 has no Hoare annotation [2020-07-28 18:03:41,341 WARN L170 areAnnotationChecker]: L662-7 has no Hoare annotation [2020-07-28 18:03:41,341 WARN L170 areAnnotationChecker]: L635-7 has no Hoare annotation [2020-07-28 18:03:41,341 WARN L170 areAnnotationChecker]: L635-7 has no Hoare annotation [2020-07-28 18:03:41,341 WARN L170 areAnnotationChecker]: L635-7 has no Hoare annotation [2020-07-28 18:03:41,341 WARN L170 areAnnotationChecker]: L632-1 has no Hoare annotation [2020-07-28 18:03:41,342 WARN L170 areAnnotationChecker]: L636-2 has no Hoare annotation [2020-07-28 18:03:41,342 WARN L170 areAnnotationChecker]: L636-2 has no Hoare annotation [2020-07-28 18:03:41,342 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-28 18:03:41,342 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2020-07-28 18:03:41,342 WARN L170 areAnnotationChecker]: L635-6 has no Hoare annotation [2020-07-28 18:03:41,342 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2020-07-28 18:03:41,343 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2020-07-28 18:03:41,343 WARN L170 areAnnotationChecker]: L666 has no Hoare annotation [2020-07-28 18:03:41,343 WARN L170 areAnnotationChecker]: L666 has no Hoare annotation [2020-07-28 18:03:41,343 WARN L170 areAnnotationChecker]: L666-1 has no Hoare annotation [2020-07-28 18:03:41,343 WARN L170 areAnnotationChecker]: L666-1 has no Hoare annotation [2020-07-28 18:03:41,344 WARN L170 areAnnotationChecker]: L665 has no Hoare annotation [2020-07-28 18:03:41,344 WARN L170 areAnnotationChecker]: L682 has no Hoare annotation [2020-07-28 18:03:41,344 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:03:41,344 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:03:41,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:03:41 BoogieIcfgContainer [2020-07-28 18:03:41,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:03:41,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:03:41,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:03:41,348 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:03:41,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:03:37" (3/4) ... [2020-07-28 18:03:41,351 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 18:03:41,438 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:03:41,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:03:41,442 INFO L168 Benchmark]: Toolchain (without parser) took 6167.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 953.5 MB in the beginning and 960.4 MB in the end (delta: -6.9 MB). Peak memory consumption was 209.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:41,442 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:03:41,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:41,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:41,445 INFO L168 Benchmark]: Boogie Preprocessor took 77.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:41,445 INFO L168 Benchmark]: RCFGBuilder took 1017.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.2 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:41,446 INFO L168 Benchmark]: TraceAbstraction took 4212.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.0 GB in the beginning and 976.2 MB in the end (delta: 31.0 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:41,447 INFO L168 Benchmark]: Witness Printer took 91.09 ms. Allocated memory is still 1.2 GB. Free memory was 976.2 MB in the beginning and 960.4 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:03:41,450 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 659.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1017.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.2 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4212.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.0 GB in the beginning and 976.2 MB in the end (delta: 31.0 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. * Witness Printer took 91.09 ms. Allocated memory is still 1.2 GB. Free memory was 976.2 MB in the beginning and 960.4 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 658]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L654] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; VAL [mutexes={2:0}] [L565] void *ptr = malloc(size); [L554] COND FALSE !(!cond) VAL [mutexes={2:0}] [L567] return ptr; VAL [mutexes={2:0}] [L671] struct mutex *m1 = ldv_successful_malloc(sizeof(struct mutex)); [L565] void *ptr = malloc(size); [L554] COND FALSE !(!cond) VAL [mutexes={2:0}] [L567] return ptr; VAL [mutexes={2:0}] [L672] struct mutex *m2 = ldv_successful_malloc(sizeof(struct mutex)); [L643] struct ldv_list_element *m; [L644] EXPR (s)->next [L644] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L644] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [mutexes={2:0}] [L644] COND FALSE !(&m->list != (s)) VAL [mutexes={2:0}] [L649] return 0; VAL [mutexes={2:0}] [L658] COND FALSE !(ldv_is_in_set(m, &mutexes)) [L643] struct ldv_list_element *m; [L644] EXPR (s)->next [L644] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L644] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [mutexes={2:0}] [L644] COND FALSE !(&m->list != (s)) VAL [mutexes={2:0}] [L649] return 0; VAL [mutexes={2:0}] [L625] COND TRUE !ldv_is_in_set(new, s) [L626] struct ldv_list_element *le; [L565] void *ptr = malloc(size); [L554] COND FALSE !(!cond) VAL [mutexes={2:0}] [L567] return ptr; VAL [mutexes={2:0}] [L627] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L628] le->e = new [L597] head->next [L585] next->prev = new [L586] new->next = next [L587] new->prev = prev [L588] prev->next = new VAL [mutexes={2:0}] [L643] struct ldv_list_element *m; [L644] EXPR (s)->next [L644] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L644] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [mutexes={2:0}] [L644] COND TRUE &m->list != (s) [L645] EXPR m->e VAL [mutexes={2:0}] [L645] COND TRUE m->e == e [L646] return 1; VAL [mutexes={2:0}] [L658] COND TRUE ldv_is_in_set(m, &mutexes) [L658] __VERIFIER_error() VAL [mutexes={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 266 SDtfs, 165 SDslu, 281 SDs, 0 SdLazy, 105 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 82 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 2496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...