/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 00:16:07,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 00:16:07,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 00:16:07,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 00:16:07,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 00:16:07,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 00:16:07,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 00:16:08,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 00:16:08,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 00:16:08,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 00:16:08,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 00:16:08,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 00:16:08,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 00:16:08,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 00:16:08,016 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 00:16:08,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 00:16:08,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 00:16:08,017 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 00:16:08,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 00:16:08,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 00:16:08,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 00:16:08,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 00:16:08,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 00:16:08,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 00:16:08,018 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 00:16:08,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 00:16:08,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 00:16:08,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 00:16:08,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 00:16:08,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 00:16:08,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:16:08,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 00:16:08,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 00:16:08,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 00:16:08,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 00:16:08,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 00:16:08,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 00:16:08,022 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 00:16:08,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 00:16:08,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 00:16:08,023 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 00:16:08,023 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 00:16:08,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 00:16:08,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 00:16:08,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 00:16:08,255 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 00:16:08,256 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 00:16:08,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt_bound2.i [2023-08-04 00:16:09,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 00:16:09,547 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 00:16:09,548 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt_bound2.i [2023-08-04 00:16:09,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1c621ea/20fec67e80e04dfc9892ca61017414ce/FLAG787ffc0f5 [2023-08-04 00:16:09,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1c621ea/20fec67e80e04dfc9892ca61017414ce [2023-08-04 00:16:09,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 00:16:09,583 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 00:16:09,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 00:16:09,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 00:16:09,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 00:16:09,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:16:09" (1/1) ... [2023-08-04 00:16:09,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479cf9de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:09, skipping insertion in model container [2023-08-04 00:16:09,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:16:09" (1/1) ... [2023-08-04 00:16:09,654 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 00:16:09,769 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt_bound2.i[1026,1039] [2023-08-04 00:16:09,913 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:16:09,922 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 00:16:09,932 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt_bound2.i[1026,1039] [2023-08-04 00:16:09,944 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 00:16:09,946 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 00:16:09,990 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:16:10,017 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:16:10,018 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:16:10,023 INFO L206 MainTranslator]: Completed translation [2023-08-04 00:16:10,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10 WrapperNode [2023-08-04 00:16:10,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 00:16:10,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 00:16:10,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 00:16:10,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 00:16:10,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,074 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 162 [2023-08-04 00:16:10,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 00:16:10,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 00:16:10,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 00:16:10,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 00:16:10,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,095 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 00:16:10,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 00:16:10,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 00:16:10,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 00:16:10,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (1/1) ... [2023-08-04 00:16:10,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:16:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:16:10,150 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) [2023-08-04 00:16:10,182 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 [2023-08-04 00:16:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 00:16:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 00:16:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 00:16:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 00:16:10,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 00:16:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 00:16:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 00:16:10,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 00:16:10,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 00:16:10,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 00:16:10,200 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 00:16:10,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 00:16:10,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 00:16:10,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 00:16:10,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 00:16:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 00:16:10,232 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 00:16:10,371 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 00:16:10,372 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 00:16:10,714 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 00:16:10,890 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 00:16:10,891 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 00:16:10,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:16:10 BoogieIcfgContainer [2023-08-04 00:16:10,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 00:16:10,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 00:16:10,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 00:16:10,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 00:16:10,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 12:16:09" (1/3) ... [2023-08-04 00:16:10,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cdb219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:16:10, skipping insertion in model container [2023-08-04 00:16:10,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:16:10" (2/3) ... [2023-08-04 00:16:10,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cdb219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:16:10, skipping insertion in model container [2023-08-04 00:16:10,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:16:10" (3/3) ... [2023-08-04 00:16:10,902 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt_bound2.i [2023-08-04 00:16:10,910 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 00:16:10,918 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 00:16:10,918 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 00:16:10,918 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 00:16:10,977 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:16:11,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 307 flow [2023-08-04 00:16:11,188 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-04 00:16:11,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:16:11,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 464 events. 30/464 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1949 event pairs, 0 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 285. Up to 16 conditions per place. [2023-08-04 00:16:11,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 146 transitions, 307 flow [2023-08-04 00:16:11,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 117 transitions, 249 flow [2023-08-04 00:16:11,203 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:16:11,219 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 117 transitions, 249 flow [2023-08-04 00:16:11,223 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 117 transitions, 249 flow [2023-08-04 00:16:11,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 117 transitions, 249 flow [2023-08-04 00:16:11,264 INFO L124 PetriNetUnfolderBase]: 6/232 cut-off events. [2023-08-04 00:16:11,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:16:11,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 232 events. 6/232 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 629 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 169. Up to 8 conditions per place. [2023-08-04 00:16:11,268 INFO L119 LiptonReduction]: Number of co-enabled transitions 1160 [2023-08-04 00:16:15,902 INFO L134 LiptonReduction]: Checked pairs total: 3174 [2023-08-04 00:16:15,903 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-04 00:16:15,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:16:15,917 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f0e8958, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:16:15,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 00:16:15,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:16:15,922 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-08-04 00:16:15,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:16:15,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:15,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 00:16:15,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:15,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1412165009, now seen corresponding path program 1 times [2023-08-04 00:16:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200385330] [2023-08-04 00:16:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:16:16,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:16,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200385330] [2023-08-04 00:16:16,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200385330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:16:16,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:16:16,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:16:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396631130] [2023-08-04 00:16:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:16:16,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:16:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:16,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:16:16,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:16:16,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 244 [2023-08-04 00:16:16,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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) [2023-08-04 00:16:16,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:16,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 244 [2023-08-04 00:16:16,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:16,322 INFO L124 PetriNetUnfolderBase]: 200/409 cut-off events. [2023-08-04 00:16:16,323 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 00:16:16,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 409 events. 200/409 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1882 event pairs, 150 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 798. Up to 348 conditions per place. [2023-08-04 00:16:16,329 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 19 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-04 00:16:16,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 111 flow [2023-08-04 00:16:16,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:16:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:16:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-04 00:16:16,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5587431693989071 [2023-08-04 00:16:16,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-04 00:16:16,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-04 00:16:16,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:16,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-04 00:16:16,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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) [2023-08-04 00:16:16,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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) [2023-08-04 00:16:16,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 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) [2023-08-04 00:16:16,367 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 63 flow. Second operand 3 states and 409 transitions. [2023-08-04 00:16:16,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 111 flow [2023-08-04 00:16:16,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 111 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:16:16,372 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 71 flow [2023-08-04 00:16:16,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-04 00:16:16,378 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-04 00:16:16,378 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 71 flow [2023-08-04 00:16:16,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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) [2023-08-04 00:16:16,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:16,379 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 00:16:16,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 00:16:16,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:16,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1420158512, now seen corresponding path program 1 times [2023-08-04 00:16:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687356753] [2023-08-04 00:16:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:16:16,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:16:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:16:16,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:16:16,463 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:16:16,464 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 00:16:16,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 00:16:16,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 00:16:16,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 00:16:16,466 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 00:16:16,468 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-04 00:16:16,473 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 00:16:16,474 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 00:16:16,512 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:16:16,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 372 flow [2023-08-04 00:16:16,675 INFO L124 PetriNetUnfolderBase]: 93/1387 cut-off events. [2023-08-04 00:16:16,675 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:16:16,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 1387 events. 93/1387 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9385 event pairs, 0 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 1010. Up to 54 conditions per place. [2023-08-04 00:16:16,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 168 transitions, 372 flow [2023-08-04 00:16:16,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 314 flow [2023-08-04 00:16:16,684 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:16:16,684 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 314 flow [2023-08-04 00:16:16,684 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 314 flow [2023-08-04 00:16:16,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 314 flow [2023-08-04 00:16:16,743 INFO L124 PetriNetUnfolderBase]: 12/604 cut-off events. [2023-08-04 00:16:16,743 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:16:16,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 604 events. 12/604 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2961 event pairs, 0 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 488. Up to 27 conditions per place. [2023-08-04 00:16:16,752 INFO L119 LiptonReduction]: Number of co-enabled transitions 3152 [2023-08-04 00:16:21,580 INFO L134 LiptonReduction]: Checked pairs total: 9413 [2023-08-04 00:16:21,581 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-04 00:16:21,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:16:21,584 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f0e8958, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:16:21,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 00:16:21,591 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:16:21,591 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2023-08-04 00:16:21,592 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 00:16:21,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:21,592 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:21,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:21,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1492763738, now seen corresponding path program 1 times [2023-08-04 00:16:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:21,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811865048] [2023-08-04 00:16:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:21,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:16:21,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:21,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811865048] [2023-08-04 00:16:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811865048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:16:21,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:16:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:16:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894518371] [2023-08-04 00:16:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:16:21,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:16:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:21,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:16:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:16:21,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 272 [2023-08-04 00:16:21,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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) [2023-08-04 00:16:21,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:21,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 272 [2023-08-04 00:16:21,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:25,584 INFO L124 PetriNetUnfolderBase]: 21408/31018 cut-off events. [2023-08-04 00:16:25,584 INFO L125 PetriNetUnfolderBase]: For 2280/2280 co-relation queries the response was YES. [2023-08-04 00:16:25,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62233 conditions, 31018 events. 21408/31018 cut-off events. For 2280/2280 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 210036 event pairs, 16818 based on Foata normal form. 0/30612 useless extension candidates. Maximal degree in co-relation 17678. Up to 28294 conditions per place. [2023-08-04 00:16:25,803 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 30 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-04 00:16:25,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 188 flow [2023-08-04 00:16:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:16:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:16:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-08-04 00:16:25,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5772058823529411 [2023-08-04 00:16:25,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-08-04 00:16:25,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-08-04 00:16:25,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:25,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-08-04 00:16:25,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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) [2023-08-04 00:16:25,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 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) [2023-08-04 00:16:25,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 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) [2023-08-04 00:16:25,809 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 116 flow. Second operand 3 states and 471 transitions. [2023-08-04 00:16:25,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 188 flow [2023-08-04 00:16:25,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 182 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 00:16:25,819 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 122 flow [2023-08-04 00:16:25,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-04 00:16:25,820 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-04 00:16:25,820 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 122 flow [2023-08-04 00:16:25,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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) [2023-08-04 00:16:25,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:25,821 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 00:16:25,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 00:16:25,822 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:25,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1303616107, now seen corresponding path program 1 times [2023-08-04 00:16:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:25,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207464975] [2023-08-04 00:16:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:25,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:16:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207464975] [2023-08-04 00:16:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207464975] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:16:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115562863] [2023-08-04 00:16:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:25,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:16:25,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:16:25,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 00:16:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:26,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:16:26,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:16:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:16:26,127 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:16:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115562863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:16:26,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:16:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:16:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942243891] [2023-08-04 00:16:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:16:26,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:16:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:16:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:16:26,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 272 [2023-08-04 00:16:26,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 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) [2023-08-04 00:16:26,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:26,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 272 [2023-08-04 00:16:26,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:29,239 INFO L124 PetriNetUnfolderBase]: 21396/30973 cut-off events. [2023-08-04 00:16:29,239 INFO L125 PetriNetUnfolderBase]: For 1947/1947 co-relation queries the response was YES. [2023-08-04 00:16:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61903 conditions, 30973 events. 21396/30973 cut-off events. For 1947/1947 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 208856 event pairs, 13380 based on Foata normal form. 9/30621 useless extension candidates. Maximal degree in co-relation 22151. Up to 28247 conditions per place. [2023-08-04 00:16:29,413 INFO L140 encePairwiseOnDemand]: 268/272 looper letters, 33 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-04 00:16:29,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 210 flow [2023-08-04 00:16:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:16:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:16:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2023-08-04 00:16:29,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5610294117647059 [2023-08-04 00:16:29,416 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 763 transitions. [2023-08-04 00:16:29,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 763 transitions. [2023-08-04 00:16:29,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:29,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 763 transitions. [2023-08-04 00:16:29,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 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) [2023-08-04 00:16:29,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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) [2023-08-04 00:16:29,422 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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) [2023-08-04 00:16:29,422 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 122 flow. Second operand 5 states and 763 transitions. [2023-08-04 00:16:29,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 210 flow [2023-08-04 00:16:29,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 00:16:29,425 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 136 flow [2023-08-04 00:16:29,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-08-04 00:16:29,428 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2023-08-04 00:16:29,428 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 136 flow [2023-08-04 00:16:29,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 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) [2023-08-04 00:16:29,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:29,428 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:29,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 00:16:29,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:29,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:29,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash 723212812, now seen corresponding path program 1 times [2023-08-04 00:16:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818389814] [2023-08-04 00:16:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:16:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:29,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818389814] [2023-08-04 00:16:29,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818389814] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:16:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157152509] [2023-08-04 00:16:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:29,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:16:29,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:16:29,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 00:16:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:29,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:16:29,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:16:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:16:29,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:16:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157152509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:16:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:16:29,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:16:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880194598] [2023-08-04 00:16:29,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:16:29,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:16:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:16:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:16:29,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 272 [2023-08-04 00:16:29,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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) [2023-08-04 00:16:29,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:29,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 272 [2023-08-04 00:16:29,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:32,798 INFO L124 PetriNetUnfolderBase]: 20354/29156 cut-off events. [2023-08-04 00:16:32,798 INFO L125 PetriNetUnfolderBase]: For 1798/1798 co-relation queries the response was YES. [2023-08-04 00:16:32,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58603 conditions, 29156 events. 20354/29156 cut-off events. For 1798/1798 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 192542 event pairs, 16084 based on Foata normal form. 0/28639 useless extension candidates. Maximal degree in co-relation 16688. Up to 26614 conditions per place. [2023-08-04 00:16:32,947 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 35 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2023-08-04 00:16:32,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 228 flow [2023-08-04 00:16:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:16:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:16:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-08-04 00:16:32,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821078431372549 [2023-08-04 00:16:32,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-08-04 00:16:32,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-08-04 00:16:32,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:32,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-08-04 00:16:32,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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) [2023-08-04 00:16:32,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 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) [2023-08-04 00:16:32,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 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) [2023-08-04 00:16:32,954 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 136 flow. Second operand 3 states and 475 transitions. [2023-08-04 00:16:32,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 228 flow [2023-08-04 00:16:32,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 221 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 00:16:32,957 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 144 flow [2023-08-04 00:16:32,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-04 00:16:32,959 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-04 00:16:32,959 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 144 flow [2023-08-04 00:16:32,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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) [2023-08-04 00:16:32,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:32,959 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:32,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 00:16:33,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:33,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:33,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash 188896766, now seen corresponding path program 1 times [2023-08-04 00:16:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:33,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993835317] [2023-08-04 00:16:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:16:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993835317] [2023-08-04 00:16:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993835317] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:16:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810653620] [2023-08-04 00:16:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:33,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:33,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:16:33,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:16:33,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 00:16:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:33,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:16:33,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:16:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:16:33,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:16:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:16:33,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810653620] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:16:33,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:16:33,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:16:33,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64814496] [2023-08-04 00:16:33,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:16:33,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:16:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:33,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:16:33,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:16:33,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 272 [2023-08-04 00:16:33,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 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) [2023-08-04 00:16:33,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:33,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 272 [2023-08-04 00:16:33,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:35,644 INFO L124 PetriNetUnfolderBase]: 16066/22691 cut-off events. [2023-08-04 00:16:35,644 INFO L125 PetriNetUnfolderBase]: For 1557/1557 co-relation queries the response was YES. [2023-08-04 00:16:35,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45840 conditions, 22691 events. 16066/22691 cut-off events. For 1557/1557 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 141395 event pairs, 9684 based on Foata normal form. 3/22387 useless extension candidates. Maximal degree in co-relation 16321. Up to 20836 conditions per place. [2023-08-04 00:16:35,781 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 34 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2023-08-04 00:16:35,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 48 transitions, 225 flow [2023-08-04 00:16:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:16:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:16:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2023-08-04 00:16:35,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5670955882352942 [2023-08-04 00:16:35,787 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 617 transitions. [2023-08-04 00:16:35,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 617 transitions. [2023-08-04 00:16:35,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:35,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 617 transitions. [2023-08-04 00:16:35,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 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) [2023-08-04 00:16:35,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 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) [2023-08-04 00:16:35,798 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 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) [2023-08-04 00:16:35,799 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 144 flow. Second operand 4 states and 617 transitions. [2023-08-04 00:16:35,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 48 transitions, 225 flow [2023-08-04 00:16:35,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 48 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:16:35,801 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 139 flow [2023-08-04 00:16:35,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2023-08-04 00:16:35,812 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-04 00:16:35,812 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 139 flow [2023-08-04 00:16:35,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 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) [2023-08-04 00:16:35,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:35,813 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:35,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 00:16:36,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:36,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:36,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1545755011, now seen corresponding path program 1 times [2023-08-04 00:16:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:36,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82415304] [2023-08-04 00:16:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:16:36,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82415304] [2023-08-04 00:16:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82415304] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:16:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73602400] [2023-08-04 00:16:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:36,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:36,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:16:36,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:16:36,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 00:16:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:36,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:16:36,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:16:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:16:36,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:16:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73602400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:16:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:16:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 00:16:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133042256] [2023-08-04 00:16:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:16:36,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:16:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:16:36,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:16:36,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 272 [2023-08-04 00:16:36,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 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) [2023-08-04 00:16:36,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:36,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 272 [2023-08-04 00:16:36,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:38,392 INFO L124 PetriNetUnfolderBase]: 15850/22273 cut-off events. [2023-08-04 00:16:38,392 INFO L125 PetriNetUnfolderBase]: For 1330/1330 co-relation queries the response was YES. [2023-08-04 00:16:38,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45084 conditions, 22273 events. 15850/22273 cut-off events. For 1330/1330 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 137365 event pairs, 4234 based on Foata normal form. 81/22128 useless extension candidates. Maximal degree in co-relation 16049. Up to 20007 conditions per place. [2023-08-04 00:16:38,498 INFO L140 encePairwiseOnDemand]: 268/272 looper letters, 46 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-08-04 00:16:38,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 277 flow [2023-08-04 00:16:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:16:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:16:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 775 transitions. [2023-08-04 00:16:38,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5698529411764706 [2023-08-04 00:16:38,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 775 transitions. [2023-08-04 00:16:38,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 775 transitions. [2023-08-04 00:16:38,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:38,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 775 transitions. [2023-08-04 00:16:38,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 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) [2023-08-04 00:16:38,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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) [2023-08-04 00:16:38,509 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 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) [2023-08-04 00:16:38,509 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 139 flow. Second operand 5 states and 775 transitions. [2023-08-04 00:16:38,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 277 flow [2023-08-04 00:16:38,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 00:16:38,513 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 149 flow [2023-08-04 00:16:38,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2023-08-04 00:16:38,515 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2023-08-04 00:16:38,515 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 149 flow [2023-08-04 00:16:38,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 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) [2023-08-04 00:16:38,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:38,515 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:38,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 00:16:38,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:38,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:38,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash -882188736, now seen corresponding path program 1 times [2023-08-04 00:16:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600692518] [2023-08-04 00:16:38,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:16:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600692518] [2023-08-04 00:16:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600692518] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:16:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99330656] [2023-08-04 00:16:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:38,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:38,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:16:38,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:16:38,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 00:16:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:38,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:16:38,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:16:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:16:38,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:16:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:16:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99330656] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:16:38,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:16:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:16:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306187977] [2023-08-04 00:16:38,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:16:38,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:16:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:16:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:16:38,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 272 [2023-08-04 00:16:38,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 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) [2023-08-04 00:16:38,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:38,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 272 [2023-08-04 00:16:38,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:40,397 INFO L124 PetriNetUnfolderBase]: 12583/17494 cut-off events. [2023-08-04 00:16:40,397 INFO L125 PetriNetUnfolderBase]: For 1567/1567 co-relation queries the response was YES. [2023-08-04 00:16:40,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35748 conditions, 17494 events. 12583/17494 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 103018 event pairs, 7717 based on Foata normal form. 27/17349 useless extension candidates. Maximal degree in co-relation 12692. Up to 15685 conditions per place. [2023-08-04 00:16:40,489 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 42 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-04 00:16:40,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 263 flow [2023-08-04 00:16:40,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:16:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:16:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 625 transitions. [2023-08-04 00:16:40,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5744485294117647 [2023-08-04 00:16:40,495 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 625 transitions. [2023-08-04 00:16:40,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 625 transitions. [2023-08-04 00:16:40,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:40,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 625 transitions. [2023-08-04 00:16:40,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 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) [2023-08-04 00:16:40,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 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) [2023-08-04 00:16:40,504 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 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) [2023-08-04 00:16:40,504 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 149 flow. Second operand 4 states and 625 transitions. [2023-08-04 00:16:40,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 263 flow [2023-08-04 00:16:40,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 55 transitions, 258 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 00:16:40,508 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 142 flow [2023-08-04 00:16:40,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2023-08-04 00:16:40,510 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2023-08-04 00:16:40,510 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 142 flow [2023-08-04 00:16:40,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 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) [2023-08-04 00:16:40,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:40,510 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:40,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 00:16:40,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:40,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:16:40,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash -282286864, now seen corresponding path program 1 times [2023-08-04 00:16:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:40,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411988421] [2023-08-04 00:16:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:16:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411988421] [2023-08-04 00:16:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411988421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:16:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127308503] [2023-08-04 00:16:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:40,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:16:40,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:16:40,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 00:16:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:40,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:16:40,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:16:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:16:40,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:16:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127308503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:16:40,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:16:40,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:16:40,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411213799] [2023-08-04 00:16:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:16:40,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:16:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:40,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:16:40,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:16:40,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 272 [2023-08-04 00:16:40,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 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) [2023-08-04 00:16:40,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:40,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 272 [2023-08-04 00:16:40,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:41,813 INFO L124 PetriNetUnfolderBase]: 7183/10438 cut-off events. [2023-08-04 00:16:41,813 INFO L125 PetriNetUnfolderBase]: For 1279/1279 co-relation queries the response was YES. [2023-08-04 00:16:41,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21780 conditions, 10438 events. 7183/10438 cut-off events. For 1279/1279 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 60603 event pairs, 568 based on Foata normal form. 1296/11724 useless extension candidates. Maximal degree in co-relation 8699. Up to 7155 conditions per place. [2023-08-04 00:16:41,836 INFO L140 encePairwiseOnDemand]: 270/272 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2023-08-04 00:16:41,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 274 flow [2023-08-04 00:16:41,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:16:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:16:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2023-08-04 00:16:41,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5808823529411765 [2023-08-04 00:16:41,839 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 632 transitions. [2023-08-04 00:16:41,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 632 transitions. [2023-08-04 00:16:41,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:41,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 632 transitions. [2023-08-04 00:16:41,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 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) [2023-08-04 00:16:41,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 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) [2023-08-04 00:16:41,843 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 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) [2023-08-04 00:16:41,843 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 142 flow. Second operand 4 states and 632 transitions. [2023-08-04 00:16:41,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 274 flow [2023-08-04 00:16:41,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 267 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 00:16:41,880 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2023-08-04 00:16:41,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2023-08-04 00:16:41,881 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-04 00:16:41,881 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 0 transitions, 0 flow [2023-08-04 00:16:41,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 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) [2023-08-04 00:16:41,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 00:16:41,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 00:16:41,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 00:16:41,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 00:16:42,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:16:42,088 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:42,089 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-04 00:16:42,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 372 flow [2023-08-04 00:16:42,208 INFO L124 PetriNetUnfolderBase]: 93/1387 cut-off events. [2023-08-04 00:16:42,208 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:16:42,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 1387 events. 93/1387 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9385 event pairs, 0 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 1010. Up to 54 conditions per place. [2023-08-04 00:16:42,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 168 transitions, 372 flow [2023-08-04 00:16:42,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 153 transitions, 330 flow [2023-08-04 00:16:42,215 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:16:42,215 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 153 transitions, 330 flow [2023-08-04 00:16:42,215 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 153 transitions, 330 flow [2023-08-04 00:16:42,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 153 transitions, 330 flow [2023-08-04 00:16:42,301 INFO L124 PetriNetUnfolderBase]: 66/1050 cut-off events. [2023-08-04 00:16:42,301 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 00:16:42,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1050 events. 66/1050 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6464 event pairs, 0 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 782. Up to 54 conditions per place. [2023-08-04 00:16:42,318 INFO L119 LiptonReduction]: Number of co-enabled transitions 4296 [2023-08-04 00:16:47,397 INFO L134 LiptonReduction]: Checked pairs total: 13618 [2023-08-04 00:16:47,398 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-04 00:16:47,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 00:16:47,403 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f0e8958, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:16:47,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 00:16:47,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:16:47,408 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2023-08-04 00:16:47,408 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 00:16:47,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:47,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:47,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:16:47,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1783538601, now seen corresponding path program 1 times [2023-08-04 00:16:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:47,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482451922] [2023-08-04 00:16:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:16:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:16:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:16:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482451922] [2023-08-04 00:16:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482451922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:16:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:16:47,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:16:47,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277671887] [2023-08-04 00:16:47,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:16:47,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:16:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:16:47,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:16:47,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:16:47,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 285 [2023-08-04 00:16:47,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2023-08-04 00:16:47,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:16:47,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 285 [2023-08-04 00:16:47,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:16:59,658 INFO L124 PetriNetUnfolderBase]: 90780/126121 cut-off events. [2023-08-04 00:16:59,659 INFO L125 PetriNetUnfolderBase]: For 1941/1941 co-relation queries the response was YES. [2023-08-04 00:16:59,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245782 conditions, 126121 events. 90780/126121 cut-off events. For 1941/1941 co-relation queries the response was YES. Maximal size of possible extension queue 3822. Compared 899590 event pairs, 73086 based on Foata normal form. 3276/121308 useless extension candidates. Maximal degree in co-relation 70125. Up to 117322 conditions per place. [2023-08-04 00:17:00,222 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 35 selfloop transitions, 2 changer transitions 1/47 dead transitions. [2023-08-04 00:17:00,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 194 flow [2023-08-04 00:17:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:17:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:17:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2023-08-04 00:17:00,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590643274853802 [2023-08-04 00:17:00,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2023-08-04 00:17:00,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2023-08-04 00:17:00,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:00,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2023-08-04 00:17:00,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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) [2023-08-04 00:17:00,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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) [2023-08-04 00:17:00,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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) [2023-08-04 00:17:00,226 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 112 flow. Second operand 3 states and 478 transitions. [2023-08-04 00:17:00,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 194 flow [2023-08-04 00:17:00,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:17:00,228 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 120 flow [2023-08-04 00:17:00,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-08-04 00:17:00,229 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2023-08-04 00:17:00,229 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 120 flow [2023-08-04 00:17:00,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2023-08-04 00:17:00,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:00,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:00,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 00:17:00,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:00,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash 195096123, now seen corresponding path program 1 times [2023-08-04 00:17:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:00,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589179628] [2023-08-04 00:17:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:17:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:00,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589179628] [2023-08-04 00:17:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589179628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:17:00,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828056570] [2023-08-04 00:17:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:17:00,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:17:00,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:17:00,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 00:17:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:00,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:17:00,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:17:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:17:00,408 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:17:00,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828056570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:17:00,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:17:00,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:17:00,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281489929] [2023-08-04 00:17:00,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:17:00,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:17:00,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:00,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:17:00,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:17:00,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 285 [2023-08-04 00:17:00,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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) [2023-08-04 00:17:00,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:00,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 285 [2023-08-04 00:17:00,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:17:10,243 INFO L124 PetriNetUnfolderBase]: 75086/102521 cut-off events. [2023-08-04 00:17:10,244 INFO L125 PetriNetUnfolderBase]: For 1719/1719 co-relation queries the response was YES. [2023-08-04 00:17:10,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201322 conditions, 102521 events. 75086/102521 cut-off events. For 1719/1719 co-relation queries the response was YES. Maximal size of possible extension queue 3205. Compared 696895 event pairs, 60736 based on Foata normal form. 0/98908 useless extension candidates. Maximal degree in co-relation 201285. Up to 96475 conditions per place. [2023-08-04 00:17:10,810 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 40 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-04 00:17:10,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 220 flow [2023-08-04 00:17:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:17:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:17:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-08-04 00:17:10,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2023-08-04 00:17:10,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-08-04 00:17:10,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-08-04 00:17:10,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:10,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-08-04 00:17:10,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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) [2023-08-04 00:17:10,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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) [2023-08-04 00:17:10,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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) [2023-08-04 00:17:10,815 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 120 flow. Second operand 3 states and 480 transitions. [2023-08-04 00:17:10,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 220 flow [2023-08-04 00:17:10,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:17:10,817 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 130 flow [2023-08-04 00:17:10,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2023-08-04 00:17:10,818 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2023-08-04 00:17:10,818 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 130 flow [2023-08-04 00:17:10,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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) [2023-08-04 00:17:10,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:10,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:10,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-04 00:17:11,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:17:11,026 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:11,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash -107741397, now seen corresponding path program 1 times [2023-08-04 00:17:11,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:11,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175108188] [2023-08-04 00:17:11,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:11,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:17:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175108188] [2023-08-04 00:17:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175108188] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:17:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985452579] [2023-08-04 00:17:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:17:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:17:11,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:17:11,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 00:17:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:11,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:17:11,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:17:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:17:11,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:17:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985452579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:17:11,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:17:11,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:17:11,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59254959] [2023-08-04 00:17:11,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:17:11,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:17:11,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:11,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:17:11,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:17:11,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 285 [2023-08-04 00:17:11,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2023-08-04 00:17:11,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:11,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 285 [2023-08-04 00:17:11,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:17:20,872 INFO L124 PetriNetUnfolderBase]: 73742/99362 cut-off events. [2023-08-04 00:17:20,874 INFO L125 PetriNetUnfolderBase]: For 977/977 co-relation queries the response was YES. [2023-08-04 00:17:21,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196577 conditions, 99362 events. 73742/99362 cut-off events. For 977/977 co-relation queries the response was YES. Maximal size of possible extension queue 3200. Compared 658215 event pairs, 57038 based on Foata normal form. 0/95890 useless extension candidates. Maximal degree in co-relation 56212. Up to 91805 conditions per place. [2023-08-04 00:17:21,437 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 46 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 00:17:21,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 57 transitions, 252 flow [2023-08-04 00:17:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:17:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:17:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-08-04 00:17:21,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5672514619883041 [2023-08-04 00:17:21,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-08-04 00:17:21,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-08-04 00:17:21,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:21,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-08-04 00:17:21,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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) [2023-08-04 00:17:21,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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) [2023-08-04 00:17:21,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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) [2023-08-04 00:17:21,442 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 130 flow. Second operand 3 states and 485 transitions. [2023-08-04 00:17:21,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 57 transitions, 252 flow [2023-08-04 00:17:21,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:17:21,445 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 140 flow [2023-08-04 00:17:21,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-08-04 00:17:21,445 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2023-08-04 00:17:21,445 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 140 flow [2023-08-04 00:17:21,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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) [2023-08-04 00:17:21,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:21,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:21,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 00:17:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-04 00:17:21,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:21,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash 432841465, now seen corresponding path program 1 times [2023-08-04 00:17:21,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:21,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243354898] [2023-08-04 00:17:21,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:17:21,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:21,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243354898] [2023-08-04 00:17:21,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243354898] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:17:21,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104517699] [2023-08-04 00:17:21,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:21,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:17:21,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:17:21,706 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:17:21,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 00:17:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:21,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:17:21,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:17:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:17:21,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:17:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:17:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104517699] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:17:21,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:17:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:17:21,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074270208] [2023-08-04 00:17:21,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:17:21,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:17:21,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:21,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:17:21,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:17:21,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-04 00:17:21,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 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) [2023-08-04 00:17:21,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:21,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-04 00:17:21,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:17:29,526 INFO L124 PetriNetUnfolderBase]: 57928/76769 cut-off events. [2023-08-04 00:17:29,527 INFO L125 PetriNetUnfolderBase]: For 5676/5676 co-relation queries the response was YES. [2023-08-04 00:17:29,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157154 conditions, 76769 events. 57928/76769 cut-off events. For 5676/5676 co-relation queries the response was YES. Maximal size of possible extension queue 2537. Compared 470954 event pairs, 36996 based on Foata normal form. 3/76303 useless extension candidates. Maximal degree in co-relation 55854. Up to 73594 conditions per place. [2023-08-04 00:17:29,982 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 40 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-04 00:17:29,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 244 flow [2023-08-04 00:17:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:17:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:17:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2023-08-04 00:17:29,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5464912280701755 [2023-08-04 00:17:29,985 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 623 transitions. [2023-08-04 00:17:29,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 623 transitions. [2023-08-04 00:17:29,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:29,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 623 transitions. [2023-08-04 00:17:29,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 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) [2023-08-04 00:17:29,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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) [2023-08-04 00:17:29,988 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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) [2023-08-04 00:17:29,988 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 140 flow. Second operand 4 states and 623 transitions. [2023-08-04 00:17:29,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 244 flow [2023-08-04 00:17:29,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:17:29,993 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 152 flow [2023-08-04 00:17:29,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-04 00:17:29,994 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2023-08-04 00:17:29,994 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 152 flow [2023-08-04 00:17:29,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 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) [2023-08-04 00:17:29,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:29,994 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:30,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 00:17:30,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 00:17:30,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:30,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash 356932830, now seen corresponding path program 1 times [2023-08-04 00:17:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299104978] [2023-08-04 00:17:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 00:17:30,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:30,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299104978] [2023-08-04 00:17:30,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299104978] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:17:30,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567801393] [2023-08-04 00:17:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:30,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:17:30,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:17:30,265 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:17:30,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 00:17:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:30,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:17:30,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:17:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 00:17:30,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:17:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 00:17:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567801393] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:17:30,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:17:30,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:17:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422070994] [2023-08-04 00:17:30,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:17:30,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:17:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:17:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:17:30,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-04 00:17:30,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 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) [2023-08-04 00:17:30,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:30,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-04 00:17:30,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:17:36,216 INFO L124 PetriNetUnfolderBase]: 45550/59722 cut-off events. [2023-08-04 00:17:36,217 INFO L125 PetriNetUnfolderBase]: For 3978/3978 co-relation queries the response was YES. [2023-08-04 00:17:36,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121979 conditions, 59722 events. 45550/59722 cut-off events. For 3978/3978 co-relation queries the response was YES. Maximal size of possible extension queue 2150. Compared 352963 event pairs, 29614 based on Foata normal form. 27/59415 useless extension candidates. Maximal degree in co-relation 43271. Up to 56617 conditions per place. [2023-08-04 00:17:36,571 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 48 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 00:17:36,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 288 flow [2023-08-04 00:17:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:17:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:17:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions. [2023-08-04 00:17:36,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535087719298246 [2023-08-04 00:17:36,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 631 transitions. [2023-08-04 00:17:36,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions. [2023-08-04 00:17:36,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:36,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions. [2023-08-04 00:17:36,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 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) [2023-08-04 00:17:36,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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) [2023-08-04 00:17:36,577 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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) [2023-08-04 00:17:36,577 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 152 flow. Second operand 4 states and 631 transitions. [2023-08-04 00:17:36,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 288 flow [2023-08-04 00:17:36,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 281 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 00:17:36,581 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 159 flow [2023-08-04 00:17:36,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-08-04 00:17:36,582 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2023-08-04 00:17:36,582 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 159 flow [2023-08-04 00:17:36,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 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) [2023-08-04 00:17:36,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:36,582 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:36,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 00:17:36,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 00:17:36,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:36,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:36,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2045138771, now seen corresponding path program 1 times [2023-08-04 00:17:36,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:36,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307346578] [2023-08-04 00:17:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:17:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307346578] [2023-08-04 00:17:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307346578] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:17:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567345650] [2023-08-04 00:17:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:36,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:17:36,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:17:36,848 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:17:36,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 00:17:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:36,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:17:36,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:17:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:17:37,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:17:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:17:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567345650] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:17:37,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:17:37,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:17:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428712127] [2023-08-04 00:17:37,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:17:37,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:17:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:17:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:17:37,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-04 00:17:37,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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) [2023-08-04 00:17:37,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:37,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-04 00:17:37,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:17:42,174 INFO L124 PetriNetUnfolderBase]: 40906/52666 cut-off events. [2023-08-04 00:17:42,175 INFO L125 PetriNetUnfolderBase]: For 3106/3106 co-relation queries the response was YES. [2023-08-04 00:17:42,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108883 conditions, 52666 events. 40906/52666 cut-off events. For 3106/3106 co-relation queries the response was YES. Maximal size of possible extension queue 1914. Compared 291906 event pairs, 18820 based on Foata normal form. 324/52980 useless extension candidates. Maximal degree in co-relation 38600. Up to 34339 conditions per place. [2023-08-04 00:17:42,447 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 59 selfloop transitions, 3 changer transitions 1/72 dead transitions. [2023-08-04 00:17:42,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 72 transitions, 339 flow [2023-08-04 00:17:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:17:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:17:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2023-08-04 00:17:42,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5631578947368421 [2023-08-04 00:17:42,449 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2023-08-04 00:17:42,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2023-08-04 00:17:42,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:42,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2023-08-04 00:17:42,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 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) [2023-08-04 00:17:42,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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) [2023-08-04 00:17:42,451 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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) [2023-08-04 00:17:42,451 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 159 flow. Second operand 4 states and 642 transitions. [2023-08-04 00:17:42,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 72 transitions, 339 flow [2023-08-04 00:17:42,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 332 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 00:17:42,455 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 166 flow [2023-08-04 00:17:42,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2023-08-04 00:17:42,455 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2023-08-04 00:17:42,456 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 166 flow [2023-08-04 00:17:42,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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) [2023-08-04 00:17:42,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:42,456 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:42,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 00:17:42,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 00:17:42,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:42,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:42,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1701050044, now seen corresponding path program 1 times [2023-08-04 00:17:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:42,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527082759] [2023-08-04 00:17:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 00:17:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527082759] [2023-08-04 00:17:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527082759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:17:42,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:17:42,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:17:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073132642] [2023-08-04 00:17:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:17:42,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:17:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:42,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:17:42,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:17:42,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 285 [2023-08-04 00:17:42,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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) [2023-08-04 00:17:42,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:42,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 285 [2023-08-04 00:17:42,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:17:48,131 INFO L124 PetriNetUnfolderBase]: 38362/50446 cut-off events. [2023-08-04 00:17:48,131 INFO L125 PetriNetUnfolderBase]: For 14596/14596 co-relation queries the response was YES. [2023-08-04 00:17:48,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108439 conditions, 50446 events. 38362/50446 cut-off events. For 14596/14596 co-relation queries the response was YES. Maximal size of possible extension queue 1866. Compared 290853 event pairs, 20095 based on Foata normal form. 1296/51741 useless extension candidates. Maximal degree in co-relation 38388. Up to 40381 conditions per place. [2023-08-04 00:17:48,408 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 57 selfloop transitions, 3 changer transitions 27/96 dead transitions. [2023-08-04 00:17:48,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 96 transitions, 489 flow [2023-08-04 00:17:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:17:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:17:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 814 transitions. [2023-08-04 00:17:48,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5712280701754386 [2023-08-04 00:17:48,410 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 814 transitions. [2023-08-04 00:17:48,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 814 transitions. [2023-08-04 00:17:48,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:48,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 814 transitions. [2023-08-04 00:17:48,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 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) [2023-08-04 00:17:48,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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) [2023-08-04 00:17:48,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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) [2023-08-04 00:17:48,415 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 166 flow. Second operand 5 states and 814 transitions. [2023-08-04 00:17:48,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 96 transitions, 489 flow [2023-08-04 00:17:48,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 475 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 00:17:48,441 INFO L231 Difference]: Finished difference. Result has 74 places, 47 transitions, 186 flow [2023-08-04 00:17:48,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=74, PETRI_TRANSITIONS=47} [2023-08-04 00:17:48,442 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2023-08-04 00:17:48,442 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 47 transitions, 186 flow [2023-08-04 00:17:48,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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) [2023-08-04 00:17:48,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:48,443 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:48,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 00:17:48,443 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:48,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:48,443 INFO L85 PathProgramCache]: Analyzing trace with hash -665294921, now seen corresponding path program 1 times [2023-08-04 00:17:48,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:48,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130242366] [2023-08-04 00:17:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 00:17:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:48,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130242366] [2023-08-04 00:17:48,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130242366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:17:48,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:17:48,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:17:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116251176] [2023-08-04 00:17:48,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:17:48,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:17:48,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:17:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:17:48,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 285 [2023-08-04 00:17:48,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 47 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 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) [2023-08-04 00:17:48,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:48,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 285 [2023-08-04 00:17:48,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:17:54,023 INFO L124 PetriNetUnfolderBase]: 36578/48238 cut-off events. [2023-08-04 00:17:54,024 INFO L125 PetriNetUnfolderBase]: For 26416/26416 co-relation queries the response was YES. [2023-08-04 00:17:54,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116471 conditions, 48238 events. 36578/48238 cut-off events. For 26416/26416 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 278897 event pairs, 27755 based on Foata normal form. 1152/49389 useless extension candidates. Maximal degree in co-relation 116393. Up to 39049 conditions per place. [2023-08-04 00:17:54,317 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 67 selfloop transitions, 3 changer transitions 27/106 dead transitions. [2023-08-04 00:17:54,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 593 flow [2023-08-04 00:17:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:17:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:17:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2023-08-04 00:17:54,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5852631578947368 [2023-08-04 00:17:54,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2023-08-04 00:17:54,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2023-08-04 00:17:54,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:54,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2023-08-04 00:17:54,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 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) [2023-08-04 00:17:54,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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) [2023-08-04 00:17:54,323 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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) [2023-08-04 00:17:54,323 INFO L175 Difference]: Start difference. First operand has 74 places, 47 transitions, 186 flow. Second operand 5 states and 834 transitions. [2023-08-04 00:17:54,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 593 flow [2023-08-04 00:17:54,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 106 transitions, 586 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 00:17:54,541 INFO L231 Difference]: Finished difference. Result has 77 places, 49 transitions, 208 flow [2023-08-04 00:17:54,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2023-08-04 00:17:54,542 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2023-08-04 00:17:54,542 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 208 flow [2023-08-04 00:17:54,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 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) [2023-08-04 00:17:54,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:54,542 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:54,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 00:17:54,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:54,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1267249998, now seen corresponding path program 1 times [2023-08-04 00:17:54,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:54,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146171877] [2023-08-04 00:17:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:54,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:17:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146171877] [2023-08-04 00:17:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146171877] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:17:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298530038] [2023-08-04 00:17:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:54,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:17:54,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:17:54,714 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:17:54,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 00:17:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:54,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-04 00:17:54,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:17:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 00:17:54,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:17:54,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298530038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:17:54,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:17:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 00:17:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509905219] [2023-08-04 00:17:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:17:54,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:17:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:17:54,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:17:54,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 285 [2023-08-04 00:17:54,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 49 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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) [2023-08-04 00:17:54,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:54,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 285 [2023-08-04 00:17:54,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:17:58,773 INFO L124 PetriNetUnfolderBase]: 30198/38662 cut-off events. [2023-08-04 00:17:58,774 INFO L125 PetriNetUnfolderBase]: For 35502/35502 co-relation queries the response was YES. [2023-08-04 00:17:58,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106934 conditions, 38662 events. 30198/38662 cut-off events. For 35502/35502 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 200911 event pairs, 6958 based on Foata normal form. 144/38801 useless extension candidates. Maximal degree in co-relation 93150. Up to 36477 conditions per place. [2023-08-04 00:17:59,063 INFO L140 encePairwiseOnDemand]: 277/285 looper letters, 67 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-08-04 00:17:59,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 509 flow [2023-08-04 00:17:59,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:17:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:17:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2023-08-04 00:17:59,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5730994152046783 [2023-08-04 00:17:59,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2023-08-04 00:17:59,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2023-08-04 00:17:59,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:17:59,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2023-08-04 00:17:59,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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) [2023-08-04 00:17:59,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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) [2023-08-04 00:17:59,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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) [2023-08-04 00:17:59,068 INFO L175 Difference]: Start difference. First operand has 77 places, 49 transitions, 208 flow. Second operand 3 states and 490 transitions. [2023-08-04 00:17:59,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 509 flow [2023-08-04 00:17:59,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 83 transitions, 502 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 00:17:59,093 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 250 flow [2023-08-04 00:17:59,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2023-08-04 00:17:59,094 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2023-08-04 00:17:59,094 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 250 flow [2023-08-04 00:17:59,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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) [2023-08-04 00:17:59,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:17:59,094 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:17:59,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 00:17:59,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 00:17:59,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:17:59,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:17:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash 431624311, now seen corresponding path program 1 times [2023-08-04 00:17:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:17:59,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837453197] [2023-08-04 00:17:59,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:17:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:17:59,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:17:59,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837453197] [2023-08-04 00:17:59,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837453197] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:17:59,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797790146] [2023-08-04 00:17:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:17:59,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:17:59,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:17:59,693 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:17:59,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 00:17:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:17:59,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-04 00:17:59,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:17:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 00:17:59,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:17:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797790146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:17:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:17:59,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 00:17:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872521232] [2023-08-04 00:17:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:17:59,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:17:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:17:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:17:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-04 00:17:59,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 285 [2023-08-04 00:17:59,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 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) [2023-08-04 00:17:59,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:17:59,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 285 [2023-08-04 00:17:59,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:18:04,532 INFO L124 PetriNetUnfolderBase]: 32209/43140 cut-off events. [2023-08-04 00:18:04,532 INFO L125 PetriNetUnfolderBase]: For 50181/50181 co-relation queries the response was YES. [2023-08-04 00:18:04,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131530 conditions, 43140 events. 32209/43140 cut-off events. For 50181/50181 co-relation queries the response was YES. Maximal size of possible extension queue 1616. Compared 256229 event pairs, 5930 based on Foata normal form. 880/44010 useless extension candidates. Maximal degree in co-relation 53893. Up to 34456 conditions per place. [2023-08-04 00:18:04,829 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 67 selfloop transitions, 3 changer transitions 25/104 dead transitions. [2023-08-04 00:18:04,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 657 flow [2023-08-04 00:18:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:18:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:18:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 805 transitions. [2023-08-04 00:18:04,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5649122807017544 [2023-08-04 00:18:04,832 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 805 transitions. [2023-08-04 00:18:04,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 805 transitions. [2023-08-04 00:18:04,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:18:04,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 805 transitions. [2023-08-04 00:18:04,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 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) [2023-08-04 00:18:04,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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) [2023-08-04 00:18:04,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 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) [2023-08-04 00:18:04,836 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 250 flow. Second operand 5 states and 805 transitions. [2023-08-04 00:18:04,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 657 flow [2023-08-04 00:18:04,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 104 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:18:04,860 INFO L231 Difference]: Finished difference. Result has 82 places, 57 transitions, 270 flow [2023-08-04 00:18:04,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=82, PETRI_TRANSITIONS=57} [2023-08-04 00:18:04,861 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2023-08-04 00:18:04,861 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 57 transitions, 270 flow [2023-08-04 00:18:04,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 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) [2023-08-04 00:18:04,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:18:04,861 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:18:04,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 00:18:05,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:18:05,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:18:05,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:18:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash -611520413, now seen corresponding path program 1 times [2023-08-04 00:18:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:18:05,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223970768] [2023-08-04 00:18:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:18:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:18:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:18:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 00:18:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:18:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223970768] [2023-08-04 00:18:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223970768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:18:05,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:18:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 00:18:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479325895] [2023-08-04 00:18:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:18:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:18:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:18:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:18:05,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:18:05,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 285 [2023-08-04 00:18:05,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 57 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 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) [2023-08-04 00:18:05,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:18:05,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 285 [2023-08-04 00:18:05,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:18:18,195 INFO L124 PetriNetUnfolderBase]: 87154/113502 cut-off events. [2023-08-04 00:18:18,195 INFO L125 PetriNetUnfolderBase]: For 166218/166218 co-relation queries the response was YES. [2023-08-04 00:18:18,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357744 conditions, 113502 events. 87154/113502 cut-off events. For 166218/166218 co-relation queries the response was YES. Maximal size of possible extension queue 4039. Compared 709206 event pairs, 9644 based on Foata normal form. 2412/115779 useless extension candidates. Maximal degree in co-relation 333990. Up to 50021 conditions per place. [2023-08-04 00:18:19,072 INFO L140 encePairwiseOnDemand]: 278/285 looper letters, 105 selfloop transitions, 7 changer transitions 48/167 dead transitions. [2023-08-04 00:18:19,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 167 transitions, 1081 flow [2023-08-04 00:18:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 00:18:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 00:18:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1130 transitions. [2023-08-04 00:18:19,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5664160401002506 [2023-08-04 00:18:19,075 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1130 transitions. [2023-08-04 00:18:19,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1130 transitions. [2023-08-04 00:18:19,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:18:19,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1130 transitions. [2023-08-04 00:18:19,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.42857142857142) internal successors, (1130), 7 states have internal predecessors, (1130), 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) [2023-08-04 00:18:19,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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) [2023-08-04 00:18:19,080 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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) [2023-08-04 00:18:19,080 INFO L175 Difference]: Start difference. First operand has 82 places, 57 transitions, 270 flow. Second operand 7 states and 1130 transitions. [2023-08-04 00:18:19,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 167 transitions, 1081 flow [2023-08-04 00:18:19,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 1074 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 00:18:19,138 INFO L231 Difference]: Finished difference. Result has 89 places, 63 transitions, 342 flow [2023-08-04 00:18:19,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=89, PETRI_TRANSITIONS=63} [2023-08-04 00:18:19,138 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2023-08-04 00:18:19,138 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 63 transitions, 342 flow [2023-08-04 00:18:19,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 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) [2023-08-04 00:18:19,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:18:19,139 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:18:19,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 00:18:19,139 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:18:19,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:18:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1110125565, now seen corresponding path program 1 times [2023-08-04 00:18:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:18:19,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513139593] [2023-08-04 00:18:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:18:19,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:18:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:18:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:18:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:18:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513139593] [2023-08-04 00:18:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513139593] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:18:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155853763] [2023-08-04 00:18:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:18:19,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:18:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:18:19,325 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:18:19,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 00:18:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:18:19,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-04 00:18:19,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:18:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:18:19,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:18:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:18:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155853763] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:18:19,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:18:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-04 00:18:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143927598] [2023-08-04 00:18:19,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:18:19,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-04 00:18:19,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:18:19,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-04 00:18:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-04 00:18:19,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 285 [2023-08-04 00:18:19,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 63 transitions, 342 flow. Second operand has 9 states, 9 states have (on average 149.77777777777777) internal successors, (1348), 9 states have internal predecessors, (1348), 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) [2023-08-04 00:18:19,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:18:19,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 285 [2023-08-04 00:18:19,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:18:48,527 INFO L124 PetriNetUnfolderBase]: 173027/228464 cut-off events. [2023-08-04 00:18:48,527 INFO L125 PetriNetUnfolderBase]: For 497192/498591 co-relation queries the response was YES. [2023-08-04 00:18:49,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774395 conditions, 228464 events. 173027/228464 cut-off events. For 497192/498591 co-relation queries the response was YES. Maximal size of possible extension queue 8291. Compared 1575151 event pairs, 31064 based on Foata normal form. 4329/230720 useless extension candidates. Maximal degree in co-relation 733577. Up to 102429 conditions per place. [2023-08-04 00:18:50,516 INFO L140 encePairwiseOnDemand]: 278/285 looper letters, 129 selfloop transitions, 7 changer transitions 48/193 dead transitions. [2023-08-04 00:18:50,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 193 transitions, 1389 flow [2023-08-04 00:18:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 00:18:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 00:18:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1140 transitions. [2023-08-04 00:18:50,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2023-08-04 00:18:50,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1140 transitions. [2023-08-04 00:18:50,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1140 transitions. [2023-08-04 00:18:50,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:18:50,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1140 transitions. [2023-08-04 00:18:50,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 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) [2023-08-04 00:18:50,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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) [2023-08-04 00:18:50,523 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 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) [2023-08-04 00:18:50,523 INFO L175 Difference]: Start difference. First operand has 89 places, 63 transitions, 342 flow. Second operand 7 states and 1140 transitions. [2023-08-04 00:18:50,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 193 transitions, 1389 flow [2023-08-04 00:19:06,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 193 transitions, 1336 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-08-04 00:19:06,799 INFO L231 Difference]: Finished difference. Result has 94 places, 69 transitions, 402 flow [2023-08-04 00:19:06,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=94, PETRI_TRANSITIONS=69} [2023-08-04 00:19:06,800 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 38 predicate places. [2023-08-04 00:19:06,800 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 69 transitions, 402 flow [2023-08-04 00:19:06,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 149.77777777777777) internal successors, (1348), 9 states have internal predecessors, (1348), 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) [2023-08-04 00:19:06,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:19:06,800 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:19:06,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 00:19:07,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:19:07,006 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:19:07,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:19:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1966821222, now seen corresponding path program 1 times [2023-08-04 00:19:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:19:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72117319] [2023-08-04 00:19:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:19:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:19:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:19:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 00:19:08,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:19:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72117319] [2023-08-04 00:19:08,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72117319] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:19:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255737521] [2023-08-04 00:19:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:19:08,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:19:08,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:19:08,941 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:19:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 00:19:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:19:09,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-04 00:19:09,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:19:09,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-04 00:19:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:19:09,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:19:09,841 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 00:19:09,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 126 [2023-08-04 00:19:10,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 97 [2023-08-04 00:19:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:19:10,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255737521] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:19:10,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:19:10,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 6] total 17 [2023-08-04 00:19:10,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642034947] [2023-08-04 00:19:10,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:19:10,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 00:19:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:19:10,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 00:19:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-08-04 00:19:11,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 285 [2023-08-04 00:19:11,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 69 transitions, 402 flow. Second operand has 18 states, 18 states have (on average 125.22222222222223) internal successors, (2254), 18 states have internal predecessors, (2254), 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) [2023-08-04 00:19:11,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:19:11,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 285 [2023-08-04 00:19:11,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:19:49,050 INFO L124 PetriNetUnfolderBase]: 229057/305546 cut-off events. [2023-08-04 00:19:49,051 INFO L125 PetriNetUnfolderBase]: For 819269/821549 co-relation queries the response was YES. [2023-08-04 00:19:51,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074457 conditions, 305546 events. 229057/305546 cut-off events. For 819269/821549 co-relation queries the response was YES. Maximal size of possible extension queue 10083. Compared 2190494 event pairs, 14215 based on Foata normal form. 9462/307608 useless extension candidates. Maximal degree in co-relation 1074352. Up to 127269 conditions per place. [2023-08-04 00:19:52,368 INFO L140 encePairwiseOnDemand]: 265/285 looper letters, 402 selfloop transitions, 102 changer transitions 48/563 dead transitions. [2023-08-04 00:19:52,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 563 transitions, 4366 flow [2023-08-04 00:19:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-04 00:19:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-04 00:19:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3288 transitions. [2023-08-04 00:19:52,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807017543859649 [2023-08-04 00:19:52,373 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3288 transitions. [2023-08-04 00:19:52,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3288 transitions. [2023-08-04 00:19:52,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:19:52,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3288 transitions. [2023-08-04 00:19:52,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 137.0) internal successors, (3288), 24 states have internal predecessors, (3288), 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) [2023-08-04 00:19:52,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 285.0) internal successors, (7125), 25 states have internal predecessors, (7125), 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) [2023-08-04 00:19:52,384 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 285.0) internal successors, (7125), 25 states have internal predecessors, (7125), 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) [2023-08-04 00:19:52,384 INFO L175 Difference]: Start difference. First operand has 94 places, 69 transitions, 402 flow. Second operand 24 states and 3288 transitions. [2023-08-04 00:19:52,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 563 transitions, 4366 flow [2023-08-04 00:20:15,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 563 transitions, 4169 flow, removed 70 selfloop flow, removed 3 redundant places. [2023-08-04 00:20:15,330 INFO L231 Difference]: Finished difference. Result has 131 places, 182 transitions, 1375 flow [2023-08-04 00:20:15,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1375, PETRI_PLACES=131, PETRI_TRANSITIONS=182} [2023-08-04 00:20:15,331 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 75 predicate places. [2023-08-04 00:20:15,331 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 182 transitions, 1375 flow [2023-08-04 00:20:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 125.22222222222223) internal successors, (2254), 18 states have internal predecessors, (2254), 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) [2023-08-04 00:20:15,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:20:15,332 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:20:15,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-04 00:20:15,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:20:15,532 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:20:15,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:20:15,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1016938177, now seen corresponding path program 1 times [2023-08-04 00:20:15,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:20:15,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297939585] [2023-08-04 00:20:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:20:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:20:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:20:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 00:20:17,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:20:17,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297939585] [2023-08-04 00:20:17,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297939585] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:20:17,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942000138] [2023-08-04 00:20:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:20:17,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:20:17,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:20:17,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:20:17,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 00:20:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:20:17,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-04 00:20:17,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:20:17,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-04 00:20:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 00:20:17,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:20:18,088 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 00:20:18,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 133 [2023-08-04 00:20:18,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 97 [2023-08-04 00:20:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 00:20:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942000138] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:20:18,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:20:18,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 20 [2023-08-04 00:20:18,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111650830] [2023-08-04 00:20:18,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:20:18,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-04 00:20:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:20:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-04 00:20:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-08-04 00:20:18,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 285 [2023-08-04 00:20:18,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 182 transitions, 1375 flow. Second operand has 21 states, 21 states have (on average 121.80952380952381) internal successors, (2558), 21 states have internal predecessors, (2558), 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) [2023-08-04 00:20:18,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:20:18,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 285 [2023-08-04 00:20:18,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:20:52,043 INFO L124 PetriNetUnfolderBase]: 158920/211353 cut-off events. [2023-08-04 00:20:52,044 INFO L125 PetriNetUnfolderBase]: For 1241872/1242980 co-relation queries the response was YES. [2023-08-04 00:20:54,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076820 conditions, 211353 events. 158920/211353 cut-off events. For 1241872/1242980 co-relation queries the response was YES. Maximal size of possible extension queue 8357. Compared 1459697 event pairs, 7557 based on Foata normal form. 6376/212354 useless extension candidates. Maximal degree in co-relation 1076681. Up to 80479 conditions per place. [2023-08-04 00:20:55,060 INFO L140 encePairwiseOnDemand]: 265/285 looper letters, 358 selfloop transitions, 180 changer transitions 114/663 dead transitions. [2023-08-04 00:20:55,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 663 transitions, 6590 flow [2023-08-04 00:20:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-04 00:20:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-04 00:20:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4073 transitions. [2023-08-04 00:20:55,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4610073571024335 [2023-08-04 00:20:55,065 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4073 transitions. [2023-08-04 00:20:55,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4073 transitions. [2023-08-04 00:20:55,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:20:55,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4073 transitions. [2023-08-04 00:20:55,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 131.38709677419354) internal successors, (4073), 31 states have internal predecessors, (4073), 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) [2023-08-04 00:20:55,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 285.0) internal successors, (9120), 32 states have internal predecessors, (9120), 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) [2023-08-04 00:20:55,077 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 285.0) internal successors, (9120), 32 states have internal predecessors, (9120), 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) [2023-08-04 00:20:55,077 INFO L175 Difference]: Start difference. First operand has 131 places, 182 transitions, 1375 flow. Second operand 31 states and 4073 transitions. [2023-08-04 00:20:55,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 663 transitions, 6590 flow [2023-08-04 00:22:02,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 663 transitions, 6307 flow, removed 124 selfloop flow, removed 3 redundant places. [2023-08-04 00:22:02,718 INFO L231 Difference]: Finished difference. Result has 168 places, 254 transitions, 2490 flow [2023-08-04 00:22:02,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2490, PETRI_PLACES=168, PETRI_TRANSITIONS=254} [2023-08-04 00:22:02,718 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 112 predicate places. [2023-08-04 00:22:02,718 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 254 transitions, 2490 flow [2023-08-04 00:22:02,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 121.80952380952381) internal successors, (2558), 21 states have internal predecessors, (2558), 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) [2023-08-04 00:22:02,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:22:02,719 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:22:02,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-04 00:22:02,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-04 00:22:02,920 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:22:02,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:22:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash -590522558, now seen corresponding path program 1 times [2023-08-04 00:22:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:22:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628714331] [2023-08-04 00:22:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:22:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:22:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:22:02,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:22:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:22:03,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:22:03,020 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:22:03,020 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 00:22:03,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-04 00:22:03,020 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:22:03,021 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (2/2) [2023-08-04 00:22:03,023 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 00:22:03,023 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 00:22:03,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 12:22:03 BasicIcfg [2023-08-04 00:22:03,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 00:22:03,133 INFO L158 Benchmark]: Toolchain (without parser) took 353549.69ms. Allocated memory was 329.3MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 274.6MB in the beginning and 12.9GB in the end (delta: -12.6GB). Peak memory consumption was 3.1GB. Max. memory is 16.0GB. [2023-08-04 00:22:03,133 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 329.3MB. Free memory is still 282.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 00:22:03,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.57ms. Allocated memory is still 329.3MB. Free memory was 274.6MB in the beginning and 251.3MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 00:22:03,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.84ms. Allocated memory is still 329.3MB. Free memory was 251.3MB in the beginning and 248.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 00:22:03,134 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 329.3MB. Free memory was 248.9MB in the beginning and 246.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 00:22:03,134 INFO L158 Benchmark]: RCFGBuilder took 785.07ms. Allocated memory was 329.3MB in the beginning and 536.9MB in the end (delta: 207.6MB). Free memory was 246.5MB in the beginning and 459.4MB in the end (delta: -212.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.0GB. [2023-08-04 00:22:03,135 INFO L158 Benchmark]: TraceAbstraction took 352236.95ms. Allocated memory was 536.9MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 458.7MB in the beginning and 12.9GB in the end (delta: -12.4GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-08-04 00:22:03,138 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 329.3MB. Free memory is still 282.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 439.57ms. Allocated memory is still 329.3MB. Free memory was 274.6MB in the beginning and 251.3MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.84ms. Allocated memory is still 329.3MB. Free memory was 251.3MB in the beginning and 248.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 329.3MB. Free memory was 248.9MB in the beginning and 246.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 785.07ms. Allocated memory was 329.3MB in the beginning and 536.9MB in the end (delta: 207.6MB). Free memory was 246.5MB in the beginning and 459.4MB in the end (delta: -212.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.0GB. * TraceAbstraction took 352236.95ms. Allocated memory was 536.9MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 458.7MB in the beginning and 12.9GB in the end (delta: -12.4GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 122 PlacesBefore, 31 PlacesAfterwards, 117 TransitionsBefore, 24 TransitionsAfterwards, 1160 CoEnabledTransitionPairs, 8 FixpointIterations, 56 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 3174 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1721, independent: 1560, independent conditional: 0, independent unconditional: 1560, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 623, independent: 601, independent conditional: 0, independent unconditional: 601, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1721, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 623, unknown conditional: 0, unknown unconditional: 623] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 150 PlacesBefore, 53 PlacesAfterwards, 139 TransitionsBefore, 40 TransitionsAfterwards, 3152 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 9413 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3959, independent: 3696, independent conditional: 0, independent unconditional: 3696, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1577, independent: 1531, independent conditional: 0, independent unconditional: 1531, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3959, independent: 2165, independent conditional: 0, independent unconditional: 2165, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 1577, unknown conditional: 0, unknown unconditional: 1577] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 162 PlacesBefore, 56 PlacesAfterwards, 153 TransitionsBefore, 44 TransitionsAfterwards, 4296 CoEnabledTransitionPairs, 8 FixpointIterations, 56 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 117 TotalNumberOfCompositions, 13618 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5563, independent: 5218, independent conditional: 0, independent unconditional: 5218, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2082, independent: 2032, independent conditional: 0, independent unconditional: 2032, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5563, independent: 3186, independent conditional: 0, independent unconditional: 3186, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 2082, unknown conditional: 0, unknown unconditional: 2082] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949[2]; [L837] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L837] COND TRUE 0 asdf<2 [L837] FCALL, FORK 0 pthread_create(&t1949[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1949[asdf], ((void *)0), P0, ((void *)0))=-1, t1949={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L837] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L837] COND TRUE 0 asdf<2 [L837] FCALL, FORK 0 pthread_create(&t1949[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1949[asdf], ((void *)0), P0, ((void *)0))=0, t1949={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L837] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L781] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L837] COND FALSE 0 !(asdf<2) [L838] 0 pthread_t t1950[2]; [L839] 0 int asdf=0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, t1950={10:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] COND TRUE 0 asdf<2 [L839] FCALL, FORK 0 pthread_create(&t1950[asdf], ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1950[asdf], ((void *)0), P1, ((void *)0))=1, t1949={9:0}, t1950={10:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, t1950={10:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] COND TRUE 0 asdf<2 [L793] 3 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] FCALL, FORK 0 pthread_create(&t1950[asdf], ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1950[asdf], ((void *)0), P1, ((void *)0))=2, t1949={9:0}, t1950={10:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, t1950={10:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L796] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L839] COND FALSE 0 !(asdf<2) [L840] 0 pthread_t t1951[2]; [L841] 0 int asdf=0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, t1950={10:0}, t1951={7:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] COND TRUE 0 asdf<2 [L841] FCALL, FORK 0 pthread_create(&t1951[asdf], ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1951[asdf], ((void *)0), P2, ((void *)0))=3, t1949={9:0}, t1950={10:0}, t1951={7:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 asdf++ VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, t1950={10:0}, t1951={7:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] COND TRUE 0 asdf<2 [L808] 5 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] FCALL, FORK 0 pthread_create(&t1951[asdf], ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1951[asdf], ((void *)0), P2, ((void *)0))=4, t1949={9:0}, t1950={10:0}, t1951={7:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 asdf++ VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1949={9:0}, t1950={10:0}, t1951={7:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L811] 5 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L814] EXPR 5 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 5 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 5 \read(z) [L814] EXPR 5 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 5 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 5 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 5 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 5 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 5 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 5 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L821] 5 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 5 return 0; [L841] COND FALSE 0 !(asdf<2) [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, main$tmp_guard0=1, main$tmp_guard1=0, t1949={9:0}, t1950={10:0}, t1951={7:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 164 locations, 4 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: 5.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 10 procedures, 186 locations, 4 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.6s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 4 mSDtfsCounter, 668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=5, InterpolantAutomatonStates: 28, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 421 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1395 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 138/158 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 10 procedures, 186 locations, 4 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: 320.9s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 303.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2771 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2585 mSDsluCounter, 2484 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2444 mSDsCounter, 629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5034 IncrementalHoareTripleChecker+Invalid, 5663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 629 mSolverCounterUnsat, 40 mSDtfsCounter, 5034 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 419 SyntacticMatches, 7 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2490occurred in iteration=14, InterpolantAutomatonStates: 108, 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.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 697 NumberOfCodeBlocks, 697 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 6390 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3032 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 30 InterpolantComputations, 8 PerfectInterpolantSequences, 282/366 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! [2023-08-04 00:22:03,165 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...