./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/stateful_check.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-regression/stateful_check.c -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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:49:48,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:49:48,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:49:48,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:49:48,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:49:48,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:49:48,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:49:48,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:49:48,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:49:48,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:49:48,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:49:48,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:49:48,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:49:48,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:49:48,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:49:48,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:49:48,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:49:48,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:49:48,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:49:48,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:49:48,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:49:48,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:49:48,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:49:48,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:49:48,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:49:48,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:49:48,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:49:48,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:49:48,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:49:48,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:49:48,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:49:48,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:49:48,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:49:48,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:49:48,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:49:48,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:49:48,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:49:48,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:49:48,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:49:48,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:49:48,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:49:48,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:49:48,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:49:48,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:49:48,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:49:48,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:49:48,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:49:48,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:49:48,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:49:48,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:49:48,664 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:49:48,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:49:48,665 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:49:48,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:49:48,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:49:48,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:49:48,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:49:48,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:49:48,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:49:48,666 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:49:48,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:49:48,667 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:49:48,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:49:48,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:49:48,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:49:48,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:49:48,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:48,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:49:48,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:49:48,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:49:48,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:49:48,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:49:48,668 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:49:48,669 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:49:48,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:49:48,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e [2022-02-20 16:49:48,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:49:48,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:49:48,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:49:48,884 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:49:48,885 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:49:48,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/stateful_check.c [2022-02-20 16:49:48,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d9856a3/6a2abd3e7b7e4cd98e0f53be662254ef/FLAG5239b4ede [2022-02-20 16:49:49,427 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:49:49,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2022-02-20 16:49:49,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d9856a3/6a2abd3e7b7e4cd98e0f53be662254ef/FLAG5239b4ede [2022-02-20 16:49:49,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d9856a3/6a2abd3e7b7e4cd98e0f53be662254ef [2022-02-20 16:49:49,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:49:49,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:49:49,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:49,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:49:49,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:49:49,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:49" (1/1) ... [2022-02-20 16:49:49,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f288485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:49, skipping insertion in model container [2022-02-20 16:49:49,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:49" (1/1) ... [2022-02-20 16:49:49,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:49:49,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:49:50,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c[298,311] [2022-02-20 16:49:50,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:50,100 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:49:50,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c[298,311] [2022-02-20 16:49:50,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:50,122 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:49:50,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50 WrapperNode [2022-02-20 16:49:50,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:50,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:50,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:49:50,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:49:50,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,153 INFO L137 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 100 [2022-02-20 16:49:50,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:50,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:49:50,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:49:50,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:49:50,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:49:50,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:49:50,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:49:50,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:49:50,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (1/1) ... [2022-02-20 16:49:50,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:49:50,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:49:50,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:49:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:49:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2022-02-20 16:49:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2022-02-20 16:49:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:49:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-02-20 16:49:50,227 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-02-20 16:49:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:49:50,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:49:50,276 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:49:50,278 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:49:50,467 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:49:50,473 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:49:50,477 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:49:50,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:50 BoogieIcfgContainer [2022-02-20 16:49:50,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:49:50,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:49:50,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:49:50,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:49:50,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:49:49" (1/3) ... [2022-02-20 16:49:50,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59324961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:50, skipping insertion in model container [2022-02-20 16:49:50,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:50" (2/3) ... [2022-02-20 16:49:50,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59324961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:50, skipping insertion in model container [2022-02-20 16:49:50,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:50" (3/3) ... [2022-02-20 16:49:50,485 INFO L111 eAbstractionObserver]: Analyzing ICFG stateful_check.c [2022-02-20 16:49:50,489 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:49:50,489 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:49:50,529 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:49:50,538 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:49:50,539 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:49:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 41 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:49:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:49:50,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:50,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:50,573 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2032519849, now seen corresponding path program 1 times [2022-02-20 16:49:50,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:50,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384213591] [2022-02-20 16:49:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:50,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0; {49#true} is VALID [2022-02-20 16:49:50,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0; {49#true} is VALID [2022-02-20 16:49:50,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {49#true} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;havoc main_#t~ret5#1; {49#true} is VALID [2022-02-20 16:49:50,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {49#true} assume !true; {50#false} is VALID [2022-02-20 16:49:50,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {50#false} assume { :begin_inline_check_final_state } true; {50#false} is VALID [2022-02-20 16:49:50,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {50#false} assume !(1 == ~ldv_mutex~0); {50#false} is VALID [2022-02-20 16:49:50,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {50#false} call __blast_assert(); {50#false} is VALID [2022-02-20 16:49:50,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {50#false} assume !false; {50#false} is VALID [2022-02-20 16:49:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:50,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:50,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384213591] [2022-02-20 16:49:50,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384213591] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:50,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:50,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:49:50,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760931001] [2022-02-20 16:49:50,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:50,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:49:50,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:50,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:50,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:50,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:49:50,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:49:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:49:50,793 INFO L87 Difference]: Start difference. First operand has 46 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 41 states have internal predecessors, (53), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:50,867 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2022-02-20 16:49:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:49:50,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:49:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 129 transitions. [2022-02-20 16:49:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 129 transitions. [2022-02-20 16:49:50,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 129 transitions. [2022-02-20 16:49:50,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:51,001 INFO L225 Difference]: With dead ends: 87 [2022-02-20 16:49:51,002 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:49:51,004 INFO L932 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 [2022-02-20 16:49:51,010 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:51,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:49:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 16:49:51,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:51,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:51,034 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:51,036 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:51,045 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-02-20 16:49:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-02-20 16:49:51,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:51,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:51,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-02-20 16:49:51,047 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-02-20 16:49:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:51,050 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-02-20 16:49:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-02-20 16:49:51,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:51,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:51,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:51,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.4375) internal successors, (46), 35 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2022-02-20 16:49:51,056 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 8 [2022-02-20 16:49:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:51,056 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2022-02-20 16:49:51,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-02-20 16:49:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:49:51,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:51,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:51,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:49:51,059 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash 160489557, now seen corresponding path program 1 times [2022-02-20 16:49:51,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:51,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203582550] [2022-02-20 16:49:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:51,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {306#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0; {308#(= ~ldv_mutex~0 1)} is VALID [2022-02-20 16:49:51,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#(= ~ldv_mutex~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0; {308#(= ~ldv_mutex~0 1)} is VALID [2022-02-20 16:49:51,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#(= ~ldv_mutex~0 1)} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;havoc main_#t~ret5#1; {308#(= ~ldv_mutex~0 1)} is VALID [2022-02-20 16:49:51,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {308#(= ~ldv_mutex~0 1)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {308#(= ~ldv_mutex~0 1)} is VALID [2022-02-20 16:49:51,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {308#(= ~ldv_mutex~0 1)} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {308#(= ~ldv_mutex~0 1)} is VALID [2022-02-20 16:49:51,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {308#(= ~ldv_mutex~0 1)} assume { :begin_inline_check_final_state } true; {308#(= ~ldv_mutex~0 1)} is VALID [2022-02-20 16:49:51,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {308#(= ~ldv_mutex~0 1)} assume !(1 == ~ldv_mutex~0); {307#false} is VALID [2022-02-20 16:49:51,117 INFO L272 TraceCheckUtils]: 7: Hoare triple {307#false} call __blast_assert(); {307#false} is VALID [2022-02-20 16:49:51,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-02-20 16:49:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:51,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:51,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203582550] [2022-02-20 16:49:51,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203582550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:51,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:51,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:49:51,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862830835] [2022-02-20 16:49:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:49:51,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:51,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:51,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:51,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:49:51,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:51,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:49:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:49:51,140 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:51,246 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2022-02-20 16:49:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:49:51,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:49:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-02-20 16:49:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-02-20 16:49:51,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2022-02-20 16:49:51,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:51,352 INFO L225 Difference]: With dead ends: 68 [2022-02-20 16:49:51,352 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 16:49:51,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:49:51,353 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 33 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:51,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 102 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 16:49:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-20 16:49:51,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:51,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 55 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:51,359 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 55 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:51,359 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 55 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:51,367 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2022-02-20 16:49:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2022-02-20 16:49:51,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:51,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:51,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 55 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 62 states. [2022-02-20 16:49:51,369 INFO L87 Difference]: Start difference. First operand has 62 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 55 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 62 states. [2022-02-20 16:49:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:51,372 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2022-02-20 16:49:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2022-02-20 16:49:51,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:51,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:51,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:51,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 55 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2022-02-20 16:49:51,375 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 9 [2022-02-20 16:49:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:51,376 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2022-02-20 16:49:51,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2022-02-20 16:49:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:49:51,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:51,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:51,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:49:51,377 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:51,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1852157628, now seen corresponding path program 1 times [2022-02-20 16:49:51,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:51,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332240365] [2022-02-20 16:49:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 16:49:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:51,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {623#(= |old(~ldv_mutex~0)| ~ldv_mutex~0)} assume 1 == ~ldv_mutex~0; {616#true} is VALID [2022-02-20 16:49:51,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} ~ldv_mutex~0 := 2; {616#true} is VALID [2022-02-20 16:49:51,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-02-20 16:49:51,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {617#false} #134#return; {617#false} is VALID [2022-02-20 16:49:51,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0; {616#true} is VALID [2022-02-20 16:49:51,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0; {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;havoc main_#t~ret5#1; {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~switch8#1 := 0 == main_#t~nondet7#1; {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1 == main_#t~nondet7#1; {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 2 == main_#t~nondet7#1; {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 3 == main_#t~nondet7#1; {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume main_#t~switch8#1; {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume 3 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_release } true;havoc misc_release_#res#1; {617#false} is VALID [2022-02-20 16:49:51,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {617#false} assume !(0 != ~open_called~0); {617#false} is VALID [2022-02-20 16:49:51,437 INFO L272 TraceCheckUtils]: 11: Hoare triple {617#false} call mutex_lock(); {623#(= |old(~ldv_mutex~0)| ~ldv_mutex~0)} is VALID [2022-02-20 16:49:51,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#(= |old(~ldv_mutex~0)| ~ldv_mutex~0)} assume 1 == ~ldv_mutex~0; {616#true} is VALID [2022-02-20 16:49:51,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {616#true} ~ldv_mutex~0 := 2; {616#true} is VALID [2022-02-20 16:49:51,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {616#true} assume true; {616#true} is VALID [2022-02-20 16:49:51,438 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {616#true} {617#false} #134#return; {617#false} is VALID [2022-02-20 16:49:51,438 INFO L272 TraceCheckUtils]: 16: Hoare triple {617#false} call mutex_lock(); {617#false} is VALID [2022-02-20 16:49:51,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {617#false} assume !(1 == ~ldv_mutex~0); {617#false} is VALID [2022-02-20 16:49:51,439 INFO L272 TraceCheckUtils]: 18: Hoare triple {617#false} call __blast_assert(); {617#false} is VALID [2022-02-20 16:49:51,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {617#false} assume !false; {617#false} is VALID [2022-02-20 16:49:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:51,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:51,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332240365] [2022-02-20 16:49:51,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332240365] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:51,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:51,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:49:51,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119579568] [2022-02-20 16:49:51,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:51,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:49:51,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:51,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:51,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:51,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:49:51,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:51,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:49:51,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:49:51,463 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:51,590 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2022-02-20 16:49:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:49:51,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:49:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-02-20 16:49:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-02-20 16:49:51,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-02-20 16:49:51,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:51,685 INFO L225 Difference]: With dead ends: 148 [2022-02-20 16:49:51,685 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 16:49:51,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:49:51,686 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:51,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 119 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 16:49:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-02-20 16:49:51,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:51,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 86 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:51,696 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 86 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:51,696 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 86 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:51,701 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2022-02-20 16:49:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2022-02-20 16:49:51,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:51,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:51,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 89 states. [2022-02-20 16:49:51,705 INFO L87 Difference]: Start difference. First operand has 86 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 89 states. [2022-02-20 16:49:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:51,709 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2022-02-20 16:49:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2022-02-20 16:49:51,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:51,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:51,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:51,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 79 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2022-02-20 16:49:51,716 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 20 [2022-02-20 16:49:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:51,717 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2022-02-20 16:49:51,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2022-02-20 16:49:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 16:49:51,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:51,718 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:51,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:49:51,718 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1007794771, now seen corresponding path program 1 times [2022-02-20 16:49:51,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:51,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202479553] [2022-02-20 16:49:51,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 16:49:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:51,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {1126#(= |old(~ldv_mutex~0)| ~ldv_mutex~0)} assume 1 == ~ldv_mutex~0; {1118#true} is VALID [2022-02-20 16:49:51,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1118#true} ~ldv_mutex~0 := 2; {1118#true} is VALID [2022-02-20 16:49:51,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1118#true} assume true; {1118#true} is VALID [2022-02-20 16:49:51,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1118#true} {1119#false} #134#return; {1119#false} is VALID [2022-02-20 16:49:51,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {1118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0; {1118#true} is VALID [2022-02-20 16:49:51,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0; {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;havoc main_#t~ret5#1; {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~switch8#1 := 0 == main_#t~nondet7#1; {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume main_#t~switch8#1; {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume 0 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_open } true;havoc misc_open_#res#1;havoc misc_open_#t~nondet4#1;assume -2147483648 <= misc_open_#t~nondet4#1 && misc_open_#t~nondet4#1 <= 2147483647; {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} assume 0 != misc_open_#t~nondet4#1;havoc misc_open_#t~nondet4#1;misc_open_#res#1 := 1; {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} is VALID [2022-02-20 16:49:51,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {1120#(= 0 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|)} main_#t~ret9#1 := misc_open_#res#1;assume { :end_inline_misc_open } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;havoc main_#t~ret9#1;main_#t~post10#1 := main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:51,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} havoc main_#t~nondet7#1;havoc main_#t~switch8#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:51,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:51,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~switch8#1 := 0 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:51,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:51,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 2 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:51,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 3 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:51,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume main_#t~switch8#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:51,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume 3 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_release } true;havoc misc_release_#res#1; {1119#false} is VALID [2022-02-20 16:49:51,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {1119#false} assume !(0 != ~open_called~0); {1119#false} is VALID [2022-02-20 16:49:51,797 INFO L272 TraceCheckUtils]: 18: Hoare triple {1119#false} call mutex_lock(); {1126#(= |old(~ldv_mutex~0)| ~ldv_mutex~0)} is VALID [2022-02-20 16:49:51,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {1126#(= |old(~ldv_mutex~0)| ~ldv_mutex~0)} assume 1 == ~ldv_mutex~0; {1118#true} is VALID [2022-02-20 16:49:51,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {1118#true} ~ldv_mutex~0 := 2; {1118#true} is VALID [2022-02-20 16:49:51,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {1118#true} assume true; {1118#true} is VALID [2022-02-20 16:49:51,798 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1118#true} {1119#false} #134#return; {1119#false} is VALID [2022-02-20 16:49:51,798 INFO L272 TraceCheckUtils]: 23: Hoare triple {1119#false} call mutex_lock(); {1119#false} is VALID [2022-02-20 16:49:51,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {1119#false} assume !(1 == ~ldv_mutex~0); {1119#false} is VALID [2022-02-20 16:49:51,798 INFO L272 TraceCheckUtils]: 25: Hoare triple {1119#false} call __blast_assert(); {1119#false} is VALID [2022-02-20 16:49:51,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {1119#false} assume !false; {1119#false} is VALID [2022-02-20 16:49:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:51,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:51,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202479553] [2022-02-20 16:49:51,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202479553] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:51,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967362282] [2022-02-20 16:49:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:51,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:49:51,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:49:51,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:49:51,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:49:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:51,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:49:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:51,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:52,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {1118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0; {1118#true} is VALID [2022-02-20 16:49:52,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {1118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0; {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} is VALID [2022-02-20 16:49:52,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;havoc main_#t~ret5#1; {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} is VALID [2022-02-20 16:49:52,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} is VALID [2022-02-20 16:49:52,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~switch8#1 := 0 == main_#t~nondet7#1; {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} is VALID [2022-02-20 16:49:52,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} assume main_#t~switch8#1; {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} is VALID [2022-02-20 16:49:52,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} assume 0 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_open } true;havoc misc_open_#res#1;havoc misc_open_#t~nondet4#1;assume -2147483648 <= misc_open_#t~nondet4#1 && misc_open_#t~nondet4#1 <= 2147483647; {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} is VALID [2022-02-20 16:49:52,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} assume 0 != misc_open_#t~nondet4#1;havoc misc_open_#t~nondet4#1;misc_open_#res#1 := 1; {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} is VALID [2022-02-20 16:49:52,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 0)} main_#t~ret9#1 := misc_open_#res#1;assume { :end_inline_misc_open } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;havoc main_#t~ret9#1;main_#t~post10#1 := main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} havoc main_#t~nondet7#1;havoc main_#t~switch8#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~switch8#1 := 0 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 2 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 3 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume main_#t~switch8#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume 3 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_release } true;havoc misc_release_#res#1; {1119#false} is VALID [2022-02-20 16:49:52,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {1119#false} assume !(0 != ~open_called~0); {1119#false} is VALID [2022-02-20 16:49:52,068 INFO L272 TraceCheckUtils]: 18: Hoare triple {1119#false} call mutex_lock(); {1119#false} is VALID [2022-02-20 16:49:52,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {1119#false} assume 1 == ~ldv_mutex~0; {1119#false} is VALID [2022-02-20 16:49:52,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {1119#false} ~ldv_mutex~0 := 2; {1119#false} is VALID [2022-02-20 16:49:52,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {1119#false} assume true; {1119#false} is VALID [2022-02-20 16:49:52,069 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1119#false} {1119#false} #134#return; {1119#false} is VALID [2022-02-20 16:49:52,069 INFO L272 TraceCheckUtils]: 23: Hoare triple {1119#false} call mutex_lock(); {1119#false} is VALID [2022-02-20 16:49:52,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {1119#false} assume !(1 == ~ldv_mutex~0); {1119#false} is VALID [2022-02-20 16:49:52,069 INFO L272 TraceCheckUtils]: 25: Hoare triple {1119#false} call __blast_assert(); {1119#false} is VALID [2022-02-20 16:49:52,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {1119#false} assume !false; {1119#false} is VALID [2022-02-20 16:49:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:49:52,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:52,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {1119#false} assume !false; {1119#false} is VALID [2022-02-20 16:49:52,207 INFO L272 TraceCheckUtils]: 25: Hoare triple {1119#false} call __blast_assert(); {1119#false} is VALID [2022-02-20 16:49:52,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {1119#false} assume !(1 == ~ldv_mutex~0); {1119#false} is VALID [2022-02-20 16:49:52,207 INFO L272 TraceCheckUtils]: 23: Hoare triple {1119#false} call mutex_lock(); {1119#false} is VALID [2022-02-20 16:49:52,209 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1118#true} {1119#false} #134#return; {1119#false} is VALID [2022-02-20 16:49:52,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {1118#true} assume true; {1118#true} is VALID [2022-02-20 16:49:52,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {1118#true} ~ldv_mutex~0 := 2; {1118#true} is VALID [2022-02-20 16:49:52,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {1118#true} assume 1 == ~ldv_mutex~0; {1118#true} is VALID [2022-02-20 16:49:52,221 INFO L272 TraceCheckUtils]: 18: Hoare triple {1119#false} call mutex_lock(); {1118#true} is VALID [2022-02-20 16:49:52,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {1119#false} assume !(0 != ~open_called~0); {1119#false} is VALID [2022-02-20 16:49:52,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} assume 3 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_release } true;havoc misc_release_#res#1; {1119#false} is VALID [2022-02-20 16:49:52,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} assume main_#t~switch8#1; {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} is VALID [2022-02-20 16:49:52,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 3 == main_#t~nondet7#1; {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} is VALID [2022-02-20 16:49:52,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 2 == main_#t~nondet7#1; {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} is VALID [2022-02-20 16:49:52,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1 == main_#t~nondet7#1; {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} is VALID [2022-02-20 16:49:52,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~switch8#1 := 0 == main_#t~nondet7#1; {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} is VALID [2022-02-20 16:49:52,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} is VALID [2022-02-20 16:49:52,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} havoc main_#t~nondet7#1;havoc main_#t~switch8#1; {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} is VALID [2022-02-20 16:49:52,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} main_#t~ret9#1 := misc_open_#res#1;assume { :end_inline_misc_open } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;havoc main_#t~ret9#1;main_#t~post10#1 := main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1239#(not (<= 3 |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1|))} is VALID [2022-02-20 16:49:52,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume 0 != misc_open_#t~nondet4#1;havoc misc_open_#t~nondet4#1;misc_open_#res#1 := 1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume 0 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_open } true;havoc misc_open_#res#1;havoc misc_open_#t~nondet4#1;assume -2147483648 <= misc_open_#t~nondet4#1 && misc_open_#t~nondet4#1 <= 2147483647; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume main_#t~switch8#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~switch8#1 := 0 == main_#t~nondet7#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;havoc main_#t~ret5#1; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {1118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0;my_init_#res#1 := 0; {1121#(<= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| 1)} is VALID [2022-02-20 16:49:52,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {1118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~ldv_mutex~0 := 1;~open_called~0 := 0; {1118#true} is VALID [2022-02-20 16:49:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:52,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967362282] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:49:52,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:49:52,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-02-20 16:49:52,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539436450] [2022-02-20 16:49:52,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:52,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 16:49:52,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:52,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:52,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:52,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:49:52,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:52,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:49:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:49:52,284 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:52,500 INFO L93 Difference]: Finished difference Result 253 states and 388 transitions. [2022-02-20 16:49:52,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:49:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 16:49:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2022-02-20 16:49:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2022-02-20 16:49:52,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 203 transitions. [2022-02-20 16:49:52,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:52,628 INFO L225 Difference]: With dead ends: 253 [2022-02-20 16:49:52,628 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 16:49:52,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:49:52,636 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 96 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:52,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 173 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 16:49:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2022-02-20 16:49:52,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:52,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 158 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 151 states have internal predecessors, (229), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:52,668 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 158 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 151 states have internal predecessors, (229), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:52,669 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 158 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 151 states have internal predecessors, (229), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:52,674 INFO L93 Difference]: Finished difference Result 170 states and 254 transitions. [2022-02-20 16:49:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2022-02-20 16:49:52,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:52,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:52,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 151 states have internal predecessors, (229), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 170 states. [2022-02-20 16:49:52,676 INFO L87 Difference]: Start difference. First operand has 158 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 151 states have internal predecessors, (229), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 170 states. [2022-02-20 16:49:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:52,682 INFO L93 Difference]: Finished difference Result 170 states and 254 transitions. [2022-02-20 16:49:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2022-02-20 16:49:52,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:52,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:52,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:52,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 148 states have (on average 1.5472972972972974) internal successors, (229), 151 states have internal predecessors, (229), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2022-02-20 16:49:52,689 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 27 [2022-02-20 16:49:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:52,689 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2022-02-20 16:49:52,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2022-02-20 16:49:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 16:49:52,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:52,691 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:52,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:52,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:49:52,908 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1977818999, now seen corresponding path program 1 times [2022-02-20 16:49:52,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:52,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799045125] [2022-02-20 16:49:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:52,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:49:52,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:49:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:49:52,977 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:49:52,978 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:49:52,978 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:49:52,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:49:52,982 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:49:52,984 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:49:53,008 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call mutex_lock(); [2022-02-20 16:49:53,009 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:49:53,011 INFO L158 Benchmark]: Toolchain (without parser) took 3074.64ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 62.0MB in the beginning and 42.7MB in the end (delta: 19.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-02-20 16:49:53,011 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:53,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.43ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 69.9MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:49:53,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.71ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 68.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:53,012 INFO L158 Benchmark]: Boogie Preprocessor took 14.65ms. Allocated memory is still 94.4MB. Free memory was 67.9MB in the beginning and 66.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:53,012 INFO L158 Benchmark]: RCFGBuilder took 309.08ms. Allocated memory is still 94.4MB. Free memory was 66.7MB in the beginning and 53.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:49:53,019 INFO L158 Benchmark]: TraceAbstraction took 2530.04ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.6MB in the beginning and 42.7MB in the end (delta: 9.9MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2022-02-20 16:49:53,020 INFO L339 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.17ms. Allocated memory is still 94.4MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.43ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 69.9MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.71ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 68.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.65ms. Allocated memory is still 94.4MB. Free memory was 67.9MB in the beginning and 66.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 309.08ms. Allocated memory is still 94.4MB. Free memory was 66.7MB in the beginning and 53.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2530.04ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.6MB in the beginning and 42.7MB in the end (delta: 9.9MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:49:53,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-regression/stateful_check.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:49:54,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:49:54,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:49:54,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:49:54,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:49:54,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:49:54,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:49:54,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:49:54,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:49:54,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:49:54,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:49:54,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:49:54,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:49:54,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:49:54,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:49:54,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:49:54,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:49:54,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:49:54,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:49:54,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:49:54,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:49:54,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:49:54,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:49:54,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:49:54,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:49:54,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:49:54,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:49:54,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:49:54,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:49:54,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:49:54,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:49:54,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:49:54,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:49:54,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:49:54,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:49:54,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:49:54,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:49:54,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:49:54,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:49:54,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:49:54,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:49:54,799 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:49:54,830 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:49:54,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:49:54,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:49:54,832 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:49:54,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:49:54,833 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:49:54,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:49:54,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:49:54,834 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:49:54,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:49:54,834 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:49:54,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:49:54,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:49:54,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:49:54,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:49:54,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:49:54,835 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:49:54,835 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:49:54,836 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:49:54,836 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:49:54,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:49:54,836 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:49:54,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:49:54,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:49:54,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:49:54,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:49:54,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:54,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:49:54,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:49:54,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:49:54,843 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:49:54,844 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:49:54,844 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:49:54,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:49:54,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:49:54,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:49:54,845 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 86e7865b5c88aae342720e4dde014f366638a0b48b0e0f6e55acb2c675bcac3e [2022-02-20 16:49:55,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:49:55,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:49:55,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:49:55,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:49:55,142 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:49:55,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/stateful_check.c [2022-02-20 16:49:55,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6069eb3/a1d107a809bc4081a6cca67e9cff2f21/FLAGd45b861fe [2022-02-20 16:49:55,543 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:49:55,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c [2022-02-20 16:49:55,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6069eb3/a1d107a809bc4081a6cca67e9cff2f21/FLAGd45b861fe [2022-02-20 16:49:55,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6069eb3/a1d107a809bc4081a6cca67e9cff2f21 [2022-02-20 16:49:55,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:49:55,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:49:55,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:55,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:49:55,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:49:55,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198df6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55, skipping insertion in model container [2022-02-20 16:49:55,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:49:55,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:49:55,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c[298,311] [2022-02-20 16:49:55,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:55,750 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:49:55,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/stateful_check.c[298,311] [2022-02-20 16:49:55,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:55,825 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:49:55,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55 WrapperNode [2022-02-20 16:49:55,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:55,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:55,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:49:55,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:49:55,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,862 INFO L137 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 92 [2022-02-20 16:49:55,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:55,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:49:55,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:49:55,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:49:55,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:49:55,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:49:55,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:49:55,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:49:55,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (1/1) ... [2022-02-20 16:49:55,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:49:55,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:49:55,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:49:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:49:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2022-02-20 16:49:55,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2022-02-20 16:49:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:49:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-02-20 16:49:55,963 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-02-20 16:49:55,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:49:55,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:49:56,019 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:49:56,020 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:49:56,252 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:49:56,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:49:56,258 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:49:56,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:56 BoogieIcfgContainer [2022-02-20 16:49:56,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:49:56,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:49:56,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:49:56,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:49:56,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:49:55" (1/3) ... [2022-02-20 16:49:56,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9c0fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:56, skipping insertion in model container [2022-02-20 16:49:56,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:55" (2/3) ... [2022-02-20 16:49:56,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9c0fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:56, skipping insertion in model container [2022-02-20 16:49:56,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:56" (3/3) ... [2022-02-20 16:49:56,273 INFO L111 eAbstractionObserver]: Analyzing ICFG stateful_check.c [2022-02-20 16:49:56,277 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:49:56,277 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:49:56,339 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:49:56,347 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:49:56,347 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:49:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 40 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:49:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:49:56,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:56,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:56,378 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:56,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2031565545, now seen corresponding path program 1 times [2022-02-20 16:49:56,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:56,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584828662] [2022-02-20 16:49:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:56,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:56,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:56,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:49:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:56,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:49:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:56,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:56,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ldv_mutex~0 := 1bv32;~open_called~0 := 0bv32; {48#true} is VALID [2022-02-20 16:49:56,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0bv32;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0bv32;my_init_#res#1 := 0bv32; {48#true} is VALID [2022-02-20 16:49:56,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1; {48#true} is VALID [2022-02-20 16:49:56,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {48#true} assume !true; {49#false} is VALID [2022-02-20 16:49:56,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {49#false} assume { :begin_inline_check_final_state } true; {49#false} is VALID [2022-02-20 16:49:56,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {49#false} assume !(1bv32 == ~ldv_mutex~0); {49#false} is VALID [2022-02-20 16:49:56,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {49#false} call __blast_assert(); {49#false} is VALID [2022-02-20 16:49:56,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {49#false} assume !false; {49#false} is VALID [2022-02-20 16:49:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:56,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:49:56,532 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:56,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584828662] [2022-02-20 16:49:56,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584828662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:56,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:56,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:49:56,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799734078] [2022-02-20 16:49:56,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:56,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:49:56,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:56,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:56,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:56,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:49:56,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:49:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:49:56,587 INFO L87 Difference]: Start difference. First operand has 45 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 40 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:56,676 INFO L93 Difference]: Finished difference Result 85 states and 127 transitions. [2022-02-20 16:49:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:49:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:49:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2022-02-20 16:49:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 127 transitions. [2022-02-20 16:49:56,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 127 transitions. [2022-02-20 16:49:56,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:56,833 INFO L225 Difference]: With dead ends: 85 [2022-02-20 16:49:56,834 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:49:56,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:49:56,840 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:56,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:49:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:49:56,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:56,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:56,867 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:56,867 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:56,871 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:49:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:49:56,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:56,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:56,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-02-20 16:49:56,872 INFO L87 Difference]: Start difference. First operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 39 states. [2022-02-20 16:49:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:56,875 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:49:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:49:56,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:56,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:56,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:56,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 34 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:49:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-02-20 16:49:56,885 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 8 [2022-02-20 16:49:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:56,887 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-02-20 16:49:56,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:49:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:49:56,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:56,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:56,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:57,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:57,100 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1949372176, now seen corresponding path program 1 times [2022-02-20 16:49:57,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:57,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573369135] [2022-02-20 16:49:57,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:57,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:57,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:57,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:57,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:49:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:57,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:49:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:57,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:57,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ldv_mutex~0 := 1bv32;~open_called~0 := 0bv32; {326#(= ~ldv_mutex~0 (_ bv1 32))} is VALID [2022-02-20 16:49:57,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(= ~ldv_mutex~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0bv32;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0bv32;my_init_#res#1 := 0bv32; {326#(= ~ldv_mutex~0 (_ bv1 32))} is VALID [2022-02-20 16:49:57,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#(= ~ldv_mutex~0 (_ bv1 32))} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1; {326#(= ~ldv_mutex~0 (_ bv1 32))} is VALID [2022-02-20 16:49:57,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {326#(= ~ldv_mutex~0 (_ bv1 32))} assume !(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {326#(= ~ldv_mutex~0 (_ bv1 32))} is VALID [2022-02-20 16:49:57,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#(= ~ldv_mutex~0 (_ bv1 32))} assume { :begin_inline_check_final_state } true; {326#(= ~ldv_mutex~0 (_ bv1 32))} is VALID [2022-02-20 16:49:57,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#(= ~ldv_mutex~0 (_ bv1 32))} assume !(1bv32 == ~ldv_mutex~0); {322#false} is VALID [2022-02-20 16:49:57,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {322#false} call __blast_assert(); {322#false} is VALID [2022-02-20 16:49:57,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#false} assume !false; {322#false} is VALID [2022-02-20 16:49:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:57,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:49:57,195 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:57,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573369135] [2022-02-20 16:49:57,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573369135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:57,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:57,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:49:57,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753052779] [2022-02-20 16:49:57,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:49:57,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:57,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:57,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:57,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:49:57,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:49:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:49:57,206 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,300 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-02-20 16:49:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:49:57,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:49:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 16:49:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 16:49:57,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-02-20 16:49:57,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:57,415 INFO L225 Difference]: With dead ends: 66 [2022-02-20 16:49:57,415 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 16:49:57,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:49:57,416 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:57,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 100 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 16:49:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 16:49:57,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:57,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 50 states have (on average 1.5) internal successors, (75), 53 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:57,422 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 50 states have (on average 1.5) internal successors, (75), 53 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:57,422 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 50 states have (on average 1.5) internal successors, (75), 53 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,425 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2022-02-20 16:49:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2022-02-20 16:49:57,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:57,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:57,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 50 states have (on average 1.5) internal successors, (75), 53 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 60 states. [2022-02-20 16:49:57,427 INFO L87 Difference]: Start difference. First operand has 60 states, 50 states have (on average 1.5) internal successors, (75), 53 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 60 states. [2022-02-20 16:49:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,451 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2022-02-20 16:49:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2022-02-20 16:49:57,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:57,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:57,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:57,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.5) internal successors, (75), 53 states have internal predecessors, (75), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2022-02-20 16:49:57,455 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 8 [2022-02-20 16:49:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:57,456 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2022-02-20 16:49:57,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:49:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2022-02-20 16:49:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:49:57,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:57,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:57,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:57,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:57,667 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2062694174, now seen corresponding path program 1 times [2022-02-20 16:49:57,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:57,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031789324] [2022-02-20 16:49:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:57,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:57,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:57,671 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:57,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:49:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:57,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:49:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:57,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:57,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {644#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ldv_mutex~0 := 1bv32;~open_called~0 := 0bv32; {644#true} is VALID [2022-02-20 16:49:57,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0bv32;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0bv32;my_init_#res#1 := 0bv32; {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:57,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1; {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:57,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume !!(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1;main_#t~switch8#1 := 0bv32 == main_#t~nondet7#1; {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:57,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1bv32 == main_#t~nondet7#1; {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:57,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 2bv32 == main_#t~nondet7#1; {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:57,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 3bv32 == main_#t~nondet7#1; {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:57,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume main_#t~switch8#1; {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:57,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {652#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume 3bv32 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_release } true;havoc misc_release_#res#1; {645#false} is VALID [2022-02-20 16:49:57,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {645#false} assume !(0bv32 != ~open_called~0); {645#false} is VALID [2022-02-20 16:49:57,776 INFO L272 TraceCheckUtils]: 10: Hoare triple {645#false} call mutex_lock(); {645#false} is VALID [2022-02-20 16:49:57,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {645#false} assume 1bv32 == ~ldv_mutex~0; {645#false} is VALID [2022-02-20 16:49:57,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#false} ~ldv_mutex~0 := 2bv32; {645#false} is VALID [2022-02-20 16:49:57,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {645#false} assume true; {645#false} is VALID [2022-02-20 16:49:57,777 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {645#false} {645#false} #133#return; {645#false} is VALID [2022-02-20 16:49:57,777 INFO L272 TraceCheckUtils]: 15: Hoare triple {645#false} call mutex_lock(); {645#false} is VALID [2022-02-20 16:49:57,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {645#false} assume !(1bv32 == ~ldv_mutex~0); {645#false} is VALID [2022-02-20 16:49:57,778 INFO L272 TraceCheckUtils]: 17: Hoare triple {645#false} call __blast_assert(); {645#false} is VALID [2022-02-20 16:49:57,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#false} assume !false; {645#false} is VALID [2022-02-20 16:49:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:49:57,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:49:57,781 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:57,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031789324] [2022-02-20 16:49:57,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031789324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:57,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:57,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:49:57,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867829313] [2022-02-20 16:49:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:57,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-20 16:49:57,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:57,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:57,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:57,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:49:57,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:49:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:49:57,818 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:57,948 INFO L93 Difference]: Finished difference Result 142 states and 217 transitions. [2022-02-20 16:49:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:49:57,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-20 16:49:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 16:49:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 16:49:57,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 16:49:58,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:58,060 INFO L225 Difference]: With dead ends: 142 [2022-02-20 16:49:58,060 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 16:49:58,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:49:58,061 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:58,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 16:49:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2022-02-20 16:49:58,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:58,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 82 states, 72 states have (on average 1.5) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:58,068 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 82 states, 72 states have (on average 1.5) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:58,068 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 82 states, 72 states have (on average 1.5) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:58,072 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-02-20 16:49:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2022-02-20 16:49:58,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:58,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:58,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 72 states have (on average 1.5) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 85 states. [2022-02-20 16:49:58,073 INFO L87 Difference]: Start difference. First operand has 82 states, 72 states have (on average 1.5) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 85 states. [2022-02-20 16:49:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:58,076 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2022-02-20 16:49:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2022-02-20 16:49:58,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:58,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:58,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:58,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.5) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2022-02-20 16:49:58,083 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 19 [2022-02-20 16:49:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:58,083 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2022-02-20 16:49:58,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:49:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2022-02-20 16:49:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:49:58,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:58,084 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:58,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:58,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:58,291 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2050200336, now seen corresponding path program 1 times [2022-02-20 16:49:58,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:58,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193147671] [2022-02-20 16:49:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:58,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:58,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:58,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:58,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:49:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:58,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:49:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:58,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:58,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {1177#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ldv_mutex~0 := 1bv32;~open_called~0 := 0bv32; {1177#true} is VALID [2022-02-20 16:49:58,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0bv32;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0bv32;my_init_#res#1 := 0bv32; {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:58,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1; {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:58,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume !!(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1;main_#t~switch8#1 := 0bv32 == main_#t~nondet7#1; {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:58,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume main_#t~switch8#1; {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:58,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume 0bv32 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_open } true;havoc misc_open_#res#1;havoc misc_open_#t~nondet4#1; {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:58,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} assume 0bv32 != misc_open_#t~nondet4#1;havoc misc_open_#t~nondet4#1;misc_open_#res#1 := 1bv32; {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} is VALID [2022-02-20 16:49:58,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {1185#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv0 32))} main_#t~ret9#1 := misc_open_#res#1;assume { :end_inline_misc_open } true;havoc main_#t~ret9#1;main_#t~post10#1 := main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} is VALID [2022-02-20 16:49:58,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} havoc main_#t~nondet7#1;havoc main_#t~switch8#1; {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} is VALID [2022-02-20 16:49:58,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} assume !!(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1;main_#t~switch8#1 := 0bv32 == main_#t~nondet7#1; {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} is VALID [2022-02-20 16:49:58,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1bv32 == main_#t~nondet7#1; {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} is VALID [2022-02-20 16:49:58,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 2bv32 == main_#t~nondet7#1; {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} is VALID [2022-02-20 16:49:58,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 3bv32 == main_#t~nondet7#1; {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} is VALID [2022-02-20 16:49:58,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} assume main_#t~switch8#1; {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} is VALID [2022-02-20 16:49:58,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1204#(= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32))} assume 3bv32 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_release } true;havoc misc_release_#res#1; {1178#false} is VALID [2022-02-20 16:49:58,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#false} assume !(0bv32 != ~open_called~0); {1178#false} is VALID [2022-02-20 16:49:58,417 INFO L272 TraceCheckUtils]: 16: Hoare triple {1178#false} call mutex_lock(); {1178#false} is VALID [2022-02-20 16:49:58,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#false} assume 1bv32 == ~ldv_mutex~0; {1178#false} is VALID [2022-02-20 16:49:58,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#false} ~ldv_mutex~0 := 2bv32; {1178#false} is VALID [2022-02-20 16:49:58,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#false} assume true; {1178#false} is VALID [2022-02-20 16:49:58,418 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1178#false} {1178#false} #133#return; {1178#false} is VALID [2022-02-20 16:49:58,418 INFO L272 TraceCheckUtils]: 21: Hoare triple {1178#false} call mutex_lock(); {1178#false} is VALID [2022-02-20 16:49:58,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#false} assume !(1bv32 == ~ldv_mutex~0); {1178#false} is VALID [2022-02-20 16:49:58,419 INFO L272 TraceCheckUtils]: 23: Hoare triple {1178#false} call __blast_assert(); {1178#false} is VALID [2022-02-20 16:49:58,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-02-20 16:49:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:49:58,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:58,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-02-20 16:49:58,515 INFO L272 TraceCheckUtils]: 23: Hoare triple {1178#false} call __blast_assert(); {1178#false} is VALID [2022-02-20 16:49:58,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#false} assume !(1bv32 == ~ldv_mutex~0); {1178#false} is VALID [2022-02-20 16:49:58,516 INFO L272 TraceCheckUtils]: 21: Hoare triple {1178#false} call mutex_lock(); {1178#false} is VALID [2022-02-20 16:49:58,516 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1177#true} {1178#false} #133#return; {1178#false} is VALID [2022-02-20 16:49:58,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-02-20 16:49:58,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#true} ~ldv_mutex~0 := 2bv32; {1177#true} is VALID [2022-02-20 16:49:58,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {1177#true} assume 1bv32 == ~ldv_mutex~0; {1177#true} is VALID [2022-02-20 16:49:58,516 INFO L272 TraceCheckUtils]: 16: Hoare triple {1178#false} call mutex_lock(); {1177#true} is VALID [2022-02-20 16:49:58,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#false} assume !(0bv32 != ~open_called~0); {1178#false} is VALID [2022-02-20 16:49:58,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} assume 3bv32 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_release } true;havoc misc_release_#res#1; {1178#false} is VALID [2022-02-20 16:49:58,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} assume main_#t~switch8#1; {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} is VALID [2022-02-20 16:49:58,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 3bv32 == main_#t~nondet7#1; {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} is VALID [2022-02-20 16:49:58,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 2bv32 == main_#t~nondet7#1; {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} is VALID [2022-02-20 16:49:58,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} assume !main_#t~switch8#1;main_#t~switch8#1 := main_#t~switch8#1 || 1bv32 == main_#t~nondet7#1; {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} is VALID [2022-02-20 16:49:58,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} assume !!(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1;main_#t~switch8#1 := 0bv32 == main_#t~nondet7#1; {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} is VALID [2022-02-20 16:49:58,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} havoc main_#t~nondet7#1;havoc main_#t~switch8#1; {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} is VALID [2022-02-20 16:49:58,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} main_#t~ret9#1 := misc_open_#res#1;assume { :end_inline_misc_open } true;havoc main_#t~ret9#1;main_#t~post10#1 := main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := ~bvadd32(1bv32, main_#t~post10#1);havoc main_#t~post10#1; {1286#(not (= |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv3 32)))} is VALID [2022-02-20 16:49:58,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} assume 0bv32 != misc_open_#t~nondet4#1;havoc misc_open_#t~nondet4#1;misc_open_#res#1 := 1bv32; {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 16:49:58,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} assume 0bv32 == main_~ldv_s_misc_fops_file_operations~0#1;assume { :begin_inline_misc_open } true;havoc misc_open_#res#1;havoc misc_open_#t~nondet4#1; {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 16:49:58,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} assume main_#t~switch8#1; {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 16:49:58,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} assume !!(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1;main_#t~switch8#1 := 0bv32 == main_#t~nondet7#1; {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 16:49:58,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} main_#t~ret5#1 := my_init_#res#1;assume { :end_inline_my_init } true;havoc main_#t~ret5#1; {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 16:49:58,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_#t~nondet7#1, main_#t~switch8#1, main_#t~ret9#1, main_#t~post10#1, main_#t~ret11#1, main_#t~post12#1, main_#t~ret13#1, main_#t~post14#1, main_#t~ret15#1, main_#t~nondet6#1, main_~ldv_s_misc_fops_file_operations~0#1;main_~ldv_s_misc_fops_file_operations~0#1 := 0bv32;assume { :begin_inline_my_init } true;havoc my_init_#res#1;~open_called~0 := 0bv32;my_init_#res#1 := 0bv32; {1308#(not (= (bvadd |ULTIMATE.start_main_~ldv_s_misc_fops_file_operations~0#1| (_ bv1 32)) (_ bv3 32)))} is VALID [2022-02-20 16:49:58,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {1177#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ldv_mutex~0 := 1bv32;~open_called~0 := 0bv32; {1177#true} is VALID [2022-02-20 16:49:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:49:58,524 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:58,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193147671] [2022-02-20 16:49:58,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193147671] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:49:58,535 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:49:58,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 16:49:58,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140350961] [2022-02-20 16:49:58,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:49:58,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:58,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:58,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:58,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:49:58,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:49:58,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:49:58,566 INFO L87 Difference]: Start difference. First operand 82 states and 121 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:58,824 INFO L93 Difference]: Finished difference Result 264 states and 418 transitions. [2022-02-20 16:49:58,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:49:58,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:49:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2022-02-20 16:49:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2022-02-20 16:49:58,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 221 transitions. [2022-02-20 16:49:58,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:58,969 INFO L225 Difference]: With dead ends: 264 [2022-02-20 16:49:58,969 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 16:49:58,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:49:58,970 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 149 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:58,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 172 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 16:49:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 170. [2022-02-20 16:49:58,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:58,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 170 states, 160 states have (on average 1.6) internal successors, (256), 163 states have internal predecessors, (256), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:58,981 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 170 states, 160 states have (on average 1.6) internal successors, (256), 163 states have internal predecessors, (256), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:58,982 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 170 states, 160 states have (on average 1.6) internal successors, (256), 163 states have internal predecessors, (256), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:58,988 INFO L93 Difference]: Finished difference Result 185 states and 284 transitions. [2022-02-20 16:49:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2022-02-20 16:49:58,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:58,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:58,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 160 states have (on average 1.6) internal successors, (256), 163 states have internal predecessors, (256), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 185 states. [2022-02-20 16:49:58,995 INFO L87 Difference]: Start difference. First operand has 170 states, 160 states have (on average 1.6) internal successors, (256), 163 states have internal predecessors, (256), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Second operand 185 states. [2022-02-20 16:49:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:59,003 INFO L93 Difference]: Finished difference Result 185 states and 284 transitions. [2022-02-20 16:49:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2022-02-20 16:49:59,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:59,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:59,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:59,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 160 states have (on average 1.6) internal successors, (256), 163 states have internal predecessors, (256), 8 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:49:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 269 transitions. [2022-02-20 16:49:59,011 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 269 transitions. Word has length 25 [2022-02-20 16:49:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:59,012 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 269 transitions. [2022-02-20 16:49:59,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:49:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 269 transitions. [2022-02-20 16:49:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 16:49:59,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:59,013 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:59,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:59,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:59,223 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1427332191, now seen corresponding path program 1 times [2022-02-20 16:49:59,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:59,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005805024] [2022-02-20 16:49:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:59,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:59,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:59,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:59,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:49:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:49:59,253 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:49:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:49:59,306 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 16:49:59,306 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:49:59,307 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:49:59,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:59,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:59,517 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:49:59,519 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:49:59,532 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call mutex_lock(); [2022-02-20 16:49:59,533 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:49:59,536 INFO L158 Benchmark]: Toolchain (without parser) took 3968.66ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 43.8MB in the beginning and 57.4MB in the end (delta: -13.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-02-20 16:49:59,536 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:59,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.00ms. Allocated memory is still 62.9MB. Free memory was 43.6MB in the beginning and 46.4MB in the end (delta: -2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:49:59,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.74ms. Allocated memory is still 62.9MB. Free memory was 46.1MB in the beginning and 44.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:59,537 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 62.9MB. Free memory was 44.3MB in the beginning and 43.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:59,537 INFO L158 Benchmark]: RCFGBuilder took 358.85ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 31.1MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:49:59,537 INFO L158 Benchmark]: TraceAbstraction took 3266.42ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 30.6MB in the beginning and 57.4MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:59,540 INFO L339 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.16ms. Allocated memory is still 62.9MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.00ms. Allocated memory is still 62.9MB. Free memory was 43.6MB in the beginning and 46.4MB in the end (delta: -2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.74ms. Allocated memory is still 62.9MB. Free memory was 46.1MB in the beginning and 44.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 62.9MB. Free memory was 44.3MB in the beginning and 43.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.85ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 31.1MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3266.42ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 30.6MB in the beginning and 57.4MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:49:59,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator