/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:07:39,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:07:39,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:07:39,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:07:39,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:07:39,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:07:39,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:07:39,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:07:39,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:07:39,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:07:39,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:07:39,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:07:39,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:07:39,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:07:39,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:07:39,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:07:39,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:07:39,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:07:39,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:07:39,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:07:39,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:07:39,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:07:39,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:07:39,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:07:39,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:07:39,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:07:39,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:07:39,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:07:39,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:07:39,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:07:39,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:07:39,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:07:39,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:07:39,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:07:39,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:07:39,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:07:39,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:07:39,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:07:39,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:07:39,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:07:39,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:07:39,084 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-RepeatedSemanticLbe.epf [2022-12-05 23:07:39,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:07:39,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:07:39,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:07:39,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:07:39,115 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:07:39,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:07:39,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:07:39,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:07:39,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:07:39,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:07:39,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:07:39,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:07:39,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:07:39,116 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:07:39,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:07:39,117 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:07:39,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:07:39,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:07:39,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:07:39,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:07:39,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:07:39,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:07:39,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:07:39,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:07:39,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:07:39,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:07:39,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:07:39,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:07:39,118 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 23:07:39,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:07:39,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:07:39,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:07:39,412 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:07:39,412 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:07:39,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-12-05 23:07:40,457 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:07:40,664 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:07:40,665 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-12-05 23:07:40,674 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ccaf62c3/e8117c8b084e4970b2951203351dca0b/FLAG3a2e6201d [2022-12-05 23:07:40,685 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ccaf62c3/e8117c8b084e4970b2951203351dca0b [2022-12-05 23:07:40,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:07:40,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:07:40,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:07:40,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:07:40,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:07:40,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:07:40" (1/1) ... [2022-12-05 23:07:40,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5589524f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:40, skipping insertion in model container [2022-12-05 23:07:40,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:07:40" (1/1) ... [2022-12-05 23:07:40,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:07:40,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:07:40,864 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/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-05 23:07:40,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:40,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:40,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:40,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:40,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:40,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:40,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:40,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:40,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:40,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:40,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:40,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:40,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:40,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:40,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:40,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:40,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:07:41,042 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:07:41,051 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/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-05 23:07:41,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:07:41,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:07:41,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:07:41,137 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:07:41,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41 WrapperNode [2022-12-05 23:07:41,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:07:41,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:07:41,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:07:41,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:07:41,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,195 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-12-05 23:07:41,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:07:41,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:07:41,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:07:41,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:07:41,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,225 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:07:41,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:07:41,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:07:41,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:07:41,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (1/1) ... [2022-12-05 23:07:41,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:07:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:07:41,276 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 23:07:41,302 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 23:07:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:07:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:07:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:07:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:07:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:07:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:07:41,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:07:41,324 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:07:41,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:07:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:07:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:07:41,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:07:41,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:07:41,326 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 23:07:41,485 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:07:41,487 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:07:41,653 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:07:41,743 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:07:41,743 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:07:41,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:07:41 BoogieIcfgContainer [2022-12-05 23:07:41,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:07:41,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:07:41,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:07:41,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:07:41,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:07:40" (1/3) ... [2022-12-05 23:07:41,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5422624d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:07:41, skipping insertion in model container [2022-12-05 23:07:41,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:07:41" (2/3) ... [2022-12-05 23:07:41,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5422624d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:07:41, skipping insertion in model container [2022-12-05 23:07:41,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:07:41" (3/3) ... [2022-12-05 23:07:41,750 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2022-12-05 23:07:41,762 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:07:41,762 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:07:41,762 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:07:41,796 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:07:41,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-05 23:07:41,855 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-05 23:07:41,855 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:41,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:07:41,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-05 23:07:41,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:41,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:41,875 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:41,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:41,894 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-05 23:07:41,894 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:41,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:07:41,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-05 23:07:41,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-05 23:07:45,681 INFO L203 LiptonReduction]: Total number of compositions: 69 [2022-12-05 23:07:45,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:07:45,696 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=REPEATED_LIPTON_PN, 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;@1cb04766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:07:45,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:07:45,698 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 23:07:45,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:45,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:45,699 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:07:45,699 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 23:07:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash 386920694, now seen corresponding path program 1 times [2022-12-05 23:07:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:45,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703425652] [2022-12-05 23:07:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:45,983 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 23:07:45,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:45,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703425652] [2022-12-05 23:07:45,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703425652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:45,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:45,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:07:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54134533] [2022-12-05 23:07:45,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:45,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:07:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:46,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:07:46,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:07:46,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-05 23:07:46,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 23:07:46,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:46,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-05 23:07:46,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:46,128 INFO L130 PetriNetUnfolder]: 159/366 cut-off events. [2022-12-05 23:07:46,128 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:07:46,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 366 events. 159/366 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1792 event pairs, 24 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 650. Up to 220 conditions per place. [2022-12-05 23:07:46,131 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 19 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2022-12-05 23:07:46,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 29 transitions, 114 flow [2022-12-05 23:07:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:07:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:07:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-05 23:07:46,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2022-12-05 23:07:46,141 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states and 42 transitions. [2022-12-05 23:07:46,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 29 transitions, 114 flow [2022-12-05 23:07:46,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:07:46,144 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2022-12-05 23:07:46,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-05 23:07:46,147 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-05 23:07:46,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:46,148 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 44 flow [2022-12-05 23:07:46,150 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:46,150 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:46,150 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 44 flow [2022-12-05 23:07:46,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 44 flow [2022-12-05 23:07:46,155 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:07:46,155 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:07:46,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:07:46,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 44 flow [2022-12-05 23:07:46,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-05 23:07:46,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:46,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-05 23:07:46,461 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2022-12-05 23:07:46,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 23:07:46,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:46,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:46,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:07:46,462 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 23:07:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1831313529, now seen corresponding path program 1 times [2022-12-05 23:07:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:46,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76982125] [2022-12-05 23:07:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:46,754 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 23:07:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:46,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76982125] [2022-12-05 23:07:46,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76982125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:46,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:46,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:07:46,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345930537] [2022-12-05 23:07:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:46,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:46,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:46,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:07:46,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23:07:46,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:46,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:07:46,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:46,873 INFO L130 PetriNetUnfolder]: 219/386 cut-off events. [2022-12-05 23:07:46,873 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:07:46,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 386 events. 219/386 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1364 event pairs, 65 based on Foata normal form. 25/411 useless extension candidates. Maximal degree in co-relation 793. Up to 199 conditions per place. [2022-12-05 23:07:46,882 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 24 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2022-12-05 23:07:46,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 132 flow [2022-12-05 23:07:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:07:46,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-05 23:07:46,885 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:07:46,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 132 flow [2022-12-05 23:07:46,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:07:46,886 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:46,886 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2022-12-05 23:07:46,887 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2022-12-05 23:07:46,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:46,887 INFO L89 Accepts]: Start accepts. Operand has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:46,887 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:46,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:46,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:46,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:46,900 INFO L130 PetriNetUnfolder]: 47/114 cut-off events. [2022-12-05 23:07:46,900 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-05 23:07:46,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 114 events. 47/114 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 423 event pairs, 13 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 254. Up to 73 conditions per place. [2022-12-05 23:07:46,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 90 flow [2022-12-05 23:07:46,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-05 23:07:46,930 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:46,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-05 23:07:46,931 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 94 flow [2022-12-05 23:07:46,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23:07:46,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:46,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:46,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:07:46,932 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 23:07:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1999328625, now seen corresponding path program 1 times [2022-12-05 23:07:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:46,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602563463] [2022-12-05 23:07:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:47,200 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 23:07:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:47,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602563463] [2022-12-05 23:07:47,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602563463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:47,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:47,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:07:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556629593] [2022-12-05 23:07:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:47,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:47,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:47,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:47,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:47,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:07:47,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 94 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:07:47,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:47,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:07:47,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:47,272 INFO L130 PetriNetUnfolder]: 206/363 cut-off events. [2022-12-05 23:07:47,272 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-05 23:07:47,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 363 events. 206/363 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1300 event pairs, 84 based on Foata normal form. 5/368 useless extension candidates. Maximal degree in co-relation 1036. Up to 171 conditions per place. [2022-12-05 23:07:47,274 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 27 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2022-12-05 23:07:47,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 204 flow [2022-12-05 23:07:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-05 23:07:47,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-05 23:07:47,275 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 94 flow. Second operand 4 states and 32 transitions. [2022-12-05 23:07:47,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 204 flow [2022-12-05 23:07:47,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 190 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:07:47,278 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 129 flow [2022-12-05 23:07:47,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-05 23:07:47,279 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-05 23:07:47,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:47,279 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 129 flow [2022-12-05 23:07:47,280 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:47,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:47,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 129 flow [2022-12-05 23:07:47,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 129 flow [2022-12-05 23:07:47,289 INFO L130 PetriNetUnfolder]: 40/101 cut-off events. [2022-12-05 23:07:47,289 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-05 23:07:47,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 101 events. 40/101 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 397 event pairs, 17 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 279. Up to 63 conditions per place. [2022-12-05 23:07:47,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 129 flow [2022-12-05 23:07:47,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-05 23:07:47,296 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:07:47,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 23:07:47,297 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 129 flow [2022-12-05 23:07:47,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 23:07:47,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:47,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:47,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:07:47,298 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 23:07:47,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:47,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1999241174, now seen corresponding path program 1 times [2022-12-05 23:07:47,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:47,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595779068] [2022-12-05 23:07:47,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:47,496 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 23:07:47,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:47,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595779068] [2022-12-05 23:07:47,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595779068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:47,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:47,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:07:47,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199788068] [2022-12-05 23:07:47,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:47,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:47,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:47,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:47,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:47,498 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:07:47,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 129 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 23:07:47,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:47,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:07:47,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:47,601 INFO L130 PetriNetUnfolder]: 292/522 cut-off events. [2022-12-05 23:07:47,602 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-05 23:07:47,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 522 events. 292/522 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2262 event pairs, 53 based on Foata normal form. 15/537 useless extension candidates. Maximal degree in co-relation 1675. Up to 256 conditions per place. [2022-12-05 23:07:47,603 INFO L137 encePairwiseOnDemand]: 7/18 looper letters, 25 selfloop transitions, 15 changer transitions 9/49 dead transitions. [2022-12-05 23:07:47,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 334 flow [2022-12-05 23:07:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-05 23:07:47,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:07:47,605 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 129 flow. Second operand 4 states and 40 transitions. [2022-12-05 23:07:47,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 334 flow [2022-12-05 23:07:47,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 314 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:07:47,608 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 240 flow [2022-12-05 23:07:47,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2022-12-05 23:07:47,608 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2022-12-05 23:07:47,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:47,609 INFO L89 Accepts]: Start accepts. Operand has 34 places, 33 transitions, 240 flow [2022-12-05 23:07:47,609 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:47,609 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:47,609 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions, 240 flow [2022-12-05 23:07:47,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 240 flow [2022-12-05 23:07:47,618 INFO L130 PetriNetUnfolder]: 38/94 cut-off events. [2022-12-05 23:07:47,618 INFO L131 PetriNetUnfolder]: For 78/80 co-relation queries the response was YES. [2022-12-05 23:07:47,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 94 events. 38/94 cut-off events. For 78/80 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 328 event pairs, 11 based on Foata normal form. 2/96 useless extension candidates. Maximal degree in co-relation 333. Up to 59 conditions per place. [2022-12-05 23:07:47,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 33 transitions, 240 flow [2022-12-05 23:07:47,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-05 23:07:47,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:47,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-05 23:07:47,779 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 32 transitions, 240 flow [2022-12-05 23:07:47,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 23:07:47,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:47,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:47,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:07:47,780 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 23:07:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1951260366, now seen corresponding path program 1 times [2022-12-05 23:07:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:47,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522808501] [2022-12-05 23:07:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:48,121 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 23:07:48,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:48,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522808501] [2022-12-05 23:07:48,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522808501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:48,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:48,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:07:48,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552266682] [2022-12-05 23:07:48,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:48,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:48,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:48,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:48,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-05 23:07:48,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 32 transitions, 240 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 23:07:48,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:48,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-05 23:07:48,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:48,178 INFO L130 PetriNetUnfolder]: 132/244 cut-off events. [2022-12-05 23:07:48,178 INFO L131 PetriNetUnfolder]: For 456/466 co-relation queries the response was YES. [2022-12-05 23:07:48,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 244 events. 132/244 cut-off events. For 456/466 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 887 event pairs, 30 based on Foata normal form. 11/255 useless extension candidates. Maximal degree in co-relation 938. Up to 189 conditions per place. [2022-12-05 23:07:48,180 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2022-12-05 23:07:48,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 384 flow [2022-12-05 23:07:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-05 23:07:48,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 23:07:48,181 INFO L175 Difference]: Start difference. First operand has 33 places, 32 transitions, 240 flow. Second operand 4 states and 33 transitions. [2022-12-05 23:07:48,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 384 flow [2022-12-05 23:07:48,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 377 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 23:07:48,183 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 279 flow [2022-12-05 23:07:48,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2022-12-05 23:07:48,184 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-05 23:07:48,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:48,184 INFO L89 Accepts]: Start accepts. Operand has 36 places, 35 transitions, 279 flow [2022-12-05 23:07:48,184 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:48,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:48,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 35 transitions, 279 flow [2022-12-05 23:07:48,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 35 transitions, 279 flow [2022-12-05 23:07:48,194 INFO L130 PetriNetUnfolder]: 44/105 cut-off events. [2022-12-05 23:07:48,194 INFO L131 PetriNetUnfolder]: For 146/161 co-relation queries the response was YES. [2022-12-05 23:07:48,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 105 events. 44/105 cut-off events. For 146/161 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 382 event pairs, 10 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 407. Up to 66 conditions per place. [2022-12-05 23:07:48,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 35 transitions, 279 flow [2022-12-05 23:07:48,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-05 23:07:49,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:49,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1193 [2022-12-05 23:07:49,377 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 308 flow [2022-12-05 23:07:49,377 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 23:07:49,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:49,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:49,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:07:49,377 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 23:07:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash -360223811, now seen corresponding path program 1 times [2022-12-05 23:07:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:49,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295925206] [2022-12-05 23:07:49,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:49,620 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 23:07:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:49,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295925206] [2022-12-05 23:07:49,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295925206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:49,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:49,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:07:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041087120] [2022-12-05 23:07:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:49,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:07:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:07:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:07:49,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:07:49,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23:07:49,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:49,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:07:49,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:49,707 INFO L130 PetriNetUnfolder]: 163/321 cut-off events. [2022-12-05 23:07:49,707 INFO L131 PetriNetUnfolder]: For 613/625 co-relation queries the response was YES. [2022-12-05 23:07:49,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 321 events. 163/321 cut-off events. For 613/625 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1363 event pairs, 40 based on Foata normal form. 15/336 useless extension candidates. Maximal degree in co-relation 1344. Up to 251 conditions per place. [2022-12-05 23:07:49,709 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 28 selfloop transitions, 12 changer transitions 4/47 dead transitions. [2022-12-05 23:07:49,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 455 flow [2022-12-05 23:07:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:07:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:07:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-05 23:07:49,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-05 23:07:49,710 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 308 flow. Second operand 5 states and 35 transitions. [2022-12-05 23:07:49,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 455 flow [2022-12-05 23:07:49,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:07:49,712 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 359 flow [2022-12-05 23:07:49,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-05 23:07:49,713 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2022-12-05 23:07:49,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:49,713 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 359 flow [2022-12-05 23:07:49,713 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:49,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:49,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 359 flow [2022-12-05 23:07:49,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 39 transitions, 359 flow [2022-12-05 23:07:49,725 INFO L130 PetriNetUnfolder]: 52/121 cut-off events. [2022-12-05 23:07:49,725 INFO L131 PetriNetUnfolder]: For 238/277 co-relation queries the response was YES. [2022-12-05 23:07:49,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 121 events. 52/121 cut-off events. For 238/277 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 466 event pairs, 6 based on Foata normal form. 2/123 useless extension candidates. Maximal degree in co-relation 540. Up to 78 conditions per place. [2022-12-05 23:07:49,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 39 transitions, 359 flow [2022-12-05 23:07:49,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-05 23:07:51,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:51,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1841 [2022-12-05 23:07:51,555 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 410 flow [2022-12-05 23:07:51,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23:07:51,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:51,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:51,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:07:51,555 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 23:07:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:51,555 INFO L85 PathProgramCache]: Analyzing trace with hash -361770990, now seen corresponding path program 1 times [2022-12-05 23:07:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316921407] [2022-12-05 23:07:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:51,653 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 23:07:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:51,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316921407] [2022-12-05 23:07:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316921407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:51,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:51,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:07:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427917663] [2022-12-05 23:07:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:51,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:07:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:07:51,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:07:51,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 23:07:51,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 410 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23:07:51,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:51,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 23:07:51,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:51,724 INFO L130 PetriNetUnfolder]: 71/171 cut-off events. [2022-12-05 23:07:51,725 INFO L131 PetriNetUnfolder]: For 695/764 co-relation queries the response was YES. [2022-12-05 23:07:51,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 171 events. 71/171 cut-off events. For 695/764 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 668 event pairs, 14 based on Foata normal form. 40/211 useless extension candidates. Maximal degree in co-relation 763. Up to 79 conditions per place. [2022-12-05 23:07:51,726 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 41 selfloop transitions, 4 changer transitions 1/51 dead transitions. [2022-12-05 23:07:51,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 512 flow [2022-12-05 23:07:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:07:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:07:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-05 23:07:51,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-05 23:07:51,727 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 410 flow. Second operand 4 states and 45 transitions. [2022-12-05 23:07:51,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 512 flow [2022-12-05 23:07:51,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 490 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-05 23:07:51,731 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 307 flow [2022-12-05 23:07:51,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-05 23:07:51,731 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2022-12-05 23:07:51,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:51,732 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 307 flow [2022-12-05 23:07:51,732 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:51,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:51,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 307 flow [2022-12-05 23:07:51,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 307 flow [2022-12-05 23:07:51,746 INFO L130 PetriNetUnfolder]: 25/90 cut-off events. [2022-12-05 23:07:51,746 INFO L131 PetriNetUnfolder]: For 234/267 co-relation queries the response was YES. [2022-12-05 23:07:51,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 90 events. 25/90 cut-off events. For 234/267 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 360 event pairs, 4 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 371. Up to 43 conditions per place. [2022-12-05 23:07:51,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 307 flow [2022-12-05 23:07:51,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-05 23:07:51,927 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:07:51,928 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-05 23:07:51,928 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 319 flow [2022-12-05 23:07:51,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23:07:51,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:07:51,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:07:51,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:07:51,929 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 23:07:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:07:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash -812237, now seen corresponding path program 1 times [2022-12-05 23:07:51,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:07:51,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14319043] [2022-12-05 23:07:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:07:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:07:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:07:52,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 23:07:52,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:07:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14319043] [2022-12-05 23:07:52,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14319043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:07:52,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:07:52,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:07:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663218762] [2022-12-05 23:07:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:07:52,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:07:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:07:52,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:07:52,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:07:52,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2022-12-05 23:07:52,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 23:07:52,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:07:52,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2022-12-05 23:07:52,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:07:52,129 INFO L130 PetriNetUnfolder]: 55/135 cut-off events. [2022-12-05 23:07:52,129 INFO L131 PetriNetUnfolder]: For 534/544 co-relation queries the response was YES. [2022-12-05 23:07:52,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 135 events. 55/135 cut-off events. For 534/544 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 508 event pairs, 14 based on Foata normal form. 22/157 useless extension candidates. Maximal degree in co-relation 657. Up to 64 conditions per place. [2022-12-05 23:07:52,130 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 6 changer transitions 2/41 dead transitions. [2022-12-05 23:07:52,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 420 flow [2022-12-05 23:07:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:07:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:07:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-05 23:07:52,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-05 23:07:52,132 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 319 flow. Second operand 5 states and 42 transitions. [2022-12-05 23:07:52,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 420 flow [2022-12-05 23:07:52,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 376 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 23:07:52,134 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 269 flow [2022-12-05 23:07:52,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-05 23:07:52,136 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2022-12-05 23:07:52,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:07:52,137 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 269 flow [2022-12-05 23:07:52,137 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:07:52,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:07:52,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 269 flow [2022-12-05 23:07:52,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 269 flow [2022-12-05 23:07:52,142 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2022-12-05 23:07:52,142 INFO L131 PetriNetUnfolder]: For 105/107 co-relation queries the response was YES. [2022-12-05 23:07:52,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 46 events. 11/46 cut-off events. For 105/107 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 2/48 useless extension candidates. Maximal degree in co-relation 181. Up to 20 conditions per place. [2022-12-05 23:07:52,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 269 flow [2022-12-05 23:07:52,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 24 [2022-12-05 23:07:52,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [373] L749-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P0Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [377] L803-3-->L806: Formula: (= v_~main$tmp_guard0~0_52 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_79) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_29|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_52} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet6#1, ~main$tmp_guard0~0] [2022-12-05 23:07:52,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [358] L783-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= |v_P1Thread1of1ForFork1_#res#1.base_11| 0) (= |v_P1Thread1of1ForFork1_#res#1.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] and [377] L803-3-->L806: Formula: (= v_~main$tmp_guard0~0_52 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_79) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_29|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_52} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_#t~nondet6#1, ~main$tmp_guard0~0] [2022-12-05 23:08:06,493 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:08:06,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14357 [2022-12-05 23:08:06,494 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 266 flow [2022-12-05 23:08:06,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 23:08:06,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:06,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:06,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:08:06,494 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 23:08:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash -3196990, now seen corresponding path program 1 times [2022-12-05 23:08:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:06,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286941038] [2022-12-05 23:08:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:06,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:06,993 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 23:08:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:06,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286941038] [2022-12-05 23:08:06,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286941038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:06,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:06,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690524679] [2022-12-05 23:08:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:06,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:08:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:08:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:08:06,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-05 23:08:06,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23:08:06,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:06,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-05 23:08:06,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:07,092 INFO L130 PetriNetUnfolder]: 18/58 cut-off events. [2022-12-05 23:08:07,093 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2022-12-05 23:08:07,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 58 events. 18/58 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 2 based on Foata normal form. 2/60 useless extension candidates. Maximal degree in co-relation 291. Up to 26 conditions per place. [2022-12-05 23:08:07,093 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 14 selfloop transitions, 12 changer transitions 7/35 dead transitions. [2022-12-05 23:08:07,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 373 flow [2022-12-05 23:08:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:08:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:08:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-05 23:08:07,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-05 23:08:07,094 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 266 flow. Second operand 6 states and 38 transitions. [2022-12-05 23:08:07,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 373 flow [2022-12-05 23:08:07,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 324 flow, removed 5 selfloop flow, removed 8 redundant places. [2022-12-05 23:08:07,096 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 234 flow [2022-12-05 23:08:07,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-05 23:08:07,097 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-05 23:08:07,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:07,097 INFO L89 Accepts]: Start accepts. Operand has 38 places, 26 transitions, 234 flow [2022-12-05 23:08:07,098 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:07,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:07,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 234 flow [2022-12-05 23:08:07,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 234 flow [2022-12-05 23:08:07,102 INFO L130 PetriNetUnfolder]: 8/36 cut-off events. [2022-12-05 23:08:07,102 INFO L131 PetriNetUnfolder]: For 94/104 co-relation queries the response was YES. [2022-12-05 23:08:07,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 36 events. 8/36 cut-off events. For 94/104 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 151. Up to 16 conditions per place. [2022-12-05 23:08:07,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 234 flow [2022-12-05 23:08:07,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-05 23:08:07,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L739-->L742: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [292] L776-->L783: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_31 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_98 256) 0)))) (.cse4 (and .cse1 .cse5)) (.cse3 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_83 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_98) v_~x$w_buff0_used~0_97) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_30 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_82 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_22) v_~x$r_buff1_thd2~0_21) (= v_~x~0_57 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_58))) (= v_~x$r_buff0_thd2~0_30 (ite .cse4 0 v_~x$r_buff0_thd2~0_31)) (= v_~x$w_buff1_used~0_82 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_83))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_83, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_31, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_82, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_30, ~x~0=v_~x~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:08:07,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L739-->L742: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [292] L776-->L783: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_31 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_98 256) 0)))) (.cse4 (and .cse1 .cse5)) (.cse3 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_83 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_98) v_~x$w_buff0_used~0_97) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_30 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_82 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_22) v_~x$r_buff1_thd2~0_21) (= v_~x~0_57 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_58))) (= v_~x$r_buff0_thd2~0_30 (ite .cse4 0 v_~x$r_buff0_thd2~0_31)) (= v_~x$w_buff1_used~0_82 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_83))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_83, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_31, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_82, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_30, ~x~0=v_~x~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:08:07,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [398] L739-->L783: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_139 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_540 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_179 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_541 256) 0)))) (.cse4 (and .cse5 .cse0)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_485 256) 0))))) (and (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_178 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_484 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_139) v_~x$r_buff1_thd2~0_138) (= (ite .cse2 v_~x$w_buff0~0_374 (ite .cse3 v_~x$w_buff1~0_333 1)) v_~x~0_441) (= v_~x$w_buff0_used~0_540 (ite .cse2 0 v_~x$w_buff0_used~0_541)) (= v_~x$r_buff0_thd2~0_178 (ite .cse4 0 v_~x$r_buff0_thd2~0_179)) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_485) v_~x$w_buff1_used~0_484)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_374, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_139, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_485, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_179, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_541} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_374, ~x$w_buff1~0=v_~x$w_buff1~0_333, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_138, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_484, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_178, ~x~0=v_~x~0_441, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_540} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [282] L742-->L749: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_79 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_80 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_69 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_68 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse3 v_~x$w_buff1~0_29 v_~x~0_44))) (= (ite .cse2 0 v_~x$w_buff0_used~0_80) v_~x$w_buff0_used~0_79) (= v_~x$w_buff1_used~0_68 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_69)) (= v_~x$r_buff0_thd1~0_21 (ite .cse4 0 v_~x$r_buff0_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:08:07,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [399] L739-->L783: Formula: (let ((.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_544 256)))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_143 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_183 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_545 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_489 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_376 (ite .cse1 v_~x$w_buff1~0_335 1)) v_~x~0_445) (= v_~x$w_buff0_used~0_544 (ite .cse0 0 v_~x$w_buff0_used~0_545)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_183) v_~x$r_buff0_thd2~0_182) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_489) v_~x$w_buff1_used~0_488) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd2~0_182 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_488 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_143) v_~x$r_buff1_thd2~0_142)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_376, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_143, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_489, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_183, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_545} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_376, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_142, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_488, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_182, ~x~0=v_~x~0_445, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_544} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [282] L742-->L749: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_79 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_80 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_69 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_68 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse3 v_~x$w_buff1~0_29 v_~x~0_44))) (= (ite .cse2 0 v_~x$w_buff0_used~0_80) v_~x$w_buff0_used~0_79) (= v_~x$w_buff1_used~0_68 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_69)) (= v_~x$r_buff0_thd1~0_21 (ite .cse4 0 v_~x$r_buff0_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:08:07,632 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:08:07,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 536 [2022-12-05 23:08:07,633 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 232 flow [2022-12-05 23:08:07,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23:08:07,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:07,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:07,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:08:07,634 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 23:08:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1591530832, now seen corresponding path program 1 times [2022-12-05 23:08:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:07,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807797410] [2022-12-05 23:08:07,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:07,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:08:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:07,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:08:07,701 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:08:07,702 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:08:07,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:08:07,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:08:07,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:08:07,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:08:07,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:08:07,703 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:07,708 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:08:07,708 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:08:07,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:08:07 BasicIcfg [2022-12-05 23:08:07,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:08:07,745 INFO L158 Benchmark]: Toolchain (without parser) took 27056.96ms. Allocated memory was 199.2MB in the beginning and 911.2MB in the end (delta: 712.0MB). Free memory was 174.3MB in the beginning and 401.8MB in the end (delta: -227.5MB). Peak memory consumption was 484.5MB. Max. memory is 8.0GB. [2022-12-05 23:08:07,745 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 175.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:08:07,745 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.80ms. Allocated memory is still 199.2MB. Free memory was 174.3MB in the beginning and 148.6MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 23:08:07,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.33ms. Allocated memory is still 199.2MB. Free memory was 148.6MB in the beginning and 146.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:07,746 INFO L158 Benchmark]: Boogie Preprocessor took 31.50ms. Allocated memory is still 199.2MB. Free memory was 146.0MB in the beginning and 144.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:08:07,746 INFO L158 Benchmark]: RCFGBuilder took 516.96ms. Allocated memory is still 199.2MB. Free memory was 144.4MB in the beginning and 113.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 23:08:07,746 INFO L158 Benchmark]: TraceAbstraction took 25998.15ms. Allocated memory was 199.2MB in the beginning and 911.2MB in the end (delta: 712.0MB). Free memory was 111.9MB in the beginning and 401.8MB in the end (delta: -289.9MB). Peak memory consumption was 422.7MB. Max. memory is 8.0GB. [2022-12-05 23:08:07,747 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.13ms. Allocated memory is still 199.2MB. Free memory is still 175.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.80ms. Allocated memory is still 199.2MB. Free memory was 174.3MB in the beginning and 148.6MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.33ms. Allocated memory is still 199.2MB. Free memory was 148.6MB in the beginning and 146.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.50ms. Allocated memory is still 199.2MB. Free memory was 146.0MB in the beginning and 144.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 516.96ms. Allocated memory is still 199.2MB. Free memory was 144.4MB in the beginning and 113.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 25998.15ms. Allocated memory was 199.2MB in the beginning and 911.2MB in the end (delta: 712.0MB). Free memory was 111.9MB in the beginning and 401.8MB in the end (delta: -289.9MB). Peak memory consumption was 422.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 93 PlacesBefore, 29 PlacesAfterwards, 88 TransitionsBefore, 23 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 31 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 907, independent: 861, independent conditional: 861, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 907, independent: 861, independent conditional: 0, independent unconditional: 861, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 907, independent: 861, independent conditional: 0, independent unconditional: 861, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 907, independent: 861, independent conditional: 0, independent unconditional: 861, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 692, independent: 660, independent conditional: 0, independent unconditional: 660, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 692, independent: 646, independent conditional: 0, independent unconditional: 646, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 907, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 692, unknown conditional: 0, unknown unconditional: 692] , Statistics on independence cache: Total cache size (in pairs): 1079, Positive cache size: 1047, Positive conditional cache size: 0, Positive unconditional cache size: 1047, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 25 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 58, independent conditional: 8, independent unconditional: 50, dependent: 41, dependent conditional: 4, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 58, independent conditional: 8, independent unconditional: 50, dependent: 41, dependent conditional: 4, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 58, independent conditional: 8, independent unconditional: 50, dependent: 41, dependent conditional: 4, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, independent: 44, independent conditional: 6, independent unconditional: 38, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 111, dependent conditional: 14, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 69, unknown conditional: 9, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 44, Positive conditional cache size: 6, Positive unconditional cache size: 38, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 61, independent conditional: 11, independent unconditional: 50, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 61, independent conditional: 4, independent unconditional: 57, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 61, independent conditional: 4, independent unconditional: 57, dependent: 18, dependent conditional: 6, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 12, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 51, independent conditional: 4, independent unconditional: 47, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 13, unknown conditional: 2, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 56, Positive conditional cache size: 6, Positive unconditional cache size: 50, Negative cache size: 28, Negative conditional cache size: 5, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 57, Positive conditional cache size: 6, Positive unconditional cache size: 51, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 34 PlacesBefore, 33 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 88, independent conditional: 32, independent unconditional: 56, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 88, independent conditional: 18, independent unconditional: 70, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 88, independent conditional: 18, independent unconditional: 70, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 83, independent conditional: 18, independent unconditional: 65, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 64, Positive conditional cache size: 6, Positive unconditional cache size: 58, Negative cache size: 30, Negative conditional cache size: 5, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 36 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 37 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 52, independent conditional: 16, independent unconditional: 36, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 52, independent conditional: 16, independent unconditional: 36, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 52, independent conditional: 16, independent unconditional: 36, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 50, independent conditional: 16, independent unconditional: 34, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 66, Positive conditional cache size: 6, Positive unconditional cache size: 60, Negative cache size: 30, Negative conditional cache size: 5, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 39 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 41 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 104, independent conditional: 72, independent unconditional: 32, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 104, independent conditional: 72, independent unconditional: 32, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 104, independent conditional: 72, independent unconditional: 32, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 104, independent conditional: 72, independent unconditional: 32, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 66, Positive conditional cache size: 6, Positive unconditional cache size: 60, Negative cache size: 30, Negative conditional cache size: 5, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 68, Positive conditional cache size: 7, Positive unconditional cache size: 61, Negative cache size: 31, Negative conditional cache size: 5, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.4s, 43 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 72, Positive conditional cache size: 7, Positive unconditional cache size: 65, Negative cache size: 31, Negative conditional cache size: 5, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 38 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 17, independent conditional: 2, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 2, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 14, independent conditional: 1, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 108, Positive conditional cache size: 8, Positive unconditional cache size: 100, Negative cache size: 31, Negative conditional cache size: 5, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - 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; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=-2, t1587={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] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=-1, t1587={5:0}, t1588={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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L741] 1 x = 1 [L744] 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) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 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 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 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=1, __unbuffered_p1_EBX=1, 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=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 2 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 2 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 2 !(!cond) [L807] RET 2 assume_abort_if_not(main$tmp_guard0) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 2 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 [L812] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 2 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 [L816] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 2 x$flush_delayed = weak$$choice2 [L819] 2 x$mem_tmp = x [L820] 2 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) [L821] 2 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)) [L822] 2 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)) [L823] 2 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)) [L824] 2 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)) [L825] 2 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)) [L826] 2 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)) [L827] 2 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 2 x = x$flush_delayed ? x$mem_tmp : x [L829] 2 x$flush_delayed = (_Bool)0 [L831] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=2] - 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: 803]: 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: 801]: 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, 110 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: 25.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 14 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=6, InterpolantAutomatonStates: 39, 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, 2.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 23:08:07,806 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...