/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:33:04,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:33:04,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:33:05,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:33:05,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:33:05,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:33:05,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:33:05,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:33:05,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:33:05,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:33:05,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:33:05,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:33:05,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:33:05,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:33:05,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:33:05,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:33:05,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:33:05,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:33:05,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:33:05,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:33:05,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:33:05,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:33:05,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:33:05,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:33:05,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:33:05,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:33:05,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:33:05,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:33:05,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:33:05,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:33:05,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:33:05,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:33:05,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:33:05,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:33:05,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:33:05,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:33:05,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:33:05,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:33:05,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:33:05,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:33:05,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:33:05,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:33:05,115 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:33:05,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:33:05,117 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:33:05,117 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:33:05,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:33:05,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:33:05,118 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:33:05,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:33:05,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:33:05,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:33:05,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:33:05,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:33:05,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:33:05,121 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:33:05,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:33:05,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:33:05,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:33:05,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:33:05,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:33:05,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:33:05,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:33:05,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:33:05,122 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.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:33:05,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:33:05,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:33:05,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:33:05,405 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:33:05,405 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:33:05,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011.opt.i [2022-12-12 21:33:06,376 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:33:06,637 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:33:06,638 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011.opt.i [2022-12-12 21:33:06,657 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64fce4deb/7541eb7450f64baa8ee17bb9c0317337/FLAG46ac95d62 [2022-12-12 21:33:06,675 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64fce4deb/7541eb7450f64baa8ee17bb9c0317337 [2022-12-12 21:33:06,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:33:06,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:33:06,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:33:06,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:33:06,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:33:06,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:33:06" (1/1) ... [2022-12-12 21:33:06,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8533b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:06, skipping insertion in model container [2022-12-12 21:33:06,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:33:06" (1/1) ... [2022-12-12 21:33:06,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:33:06,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:33:06,881 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011.opt.i[944,957] [2022-12-12 21:33:07,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:33:07,100 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:33:07,111 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011.opt.i[944,957] [2022-12-12 21:33:07,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:33:07,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:33:07,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:33:07,193 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:33:07,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07 WrapperNode [2022-12-12 21:33:07,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:33:07,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:33:07,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:33:07,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:33:07,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,247 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-12-12 21:33:07,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:33:07,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:33:07,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:33:07,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:33:07,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,284 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:33:07,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:33:07,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:33:07,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:33:07,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (1/1) ... [2022-12-12 21:33:07,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:33:07,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:33:07,315 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-12-12 21:33:07,321 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-12-12 21:33:07,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:33:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:33:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:33:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:33:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:33:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:33:07,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:33:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:33:07,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:33:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:33:07,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:33:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:33:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:33:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:33:07,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:33:07,345 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:33:07,496 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:33:07,498 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:33:07,752 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:33:07,859 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:33:07,859 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:33:07,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:33:07 BoogieIcfgContainer [2022-12-12 21:33:07,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:33:07,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:33:07,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:33:07,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:33:07,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:33:06" (1/3) ... [2022-12-12 21:33:07,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ab2fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:33:07, skipping insertion in model container [2022-12-12 21:33:07,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:33:07" (2/3) ... [2022-12-12 21:33:07,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ab2fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:33:07, skipping insertion in model container [2022-12-12 21:33:07,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:33:07" (3/3) ... [2022-12-12 21:33:07,867 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2022-12-12 21:33:07,882 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:33:07,882 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:33:07,883 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:33:07,956 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:33:07,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 21:33:08,038 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 21:33:08,038 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:33:08,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 21:33:08,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-12-12 21:33:08,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-12-12 21:33:08,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:33:08,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 21:33:08,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-12-12 21:33:08,102 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-12-12 21:33:08,102 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:33:08,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-12 21:33:08,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-12-12 21:33:08,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-12 21:33:12,519 INFO L241 LiptonReduction]: Total number of compositions: 88 [2022-12-12 21:33:12,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:33:12,543 INFO L357 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=false, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@31875b18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:33:12,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:33:12,551 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-12 21:33:12,552 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:33:12,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:12,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:12,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:12,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash -128517101, now seen corresponding path program 1 times [2022-12-12 21:33:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:12,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977417602] [2022-12-12 21:33:12,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:12,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977417602] [2022-12-12 21:33:12,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977417602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:12,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:12,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:33:12,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988441732] [2022-12-12 21:33:12,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:12,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:33:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:12,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:33:12,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:33:12,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 56 [2022-12-12 21:33:12,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:12,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:12,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 56 [2022-12-12 21:33:12,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:13,990 INFO L130 PetriNetUnfolder]: 8639/13567 cut-off events. [2022-12-12 21:33:13,991 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-12 21:33:14,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25926 conditions, 13567 events. 8639/13567 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 100358 event pairs, 1009 based on Foata normal form. 0/7808 useless extension candidates. Maximal degree in co-relation 25915. Up to 10631 conditions per place. [2022-12-12 21:33:14,030 INFO L137 encePairwiseOnDemand]: 52/56 looper letters, 31 selfloop transitions, 2 changer transitions 42/86 dead transitions. [2022-12-12 21:33:14,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 331 flow [2022-12-12 21:33:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:33:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:33:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-12 21:33:14,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-12 21:33:14,043 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2022-12-12 21:33:14,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 86 transitions, 331 flow [2022-12-12 21:33:14,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 163 flow [2022-12-12 21:33:14,063 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 163 flow [2022-12-12 21:33:14,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:14,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:14,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:14,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:33:14,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:14,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:14,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1049180535, now seen corresponding path program 1 times [2022-12-12 21:33:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:14,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918756986] [2022-12-12 21:33:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918756986] [2022-12-12 21:33:14,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918756986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:14,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:14,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:33:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079694593] [2022-12-12 21:33:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:14,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:33:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:33:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:33:14,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:33:14,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:14,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:14,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:33:14,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:14,811 INFO L130 PetriNetUnfolder]: 4328/6769 cut-off events. [2022-12-12 21:33:14,811 INFO L131 PetriNetUnfolder]: For 726/726 co-relation queries the response was YES. [2022-12-12 21:33:14,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18402 conditions, 6769 events. 4328/6769 cut-off events. For 726/726 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 40464 event pairs, 440 based on Foata normal form. 151/5588 useless extension candidates. Maximal degree in co-relation 18388. Up to 4429 conditions per place. [2022-12-12 21:33:14,844 INFO L137 encePairwiseOnDemand]: 47/56 looper letters, 53 selfloop transitions, 11 changer transitions 2/73 dead transitions. [2022-12-12 21:33:14,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 73 transitions, 406 flow [2022-12-12 21:33:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:33:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:33:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-12 21:33:14,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2022-12-12 21:33:14,847 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2022-12-12 21:33:14,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 73 transitions, 406 flow [2022-12-12 21:33:14,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 71 transitions, 398 flow [2022-12-12 21:33:14,872 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 71 transitions, 398 flow [2022-12-12 21:33:14,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:14,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:14,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:14,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:33:14,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1835144274, now seen corresponding path program 1 times [2022-12-12 21:33:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:14,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569343657] [2022-12-12 21:33:14,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:15,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:15,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569343657] [2022-12-12 21:33:15,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569343657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:15,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:15,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:33:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473855077] [2022-12-12 21:33:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:15,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:33:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:15,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:33:15,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:33:15,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:33:15,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 71 transitions, 398 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:15,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:15,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:33:15,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:15,461 INFO L130 PetriNetUnfolder]: 3063/4889 cut-off events. [2022-12-12 21:33:15,461 INFO L131 PetriNetUnfolder]: For 713/713 co-relation queries the response was YES. [2022-12-12 21:33:15,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18125 conditions, 4889 events. 3063/4889 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28237 event pairs, 66 based on Foata normal form. 95/4012 useless extension candidates. Maximal degree in co-relation 18108. Up to 3359 conditions per place. [2022-12-12 21:33:15,487 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 88 selfloop transitions, 8 changer transitions 3/106 dead transitions. [2022-12-12 21:33:15,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 106 transitions, 806 flow [2022-12-12 21:33:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:33:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:33:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-12 21:33:15,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2022-12-12 21:33:15,492 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -17 predicate places. [2022-12-12 21:33:15,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 106 transitions, 806 flow [2022-12-12 21:33:15,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 103 transitions, 782 flow [2022-12-12 21:33:15,512 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 103 transitions, 782 flow [2022-12-12 21:33:15,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:15,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:15,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:15,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:33:15,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:15,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1054885877, now seen corresponding path program 1 times [2022-12-12 21:33:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:15,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009578237] [2022-12-12 21:33:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:15,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:15,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009578237] [2022-12-12 21:33:15,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009578237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:15,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:15,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:33:15,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800791061] [2022-12-12 21:33:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:15,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:33:15,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:33:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:33:15,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-12 21:33:15,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 103 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:15,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:15,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-12 21:33:15,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:15,916 INFO L130 PetriNetUnfolder]: 2541/4058 cut-off events. [2022-12-12 21:33:15,916 INFO L131 PetriNetUnfolder]: For 2120/2120 co-relation queries the response was YES. [2022-12-12 21:33:15,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18296 conditions, 4058 events. 2541/4058 cut-off events. For 2120/2120 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 22491 event pairs, 99 based on Foata normal form. 40/3388 useless extension candidates. Maximal degree in co-relation 18276. Up to 2790 conditions per place. [2022-12-12 21:33:15,940 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 106 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2022-12-12 21:33:15,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 127 transitions, 1196 flow [2022-12-12 21:33:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:33:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:33:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-12 21:33:15,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3630952380952381 [2022-12-12 21:33:15,943 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -16 predicate places. [2022-12-12 21:33:15,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 127 transitions, 1196 flow [2022-12-12 21:33:15,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 127 transitions, 1196 flow [2022-12-12 21:33:15,965 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 127 transitions, 1196 flow [2022-12-12 21:33:15,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:15,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:15,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:15,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:33:15,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:15,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash -130710815, now seen corresponding path program 1 times [2022-12-12 21:33:15,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:15,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224967339] [2022-12-12 21:33:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:15,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:16,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224967339] [2022-12-12 21:33:16,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224967339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:16,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:16,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:33:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684196887] [2022-12-12 21:33:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:16,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:33:16,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:33:16,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:33:16,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2022-12-12 21:33:16,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 127 transitions, 1196 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:16,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:16,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2022-12-12 21:33:16,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:16,577 INFO L130 PetriNetUnfolder]: 3501/5408 cut-off events. [2022-12-12 21:33:16,577 INFO L131 PetriNetUnfolder]: For 8284/8373 co-relation queries the response was YES. [2022-12-12 21:33:16,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27990 conditions, 5408 events. 3501/5408 cut-off events. For 8284/8373 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 30502 event pairs, 484 based on Foata normal form. 109/4694 useless extension candidates. Maximal degree in co-relation 27967. Up to 4694 conditions per place. [2022-12-12 21:33:16,635 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 141 selfloop transitions, 48 changer transitions 0/202 dead transitions. [2022-12-12 21:33:16,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 202 transitions, 2315 flow [2022-12-12 21:33:16,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:33:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:33:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-12 21:33:16,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-12 21:33:16,638 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -14 predicate places. [2022-12-12 21:33:16,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 202 transitions, 2315 flow [2022-12-12 21:33:16,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 202 transitions, 2315 flow [2022-12-12 21:33:16,684 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 202 transitions, 2315 flow [2022-12-12 21:33:16,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:16,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:16,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:16,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:33:16,685 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 866083712, now seen corresponding path program 1 times [2022-12-12 21:33:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:16,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761588471] [2022-12-12 21:33:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:16,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:16,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761588471] [2022-12-12 21:33:16,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761588471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:16,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:16,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:33:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319307690] [2022-12-12 21:33:16,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:16,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:33:16,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:16,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:33:16,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:33:16,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2022-12-12 21:33:16,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 202 transitions, 2315 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:16,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:16,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2022-12-12 21:33:16,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:17,194 INFO L130 PetriNetUnfolder]: 1786/3126 cut-off events. [2022-12-12 21:33:17,194 INFO L131 PetriNetUnfolder]: For 6812/6990 co-relation queries the response was YES. [2022-12-12 21:33:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19068 conditions, 3126 events. 1786/3126 cut-off events. For 6812/6990 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18829 event pairs, 169 based on Foata normal form. 355/3015 useless extension candidates. Maximal degree in co-relation 19042. Up to 2644 conditions per place. [2022-12-12 21:33:17,237 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 119 selfloop transitions, 87 changer transitions 5/224 dead transitions. [2022-12-12 21:33:17,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 224 transitions, 2983 flow [2022-12-12 21:33:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:33:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:33:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-12 21:33:17,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41517857142857145 [2022-12-12 21:33:17,239 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2022-12-12 21:33:17,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 224 transitions, 2983 flow [2022-12-12 21:33:17,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 219 transitions, 2913 flow [2022-12-12 21:33:17,254 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 219 transitions, 2913 flow [2022-12-12 21:33:17,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:17,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:17,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:17,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:33:17,254 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:17,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1734620201, now seen corresponding path program 1 times [2022-12-12 21:33:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:17,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728748583] [2022-12-12 21:33:17,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:17,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:17,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728748583] [2022-12-12 21:33:17,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728748583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:17,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:17,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:33:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14273822] [2022-12-12 21:33:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:17,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:33:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:33:17,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:33:17,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2022-12-12 21:33:17,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 219 transitions, 2913 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:17,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:17,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2022-12-12 21:33:17,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:17,678 INFO L130 PetriNetUnfolder]: 1005/1841 cut-off events. [2022-12-12 21:33:17,678 INFO L131 PetriNetUnfolder]: For 6564/6722 co-relation queries the response was YES. [2022-12-12 21:33:17,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12714 conditions, 1841 events. 1005/1841 cut-off events. For 6564/6722 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10455 event pairs, 19 based on Foata normal form. 312/1850 useless extension candidates. Maximal degree in co-relation 12685. Up to 1467 conditions per place. [2022-12-12 21:33:17,691 INFO L137 encePairwiseOnDemand]: 45/56 looper letters, 93 selfloop transitions, 96 changer transitions 5/207 dead transitions. [2022-12-12 21:33:17,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 207 transitions, 3133 flow [2022-12-12 21:33:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:33:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:33:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-12 21:33:17,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3607142857142857 [2022-12-12 21:33:17,693 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2022-12-12 21:33:17,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 207 transitions, 3133 flow [2022-12-12 21:33:17,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 202 transitions, 3053 flow [2022-12-12 21:33:17,703 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 202 transitions, 3053 flow [2022-12-12 21:33:17,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:17,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:17,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:17,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:33:17,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:17,704 INFO L85 PathProgramCache]: Analyzing trace with hash 125145501, now seen corresponding path program 1 times [2022-12-12 21:33:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:17,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97533200] [2022-12-12 21:33:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:17,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:17,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97533200] [2022-12-12 21:33:17,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97533200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:17,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:17,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:33:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932445626] [2022-12-12 21:33:17,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:17,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:33:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:33:17,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:33:17,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:33:17,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 202 transitions, 3053 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:17,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:17,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:33:17,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:18,195 INFO L130 PetriNetUnfolder]: 1324/2422 cut-off events. [2022-12-12 21:33:18,196 INFO L131 PetriNetUnfolder]: For 10742/10851 co-relation queries the response was YES. [2022-12-12 21:33:18,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18310 conditions, 2422 events. 1324/2422 cut-off events. For 10742/10851 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14803 event pairs, 1 based on Foata normal form. 67/2053 useless extension candidates. Maximal degree in co-relation 18278. Up to 1977 conditions per place. [2022-12-12 21:33:18,209 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 93 selfloop transitions, 4 changer transitions 202/315 dead transitions. [2022-12-12 21:33:18,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 315 transitions, 5450 flow [2022-12-12 21:33:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:33:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:33:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-12 21:33:18,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-12 21:33:18,210 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2022-12-12 21:33:18,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 315 transitions, 5450 flow [2022-12-12 21:33:18,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 113 transitions, 1843 flow [2022-12-12 21:33:18,220 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 113 transitions, 1843 flow [2022-12-12 21:33:18,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:18,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:18,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:18,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:33:18,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1522910156, now seen corresponding path program 1 times [2022-12-12 21:33:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:18,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613924006] [2022-12-12 21:33:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:18,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:18,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613924006] [2022-12-12 21:33:18,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613924006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:18,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:18,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:33:18,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292355830] [2022-12-12 21:33:18,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:18,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:33:18,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:18,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:33:18,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:33:18,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2022-12-12 21:33:18,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 113 transitions, 1843 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:18,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:18,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2022-12-12 21:33:18,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:18,521 INFO L130 PetriNetUnfolder]: 535/1160 cut-off events. [2022-12-12 21:33:18,521 INFO L131 PetriNetUnfolder]: For 5541/5616 co-relation queries the response was YES. [2022-12-12 21:33:18,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9598 conditions, 1160 events. 535/1160 cut-off events. For 5541/5616 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 7457 event pairs, 0 based on Foata normal form. 57/985 useless extension candidates. Maximal degree in co-relation 9563. Up to 1006 conditions per place. [2022-12-12 21:33:18,527 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 60 selfloop transitions, 4 changer transitions 62/139 dead transitions. [2022-12-12 21:33:18,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 139 transitions, 2557 flow [2022-12-12 21:33:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:33:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:33:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-12 21:33:18,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3630952380952381 [2022-12-12 21:33:18,528 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2022-12-12 21:33:18,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 139 transitions, 2557 flow [2022-12-12 21:33:18,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 77 transitions, 1367 flow [2022-12-12 21:33:18,533 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 77 transitions, 1367 flow [2022-12-12 21:33:18,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:18,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:18,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:18,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:33:18,533 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:18,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2052289955, now seen corresponding path program 1 times [2022-12-12 21:33:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:18,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739427169] [2022-12-12 21:33:18,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:19,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739427169] [2022-12-12 21:33:19,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739427169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:33:19,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:33:19,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:33:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528128479] [2022-12-12 21:33:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:33:19,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 21:33:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 21:33:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 21:33:19,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-12 21:33:19,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 77 transitions, 1367 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:19,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:19,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-12 21:33:19,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:33:19,421 INFO L130 PetriNetUnfolder]: 296/680 cut-off events. [2022-12-12 21:33:19,421 INFO L131 PetriNetUnfolder]: For 3401/3422 co-relation queries the response was YES. [2022-12-12 21:33:19,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6348 conditions, 680 events. 296/680 cut-off events. For 3401/3422 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3921 event pairs, 0 based on Foata normal form. 30/564 useless extension candidates. Maximal degree in co-relation 6310. Up to 631 conditions per place. [2022-12-12 21:33:19,424 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 38 selfloop transitions, 5 changer transitions 62/118 dead transitions. [2022-12-12 21:33:19,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 118 transitions, 2395 flow [2022-12-12 21:33:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 21:33:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 21:33:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-12-12 21:33:19,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26785714285714285 [2022-12-12 21:33:19,425 INFO L295 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2022-12-12 21:33:19,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 118 transitions, 2395 flow [2022-12-12 21:33:19,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 56 transitions, 1051 flow [2022-12-12 21:33:19,427 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 1051 flow [2022-12-12 21:33:19,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:19,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:19,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:19,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:33:19,428 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:33:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:19,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1937366603, now seen corresponding path program 2 times [2022-12-12 21:33:19,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:19,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341814164] [2022-12-12 21:33:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:33:19,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:33:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:33:19,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:33:19,492 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:33:19,493 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:33:19,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:33:19,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:33:19,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:33:19,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:33:19,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:33:19,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:33:19,494 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:19,499 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:33:19,499 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:33:19,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:33:19 BasicIcfg [2022-12-12 21:33:19,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:33:19,553 INFO L158 Benchmark]: Toolchain (without parser) took 12874.02ms. Allocated memory was 184.5MB in the beginning and 629.1MB in the end (delta: 444.6MB). Free memory was 158.0MB in the beginning and 282.8MB in the end (delta: -124.8MB). Peak memory consumption was 321.1MB. Max. memory is 8.0GB. [2022-12-12 21:33:19,554 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:33:19,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.90ms. Allocated memory is still 184.5MB. Free memory was 158.0MB in the beginning and 130.5MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 21:33:19,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.16ms. Allocated memory is still 184.5MB. Free memory was 130.5MB in the beginning and 127.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 21:33:19,554 INFO L158 Benchmark]: Boogie Preprocessor took 40.84ms. Allocated memory is still 184.5MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:33:19,554 INFO L158 Benchmark]: RCFGBuilder took 572.05ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 89.1MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-12 21:33:19,555 INFO L158 Benchmark]: TraceAbstraction took 11690.28ms. Allocated memory was 184.5MB in the beginning and 629.1MB in the end (delta: 444.6MB). Free memory was 87.5MB in the beginning and 282.8MB in the end (delta: -195.3MB). Peak memory consumption was 250.9MB. Max. memory is 8.0GB. [2022-12-12 21:33:19,556 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory was 160.9MB in the beginning and 160.8MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.90ms. Allocated memory is still 184.5MB. Free memory was 158.0MB in the beginning and 130.5MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.16ms. Allocated memory is still 184.5MB. Free memory was 130.5MB in the beginning and 127.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.84ms. Allocated memory is still 184.5MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 572.05ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 89.1MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11690.28ms. Allocated memory was 184.5MB in the beginning and 629.1MB in the end (delta: 444.6MB). Free memory was 87.5MB in the beginning and 282.8MB in the end (delta: -195.3MB). Peak memory consumption was 250.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 117 PlacesBefore, 66 PlacesAfterwards, 109 TransitionsBefore, 56 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3905, independent: 3712, independent conditional: 3712, independent unconditional: 0, dependent: 193, dependent conditional: 193, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3905, independent: 3712, independent conditional: 0, independent unconditional: 3712, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3905, independent: 3712, independent conditional: 0, independent unconditional: 3712, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3905, independent: 3712, independent conditional: 0, independent unconditional: 3712, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2004, independent: 1927, independent conditional: 0, independent unconditional: 1927, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2004, independent: 1856, independent conditional: 0, independent unconditional: 1856, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 148, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 317, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3905, independent: 1785, independent conditional: 0, independent unconditional: 1785, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 2004, unknown conditional: 0, unknown unconditional: 2004] , Statistics on independence cache: Total cache size (in pairs): 3372, Positive cache size: 3295, Positive conditional cache size: 0, Positive unconditional cache size: 3295, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t284; [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t284, ((void *)0), P0, ((void *)0))=-2, t284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 pthread_t t285; [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t285, ((void *)0), P1, ((void *)0))=-1, t284={5:0}, t285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t286; [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t286, ((void *)0), P2, ((void *)0))=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L815] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L816] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L817] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L818] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L820] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L764] 2 x = 2 [L767] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284={5:0}, t285={6:0}, t286={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 692 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 10 mSDtfsCounter, 692 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3053occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 6491 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-12 21:33:19,576 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...