/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:24:22,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:24:22,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:24:22,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:24:22,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:24:22,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:24:22,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:24:22,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:24:22,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:24:22,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:24:22,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:24:22,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:24:22,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:24:22,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:24:22,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:24:22,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:24:22,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:24:22,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:24:22,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:24:22,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:24:22,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:24:22,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:24:22,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:24:22,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:24:22,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:24:22,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:24:22,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:24:22,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:24:22,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:24:22,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:24:22,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:24:22,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:24:22,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:24:22,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:24:22,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:24:22,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:24:22,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:24:22,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:24:22,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:24:22,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:24:22,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:24:22,741 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-05 20:24:22,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:24:22,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:24:22,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:24:22,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:24:22,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:24:22,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:24:22,773 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:24:22,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:24:22,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:24:22,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:24:22,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:24:22,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:24:22,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:24:22,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:24:22,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:24:22,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:24:22,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:24:22,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:24:22,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:24:22,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:24:22,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:24:22,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:24:22,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:24:22,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:24:22,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:24:22,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:24:22,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:24:22,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:24:22,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:24:22,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:24:22,777 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 [2022-12-05 20:24:23,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:24:23,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:24:23,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:24:23,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:24:23,141 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:24:23,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:24:24,334 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:24:24,611 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:24:24,611 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:24:24,624 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c714a340/dba76e40caf84f61bc7f3163a840a7e4/FLAGa2bb4ba28 [2022-12-05 20:24:24,638 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c714a340/dba76e40caf84f61bc7f3163a840a7e4 [2022-12-05 20:24:24,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:24:24,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:24:24,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:24:24,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:24:24,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:24:24,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:24:24" (1/1) ... [2022-12-05 20:24:24,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c52ec8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:24, skipping insertion in model container [2022-12-05 20:24:24,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:24:24" (1/1) ... [2022-12-05 20:24:24,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:24:24,712 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:24:24,827 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-05 20:24:24,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:24,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:24,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:24:25,020 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:24:25,034 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-05 20:24:25,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:25,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:25,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:24:25,124 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:24:25,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25 WrapperNode [2022-12-05 20:24:25,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:24:25,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:24:25,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:24:25,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:24:25,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,182 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-05 20:24:25,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:24:25,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:24:25,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:24:25,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:24:25,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:24:25,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:24:25,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:24:25,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:24:25,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (1/1) ... [2022-12-05 20:24:25,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:24:25,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:24:25,270 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-05 20:24:25,276 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-05 20:24:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:24:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:24:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:24:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:24:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:24:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:24:25,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:24:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:24:25,312 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:24:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:24:25,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:24:25,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:24:25,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:24:25,314 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:24:25,492 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:24:25,494 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:24:25,809 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:24:25,922 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:24:25,923 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:24:25,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:24:25 BoogieIcfgContainer [2022-12-05 20:24:25,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:24:25,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:24:25,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:24:25,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:24:25,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:24:24" (1/3) ... [2022-12-05 20:24:25,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8e122d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:24:25, skipping insertion in model container [2022-12-05 20:24:25,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:25" (2/3) ... [2022-12-05 20:24:25,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8e122d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:24:25, skipping insertion in model container [2022-12-05 20:24:25,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:24:25" (3/3) ... [2022-12-05 20:24:25,936 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:24:25,953 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:24:25,953 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:24:25,953 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:24:25,998 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:24:26,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-05 20:24:26,109 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-05 20:24:26,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:26,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 20:24:26,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-05 20:24:26,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-05 20:24:26,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:24:26,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-05 20:24:26,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-05 20:24:26,210 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-05 20:24:26,210 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:26,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 20:24:26,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-05 20:24:26,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-05 20:24:30,509 INFO L203 LiptonReduction]: Total number of compositions: 68 [2022-12-05 20:24:30,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:24:30,527 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;@4922f469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:24:30,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 20:24:30,530 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 20:24:30,530 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:30,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:30,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:24:30,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:30,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 374744491, now seen corresponding path program 1 times [2022-12-05 20:24:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:30,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875344912] [2022-12-05 20:24:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:30,945 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-05 20:24:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:30,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875344912] [2022-12-05 20:24:30,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875344912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:30,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:30,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:24:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764600980] [2022-12-05 20:24:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:30,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:30,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:30,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 20:24:30,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 20:24:30,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:30,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 20:24:30,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:31,100 INFO L130 PetriNetUnfolder]: 159/309 cut-off events. [2022-12-05 20:24:31,101 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 20:24:31,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 309 events. 159/309 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1365 event pairs, 24 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 593. Up to 220 conditions per place. [2022-12-05 20:24:31,104 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 19 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2022-12-05 20:24:31,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 27 transitions, 110 flow [2022-12-05 20:24:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 20:24:31,114 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 20:24:31,116 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 36 transitions. [2022-12-05 20:24:31,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 27 transitions, 110 flow [2022-12-05 20:24:31,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:31,120 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-05 20:24:31,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-05 20:24:31,124 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 20:24:31,125 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2022-12-05 20:24:31,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-05 20:24:31,125 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:31,125 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:31,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:24:31,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:31,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1394833564, now seen corresponding path program 1 times [2022-12-05 20:24:31,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:31,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967055018] [2022-12-05 20:24:31,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:31,745 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-05 20:24:31,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:31,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967055018] [2022-12-05 20:24:31,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967055018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:31,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:31,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127449345] [2022-12-05 20:24:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:31,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:31,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:31,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:31,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 20:24:31,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-05 20:24:31,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:31,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 20:24:31,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:31,936 INFO L130 PetriNetUnfolder]: 186/337 cut-off events. [2022-12-05 20:24:31,937 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 20:24:31,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 337 events. 186/337 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1232 event pairs, 46 based on Foata normal form. 25/362 useless extension candidates. Maximal degree in co-relation 700. Up to 251 conditions per place. [2022-12-05 20:24:31,946 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 20 selfloop transitions, 2 changer transitions 13/35 dead transitions. [2022-12-05 20:24:31,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 35 transitions, 150 flow [2022-12-05 20:24:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-05 20:24:31,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-05 20:24:31,948 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 37 transitions. [2022-12-05 20:24:31,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 35 transitions, 150 flow [2022-12-05 20:24:31,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 35 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:31,950 INFO L231 Difference]: Finished difference. Result has 28 places, 16 transitions, 48 flow [2022-12-05 20:24:31,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=48, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2022-12-05 20:24:31,951 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-05 20:24:31,951 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 48 flow [2022-12-05 20:24:31,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-05 20:24:31,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:31,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:31,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:24:31,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash 290158114, now seen corresponding path program 1 times [2022-12-05 20:24:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:31,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266661497] [2022-12-05 20:24:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:32,334 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-05 20:24:32,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:32,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266661497] [2022-12-05 20:24:32,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266661497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:32,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:32,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:32,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208150653] [2022-12-05 20:24:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:32,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:32,340 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 20:24:32,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 16 transitions, 48 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-05 20:24:32,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:32,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 20:24:32,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:32,486 INFO L130 PetriNetUnfolder]: 127/254 cut-off events. [2022-12-05 20:24:32,486 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-05 20:24:32,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 254 events. 127/254 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 957 event pairs, 53 based on Foata normal form. 15/269 useless extension candidates. Maximal degree in co-relation 570. Up to 188 conditions per place. [2022-12-05 20:24:32,489 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 22 selfloop transitions, 5 changer transitions 10/38 dead transitions. [2022-12-05 20:24:32,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 173 flow [2022-12-05 20:24:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-05 20:24:32,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-05 20:24:32,492 INFO L175 Difference]: Start difference. First operand has 28 places, 16 transitions, 48 flow. Second operand 6 states and 45 transitions. [2022-12-05 20:24:32,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 173 flow [2022-12-05 20:24:32,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 38 transitions, 163 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-05 20:24:32,495 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 79 flow [2022-12-05 20:24:32,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=79, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-05 20:24:32,496 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2022-12-05 20:24:32,496 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 79 flow [2022-12-05 20:24:32,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-05 20:24:32,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:32,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:24:32,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash 756419430, now seen corresponding path program 1 times [2022-12-05 20:24:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:32,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112730779] [2022-12-05 20:24:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:32,834 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-05 20:24:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:32,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112730779] [2022-12-05 20:24:32,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112730779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:32,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:32,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635795009] [2022-12-05 20:24:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:32,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:32,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:32,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:32,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:32,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 20:24:32,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 79 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-05 20:24:32,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:32,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 20:24:32,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:32,975 INFO L130 PetriNetUnfolder]: 128/253 cut-off events. [2022-12-05 20:24:32,975 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-05 20:24:32,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 253 events. 128/253 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 938 event pairs, 30 based on Foata normal form. 9/262 useless extension candidates. Maximal degree in co-relation 669. Up to 179 conditions per place. [2022-12-05 20:24:32,977 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 24 selfloop transitions, 10 changer transitions 5/40 dead transitions. [2022-12-05 20:24:32,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 214 flow [2022-12-05 20:24:32,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-12-05 20:24:32,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3412698412698413 [2022-12-05 20:24:32,978 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 79 flow. Second operand 6 states and 43 transitions. [2022-12-05 20:24:32,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 214 flow [2022-12-05 20:24:32,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 212 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:32,980 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 138 flow [2022-12-05 20:24:32,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-05 20:24:32,981 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2022-12-05 20:24:32,981 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 138 flow [2022-12-05 20:24:32,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-05 20:24:32,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:32,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:32,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:24:32,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash 728829120, now seen corresponding path program 2 times [2022-12-05 20:24:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:32,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311028133] [2022-12-05 20:24:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:32,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:33,394 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-05 20:24:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311028133] [2022-12-05 20:24:33,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311028133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:33,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:33,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199908520] [2022-12-05 20:24:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:33,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:33,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 20:24:33,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 138 flow. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-05 20:24:33,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:33,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 20:24:33,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:33,632 INFO L130 PetriNetUnfolder]: 187/338 cut-off events. [2022-12-05 20:24:33,632 INFO L131 PetriNetUnfolder]: For 401/401 co-relation queries the response was YES. [2022-12-05 20:24:33,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 338 events. 187/338 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1203 event pairs, 64 based on Foata normal form. 12/350 useless extension candidates. Maximal degree in co-relation 1120. Up to 250 conditions per place. [2022-12-05 20:24:33,635 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 31 selfloop transitions, 24 changer transitions 9/64 dead transitions. [2022-12-05 20:24:33,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 444 flow [2022-12-05 20:24:33,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:24:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:24:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-12-05 20:24:33,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-05 20:24:33,637 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 138 flow. Second operand 9 states and 56 transitions. [2022-12-05 20:24:33,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 444 flow [2022-12-05 20:24:33,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 425 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:33,641 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 308 flow [2022-12-05 20:24:33,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-05 20:24:33,642 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2022-12-05 20:24:33,642 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 308 flow [2022-12-05 20:24:33,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-05 20:24:33,642 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:33,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:33,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:24:33,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash 728713800, now seen corresponding path program 3 times [2022-12-05 20:24:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:33,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085420567] [2022-12-05 20:24:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:34,069 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-05 20:24:34,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:34,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085420567] [2022-12-05 20:24:34,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085420567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:34,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:34,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468564801] [2022-12-05 20:24:34,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:34,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:34,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:34,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:34,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 20:24:34,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-05 20:24:34,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:34,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 20:24:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:34,230 INFO L130 PetriNetUnfolder]: 166/315 cut-off events. [2022-12-05 20:24:34,231 INFO L131 PetriNetUnfolder]: For 847/847 co-relation queries the response was YES. [2022-12-05 20:24:34,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 315 events. 166/315 cut-off events. For 847/847 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1212 event pairs, 47 based on Foata normal form. 9/324 useless extension candidates. Maximal degree in co-relation 1301. Up to 238 conditions per place. [2022-12-05 20:24:34,234 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 35 selfloop transitions, 16 changer transitions 5/59 dead transitions. [2022-12-05 20:24:34,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 519 flow [2022-12-05 20:24:34,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-05 20:24:34,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-05 20:24:34,236 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 308 flow. Second operand 6 states and 42 transitions. [2022-12-05 20:24:34,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 519 flow [2022-12-05 20:24:34,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 472 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-05 20:24:34,241 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 349 flow [2022-12-05 20:24:34,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-05 20:24:34,242 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2022-12-05 20:24:34,242 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 349 flow [2022-12-05 20:24:34,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-05 20:24:34,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:34,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:34,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:24:34,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash 757428480, now seen corresponding path program 4 times [2022-12-05 20:24:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:34,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019597196] [2022-12-05 20:24:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:34,661 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-05 20:24:34,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:34,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019597196] [2022-12-05 20:24:34,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019597196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:34,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:34,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763826471] [2022-12-05 20:24:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:34,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:34,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:34,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:34,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 20:24:34,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-05 20:24:34,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:34,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 20:24:34,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:34,919 INFO L130 PetriNetUnfolder]: 164/316 cut-off events. [2022-12-05 20:24:34,920 INFO L131 PetriNetUnfolder]: For 980/980 co-relation queries the response was YES. [2022-12-05 20:24:34,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 316 events. 164/316 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1226 event pairs, 39 based on Foata normal form. 14/330 useless extension candidates. Maximal degree in co-relation 1301. Up to 199 conditions per place. [2022-12-05 20:24:34,923 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 38 selfloop transitions, 17 changer transitions 5/63 dead transitions. [2022-12-05 20:24:34,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 576 flow [2022-12-05 20:24:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:24:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:24:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-05 20:24:34,925 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29931972789115646 [2022-12-05 20:24:34,925 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 349 flow. Second operand 7 states and 44 transitions. [2022-12-05 20:24:34,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 576 flow [2022-12-05 20:24:34,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 564 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-05 20:24:34,930 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 441 flow [2022-12-05 20:24:34,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=441, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2022-12-05 20:24:34,931 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2022-12-05 20:24:34,931 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 441 flow [2022-12-05 20:24:34,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-05 20:24:34,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:34,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:34,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:24:34,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash -242424679, now seen corresponding path program 1 times [2022-12-05 20:24:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:34,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57566919] [2022-12-05 20:24:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:35,043 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-05 20:24:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:35,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57566919] [2022-12-05 20:24:35,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57566919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:35,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:35,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106483876] [2022-12-05 20:24:35,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:35,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:35,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:35,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 20:24:35,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 441 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-05 20:24:35,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:35,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 20:24:35,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:35,136 INFO L130 PetriNetUnfolder]: 74/168 cut-off events. [2022-12-05 20:24:35,136 INFO L131 PetriNetUnfolder]: For 825/840 co-relation queries the response was YES. [2022-12-05 20:24:35,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 168 events. 74/168 cut-off events. For 825/840 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 615 event pairs, 14 based on Foata normal form. 43/210 useless extension candidates. Maximal degree in co-relation 755. Up to 81 conditions per place. [2022-12-05 20:24:35,138 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 33 selfloop transitions, 4 changer transitions 23/67 dead transitions. [2022-12-05 20:24:35,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 680 flow [2022-12-05 20:24:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-05 20:24:35,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2022-12-05 20:24:35,139 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 441 flow. Second operand 5 states and 47 transitions. [2022-12-05 20:24:35,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 680 flow [2022-12-05 20:24:35,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 585 flow, removed 23 selfloop flow, removed 8 redundant places. [2022-12-05 20:24:35,143 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 268 flow [2022-12-05 20:24:35,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2022-12-05 20:24:35,144 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2022-12-05 20:24:35,144 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 268 flow [2022-12-05 20:24:35,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-05 20:24:35,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:35,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:35,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:24:35,145 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash 112244162, now seen corresponding path program 1 times [2022-12-05 20:24:35,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:35,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86961643] [2022-12-05 20:24:35,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:35,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:35,258 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-05 20:24:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:35,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86961643] [2022-12-05 20:24:35,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86961643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:35,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:35,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281533116] [2022-12-05 20:24:35,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:35,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:35,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:35,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:35,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:35,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 20:24:35,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-05 20:24:35,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:35,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 20:24:35,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:35,349 INFO L130 PetriNetUnfolder]: 45/106 cut-off events. [2022-12-05 20:24:35,350 INFO L131 PetriNetUnfolder]: For 328/338 co-relation queries the response was YES. [2022-12-05 20:24:35,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 106 events. 45/106 cut-off events. For 328/338 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 339 event pairs, 6 based on Foata normal form. 19/124 useless extension candidates. Maximal degree in co-relation 480. Up to 33 conditions per place. [2022-12-05 20:24:35,351 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 29 selfloop transitions, 6 changer transitions 19/61 dead transitions. [2022-12-05 20:24:35,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 573 flow [2022-12-05 20:24:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:24:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:24:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-12-05 20:24:35,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3401360544217687 [2022-12-05 20:24:35,357 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 268 flow. Second operand 7 states and 50 transitions. [2022-12-05 20:24:35,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 573 flow [2022-12-05 20:24:35,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 507 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-12-05 20:24:35,360 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 235 flow [2022-12-05 20:24:35,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2022-12-05 20:24:35,361 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2022-12-05 20:24:35,361 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 235 flow [2022-12-05 20:24:35,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-05 20:24:35,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:35,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:35,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:24:35,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1994447622, now seen corresponding path program 1 times [2022-12-05 20:24:35,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:35,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724736818] [2022-12-05 20:24:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:35,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:35,829 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-05 20:24:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:35,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724736818] [2022-12-05 20:24:35,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724736818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:35,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:35,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 20:24:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341977727] [2022-12-05 20:24:35,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:35,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:24:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:24:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:24:35,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 20:24:35,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 235 flow. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-05 20:24:35,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:35,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 20:24:35,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:36,123 INFO L130 PetriNetUnfolder]: 70/157 cut-off events. [2022-12-05 20:24:36,123 INFO L131 PetriNetUnfolder]: For 450/450 co-relation queries the response was YES. [2022-12-05 20:24:36,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 157 events. 70/157 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 528 event pairs, 1 based on Foata normal form. 1/158 useless extension candidates. Maximal degree in co-relation 719. Up to 64 conditions per place. [2022-12-05 20:24:36,124 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 21 selfloop transitions, 3 changer transitions 39/63 dead transitions. [2022-12-05 20:24:36,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 564 flow [2022-12-05 20:24:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:24:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:24:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-12-05 20:24:36,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-05 20:24:36,126 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 235 flow. Second operand 8 states and 42 transitions. [2022-12-05 20:24:36,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 564 flow [2022-12-05 20:24:36,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 492 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-05 20:24:36,130 INFO L231 Difference]: Finished difference. Result has 55 places, 22 transitions, 134 flow [2022-12-05 20:24:36,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=134, PETRI_PLACES=55, PETRI_TRANSITIONS=22} [2022-12-05 20:24:36,130 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2022-12-05 20:24:36,130 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 22 transitions, 134 flow [2022-12-05 20:24:36,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-05 20:24:36,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:36,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:36,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:24:36,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1756395878, now seen corresponding path program 2 times [2022-12-05 20:24:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:36,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416719432] [2022-12-05 20:24:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:37,069 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-05 20:24:37,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:37,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416719432] [2022-12-05 20:24:37,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416719432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:37,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:37,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 20:24:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964133748] [2022-12-05 20:24:37,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:37,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:24:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:24:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:24:37,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 20:24:37,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 22 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-05 20:24:37,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:37,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 20:24:37,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:37,243 INFO L130 PetriNetUnfolder]: 9/43 cut-off events. [2022-12-05 20:24:37,244 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-05 20:24:37,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 43 events. 9/43 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 171. Up to 20 conditions per place. [2022-12-05 20:24:37,244 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 15 selfloop transitions, 5 changer transitions 11/32 dead transitions. [2022-12-05 20:24:37,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 32 transitions, 249 flow [2022-12-05 20:24:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:24:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:24:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-12-05 20:24:37,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2022-12-05 20:24:37,246 INFO L175 Difference]: Start difference. First operand has 55 places, 22 transitions, 134 flow. Second operand 8 states and 35 transitions. [2022-12-05 20:24:37,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 32 transitions, 249 flow [2022-12-05 20:24:37,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 206 flow, removed 9 selfloop flow, removed 12 redundant places. [2022-12-05 20:24:37,247 INFO L231 Difference]: Finished difference. Result has 43 places, 20 transitions, 102 flow [2022-12-05 20:24:37,248 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=20} [2022-12-05 20:24:37,248 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2022-12-05 20:24:37,248 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 20 transitions, 102 flow [2022-12-05 20:24:37,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-05 20:24:37,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:37,249 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:24:37,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -373290748, now seen corresponding path program 3 times [2022-12-05 20:24:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:37,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552800157] [2022-12-05 20:24:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:24:37,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:24:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:24:37,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:24:37,333 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:24:37,334 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 20:24:37,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 20:24:37,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 20:24:37,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 20:24:37,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 20:24:37,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:24:37,339 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2022-12-05 20:24:37,345 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:24:37,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:24:37,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:24:37 BasicIcfg [2022-12-05 20:24:37,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:24:37,405 INFO L158 Benchmark]: Toolchain (without parser) took 12762.55ms. Allocated memory was 194.0MB in the beginning and 429.9MB in the end (delta: 235.9MB). Free memory was 168.5MB in the beginning and 280.3MB in the end (delta: -111.8MB). Peak memory consumption was 125.4MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,405 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 194.0MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:24:37,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.24ms. Allocated memory is still 194.0MB. Free memory was 168.2MB in the beginning and 143.5MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.06ms. Allocated memory is still 194.0MB. Free memory was 143.5MB in the beginning and 140.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,405 INFO L158 Benchmark]: Boogie Preprocessor took 55.72ms. Allocated memory is still 194.0MB. Free memory was 140.9MB in the beginning and 139.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,405 INFO L158 Benchmark]: RCFGBuilder took 690.18ms. Allocated memory is still 194.0MB. Free memory was 138.9MB in the beginning and 107.9MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,406 INFO L158 Benchmark]: TraceAbstraction took 11472.83ms. Allocated memory was 194.0MB in the beginning and 429.9MB in the end (delta: 235.9MB). Free memory was 106.9MB in the beginning and 280.3MB in the end (delta: -173.5MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. [2022-12-05 20:24:37,407 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.18ms. Allocated memory is still 194.0MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.24ms. Allocated memory is still 194.0MB. Free memory was 168.2MB in the beginning and 143.5MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.06ms. Allocated memory is still 194.0MB. Free memory was 143.5MB in the beginning and 140.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.72ms. Allocated memory is still 194.0MB. Free memory was 140.9MB in the beginning and 139.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 690.18ms. Allocated memory is still 194.0MB. Free memory was 138.9MB in the beginning and 107.9MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11472.83ms. Allocated memory was 194.0MB in the beginning and 429.9MB in the end (delta: 235.9MB). Free memory was 106.9MB in the beginning and 280.3MB in the end (delta: -173.5MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 90 PlacesBefore, 27 PlacesAfterwards, 85 TransitionsBefore, 21 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 31 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 796, independent: 754, independent conditional: 754, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 796, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 796, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 796, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 632, independent: 606, independent conditional: 0, independent unconditional: 606, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 632, independent: 587, independent conditional: 0, independent unconditional: 587, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 796, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 632, unknown conditional: 0, unknown unconditional: 632] , Statistics on independence cache: Total cache size (in pairs): 900, Positive cache size: 874, Positive conditional cache size: 0, Positive unconditional cache size: 874, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] 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=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 793]: 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: 795]: 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 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1022 IncrementalHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 19 mSDtfsCounter, 1022 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 1357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-05 20:24:37,435 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...