/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:13:26,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:13:26,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:13:26,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:13:26,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:13:26,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:13:26,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:13:26,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:13:26,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:13:26,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:13:26,981 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:13:26,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:13:26,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:13:26,983 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:13:26,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:13:26,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:13:26,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:13:26,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:13:26,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:13:26,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:13:26,985 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:13:26,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:13:26,986 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:13:26,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:13:26,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:13:26,987 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:13:26,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:13:26,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:13:26,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:13:26,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:13:26,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:13:26,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:13:26,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:13:26,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:13:26,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:13:26,990 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:13:27,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:13:27,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:13:27,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:13:27,331 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:13:27,332 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:13:27,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-08-26 18:13:28,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:13:28,705 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:13:28,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-08-26 18:13:28,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c3e7019/5ead9a73669749bab9e438f5d3520f00/FLAG1e41461fa [2023-08-26 18:13:28,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c3e7019/5ead9a73669749bab9e438f5d3520f00 [2023-08-26 18:13:28,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:13:28,746 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:13:28,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:13:28,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:13:28,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:13:28,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:13:28" (1/1) ... [2023-08-26 18:13:28,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25efb146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:28, skipping insertion in model container [2023-08-26 18:13:28,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:13:28" (1/1) ... [2023-08-26 18:13:28,816 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:13:29,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:13:29,207 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:13:29,231 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:13:29,232 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:13:29,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:13:29,316 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:13:29,316 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:13:29,322 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:13:29,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29 WrapperNode [2023-08-26 18:13:29,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:13:29,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:13:29,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:13:29,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:13:29,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,400 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-26 18:13:29,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:13:29,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:13:29,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:13:29,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:13:29,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:13:29,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:13:29,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:13:29,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:13:29,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (1/1) ... [2023-08-26 18:13:29,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:13:29,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:13:29,474 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-26 18:13:29,497 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-26 18:13:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:13:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:13:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:13:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:13:29,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:13:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:13:29,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:13:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:13:29,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:13:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:13:29,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:13:29,512 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:13:29,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:13:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:13:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:13:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:13:29,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:13:29,514 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:13:29,670 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:13:29,671 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:13:30,046 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:13:30,116 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:13:30,117 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:13:30,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:13:30 BoogieIcfgContainer [2023-08-26 18:13:30,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:13:30,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:13:30,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:13:30,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:13:30,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:13:28" (1/3) ... [2023-08-26 18:13:30,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17642f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:13:30, skipping insertion in model container [2023-08-26 18:13:30,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:29" (2/3) ... [2023-08-26 18:13:30,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17642f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:13:30, skipping insertion in model container [2023-08-26 18:13:30,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:13:30" (3/3) ... [2023-08-26 18:13:30,125 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-08-26 18:13:30,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:13:30,140 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:13:30,140 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:13:30,188 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:13:30,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 18:13:30,266 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 18:13:30,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:13:30,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 18:13:30,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 18:13:30,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 18:13:30,279 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:13:30,286 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 18:13:30,289 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 18:13:30,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 18:13:30,314 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 18:13:30,315 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:13:30,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-26 18:13:30,318 INFO L119 LiptonReduction]: Number of co-enabled transitions 3396 [2023-08-26 18:13:35,159 INFO L134 LiptonReduction]: Checked pairs total: 9774 [2023-08-26 18:13:35,159 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-26 18:13:35,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:13:35,176 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@30640028, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:13:35,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:13:35,179 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:13:35,179 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 18:13:35,179 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:13:35,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:35,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:13:35,180 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:35,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-08-26 18:13:35,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:35,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244709649] [2023-08-26 18:13:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:35,293 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-26 18:13:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:35,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244709649] [2023-08-26 18:13:35,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244709649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:35,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:35,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:13:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835695258] [2023-08-26 18:13:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:35,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:13:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:35,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:13:35,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:13:35,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 267 [2023-08-26 18:13:35,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 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-26 18:13:35,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:35,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 267 [2023-08-26 18:13:35,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:36,387 INFO L124 PetriNetUnfolderBase]: 5973/8260 cut-off events. [2023-08-26 18:13:36,388 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-08-26 18:13:36,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16578 conditions, 8260 events. 5973/8260 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 42326 event pairs, 5973 based on Foata normal form. 0/7335 useless extension candidates. Maximal degree in co-relation 16566. Up to 8103 conditions per place. [2023-08-26 18:13:36,448 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 18:13:36,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-26 18:13:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:13:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:13:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2023-08-26 18:13:36,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5411985018726592 [2023-08-26 18:13:36,462 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2023-08-26 18:13:36,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2023-08-26 18:13:36,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:36,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2023-08-26 18:13:36,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 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-26 18:13:36,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-26 18:13:36,471 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-26 18:13:36,473 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 289 transitions. [2023-08-26 18:13:36,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-26 18:13:36,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:13:36,479 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 18:13:36,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 18:13:36,483 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 18:13:36,483 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 18:13:36,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 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-26 18:13:36,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:36,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 18:13:36,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:13:36,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:36,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 570750210, now seen corresponding path program 1 times [2023-08-26 18:13:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568996152] [2023-08-26 18:13:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:36,818 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-26 18:13:36,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:36,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568996152] [2023-08-26 18:13:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568996152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:36,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:13:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161767031] [2023-08-26 18:13:36,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:36,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:13:36,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:36,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:13:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:13:36,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 267 [2023-08-26 18:13:36,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-26 18:13:36,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:36,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 267 [2023-08-26 18:13:36,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:37,492 INFO L124 PetriNetUnfolderBase]: 4695/6856 cut-off events. [2023-08-26 18:13:37,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:13:37,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13429 conditions, 6856 events. 4695/6856 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39817 event pairs, 861 based on Foata normal form. 0/6548 useless extension candidates. Maximal degree in co-relation 13426. Up to 5107 conditions per place. [2023-08-26 18:13:37,543 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-26 18:13:37,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 192 flow [2023-08-26 18:13:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:13:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:13:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-26 18:13:37,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268414481897628 [2023-08-26 18:13:37,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-26 18:13:37,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-26 18:13:37,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:37,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-26 18:13:37,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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-26 18:13:37,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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-26 18:13:37,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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-26 18:13:37,557 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 422 transitions. [2023-08-26 18:13:37,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 192 flow [2023-08-26 18:13:37,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:13:37,561 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-26 18:13:37,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-26 18:13:37,561 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 18:13:37,563 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-26 18:13:37,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-26 18:13:37,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:37,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:37,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:13:37,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:37,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1091005756, now seen corresponding path program 1 times [2023-08-26 18:13:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:37,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479040273] [2023-08-26 18:13:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:37,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:37,780 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-26 18:13:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:37,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479040273] [2023-08-26 18:13:37,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479040273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:37,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:37,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:13:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252945166] [2023-08-26 18:13:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:37,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:13:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:37,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:13:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:13:37,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 267 [2023-08-26 18:13:37,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 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-26 18:13:37,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:37,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 267 [2023-08-26 18:13:37,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:38,502 INFO L124 PetriNetUnfolderBase]: 4855/6974 cut-off events. [2023-08-26 18:13:38,503 INFO L125 PetriNetUnfolderBase]: For 454/454 co-relation queries the response was YES. [2023-08-26 18:13:38,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14293 conditions, 6974 events. 4855/6974 cut-off events. For 454/454 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 36932 event pairs, 1527 based on Foata normal form. 320/7277 useless extension candidates. Maximal degree in co-relation 14289. Up to 3761 conditions per place. [2023-08-26 18:13:38,533 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 34 selfloop transitions, 2 changer transitions 23/62 dead transitions. [2023-08-26 18:13:38,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 260 flow [2023-08-26 18:13:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:13:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:13:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-26 18:13:38,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026217228464419 [2023-08-26 18:13:38,536 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-26 18:13:38,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-26 18:13:38,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:38,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-26 18:13:38,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 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-26 18:13:38,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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-26 18:13:38,541 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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-26 18:13:38,541 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 671 transitions. [2023-08-26 18:13:38,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 260 flow [2023-08-26 18:13:38,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:13:38,544 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 76 flow [2023-08-26 18:13:38,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-08-26 18:13:38,545 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-26 18:13:38,545 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 76 flow [2023-08-26 18:13:38,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 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-26 18:13:38,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:38,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:38,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:13:38,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:38,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1044899203, now seen corresponding path program 1 times [2023-08-26 18:13:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:38,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738487881] [2023-08-26 18:13:38,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:38,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:38,794 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-26 18:13:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738487881] [2023-08-26 18:13:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738487881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:38,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:13:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020744373] [2023-08-26 18:13:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:38,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:13:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:13:38,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:13:38,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 267 [2023-08-26 18:13:38,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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-26 18:13:38,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:38,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 267 [2023-08-26 18:13:38,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:39,295 INFO L124 PetriNetUnfolderBase]: 3024/4409 cut-off events. [2023-08-26 18:13:39,296 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2023-08-26 18:13:39,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9386 conditions, 4409 events. 3024/4409 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 22634 event pairs, 604 based on Foata normal form. 256/4610 useless extension candidates. Maximal degree in co-relation 9379. Up to 3051 conditions per place. [2023-08-26 18:13:39,315 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 37 selfloop transitions, 5 changer transitions 25/71 dead transitions. [2023-08-26 18:13:39,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 71 transitions, 302 flow [2023-08-26 18:13:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:13:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:13:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-26 18:13:39,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49737827715355803 [2023-08-26 18:13:39,317 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-26 18:13:39,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-26 18:13:39,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:39,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-26 18:13:39,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 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-26 18:13:39,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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-26 18:13:39,322 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 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-26 18:13:39,322 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 76 flow. Second operand 5 states and 664 transitions. [2023-08-26 18:13:39,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 71 transitions, 302 flow [2023-08-26 18:13:39,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 71 transitions, 294 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 18:13:39,338 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 113 flow [2023-08-26 18:13:39,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-26 18:13:39,338 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-26 18:13:39,339 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 113 flow [2023-08-26 18:13:39,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 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-26 18:13:39,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:39,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:39,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:13:39,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:39,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -392070446, now seen corresponding path program 1 times [2023-08-26 18:13:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615916401] [2023-08-26 18:13:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:39,555 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-26 18:13:39,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615916401] [2023-08-26 18:13:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615916401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:39,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:39,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:13:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007148575] [2023-08-26 18:13:39,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:39,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:13:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:39,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:13:39,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:13:39,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 267 [2023-08-26 18:13:39,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 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-26 18:13:39,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:39,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 267 [2023-08-26 18:13:39,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:39,922 INFO L124 PetriNetUnfolderBase]: 1674/2600 cut-off events. [2023-08-26 18:13:39,923 INFO L125 PetriNetUnfolderBase]: For 917/917 co-relation queries the response was YES. [2023-08-26 18:13:39,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7038 conditions, 2600 events. 1674/2600 cut-off events. For 917/917 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13213 event pairs, 328 based on Foata normal form. 175/2750 useless extension candidates. Maximal degree in co-relation 7030. Up to 999 conditions per place. [2023-08-26 18:13:39,938 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 49 selfloop transitions, 9 changer transitions 25/87 dead transitions. [2023-08-26 18:13:39,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 449 flow [2023-08-26 18:13:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:13:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:13:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-08-26 18:13:39,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49875156054931336 [2023-08-26 18:13:39,940 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-08-26 18:13:39,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-08-26 18:13:39,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:39,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-08-26 18:13:39,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 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-26 18:13:39,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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-26 18:13:39,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 267.0) internal successors, (1869), 7 states have internal predecessors, (1869), 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-26 18:13:39,948 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 113 flow. Second operand 6 states and 799 transitions. [2023-08-26 18:13:39,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 449 flow [2023-08-26 18:13:39,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 87 transitions, 442 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:13:39,961 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 178 flow [2023-08-26 18:13:39,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-26 18:13:39,961 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-26 18:13:39,962 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 178 flow [2023-08-26 18:13:39,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 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-26 18:13:39,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:39,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:39,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:13:39,962 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:39,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1860983748, now seen corresponding path program 1 times [2023-08-26 18:13:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831193836] [2023-08-26 18:13:39,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:40,212 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-26 18:13:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831193836] [2023-08-26 18:13:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831193836] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:40,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:40,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:13:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65108146] [2023-08-26 18:13:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:40,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:13:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:40,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:13:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:13:40,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-26 18:13:40,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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-26 18:13:40,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:40,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-26 18:13:40,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:41,013 INFO L124 PetriNetUnfolderBase]: 4366/6591 cut-off events. [2023-08-26 18:13:41,013 INFO L125 PetriNetUnfolderBase]: For 8160/8160 co-relation queries the response was YES. [2023-08-26 18:13:41,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20180 conditions, 6591 events. 4366/6591 cut-off events. For 8160/8160 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 34691 event pairs, 365 based on Foata normal form. 132/6723 useless extension candidates. Maximal degree in co-relation 20170. Up to 3238 conditions per place. [2023-08-26 18:13:41,055 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 110 selfloop transitions, 14 changer transitions 43/167 dead transitions. [2023-08-26 18:13:41,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 167 transitions, 1133 flow [2023-08-26 18:13:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:13:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:13:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1151 transitions. [2023-08-26 18:13:41,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789846025801082 [2023-08-26 18:13:41,058 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1151 transitions. [2023-08-26 18:13:41,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1151 transitions. [2023-08-26 18:13:41,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:41,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1151 transitions. [2023-08-26 18:13:41,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.88888888888889) internal successors, (1151), 9 states have internal predecessors, (1151), 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-26 18:13:41,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 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-26 18:13:41,066 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 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-26 18:13:41,066 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 178 flow. Second operand 9 states and 1151 transitions. [2023-08-26 18:13:41,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 167 transitions, 1133 flow [2023-08-26 18:13:41,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 167 transitions, 977 flow, removed 63 selfloop flow, removed 4 redundant places. [2023-08-26 18:13:41,127 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 268 flow [2023-08-26 18:13:41,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=268, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-26 18:13:41,128 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-26 18:13:41,128 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 268 flow [2023-08-26 18:13:41,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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-26 18:13:41,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:41,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:41,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:13:41,129 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:41,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1845246, now seen corresponding path program 2 times [2023-08-26 18:13:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839437647] [2023-08-26 18:13:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:41,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:41,320 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-26 18:13:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:41,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839437647] [2023-08-26 18:13:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839437647] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:41,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:41,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:13:41,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023323106] [2023-08-26 18:13:41,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:41,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:13:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:13:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:13:41,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-26 18:13:41,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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-26 18:13:41,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:41,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-26 18:13:41,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:42,221 INFO L124 PetriNetUnfolderBase]: 5344/8131 cut-off events. [2023-08-26 18:13:42,221 INFO L125 PetriNetUnfolderBase]: For 13979/13979 co-relation queries the response was YES. [2023-08-26 18:13:42,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28900 conditions, 8131 events. 5344/8131 cut-off events. For 13979/13979 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 45213 event pairs, 537 based on Foata normal form. 90/8221 useless extension candidates. Maximal degree in co-relation 28885. Up to 3174 conditions per place. [2023-08-26 18:13:42,271 INFO L140 encePairwiseOnDemand]: 257/267 looper letters, 122 selfloop transitions, 15 changer transitions 28/165 dead transitions. [2023-08-26 18:13:42,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 165 transitions, 1193 flow [2023-08-26 18:13:42,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:13:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:13:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2023-08-26 18:13:42,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48635634028892455 [2023-08-26 18:13:42,274 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2023-08-26 18:13:42,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2023-08-26 18:13:42,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:42,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2023-08-26 18:13:42,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 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-26 18:13:42,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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-26 18:13:42,335 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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-26 18:13:42,335 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 268 flow. Second operand 7 states and 909 transitions. [2023-08-26 18:13:42,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 165 transitions, 1193 flow [2023-08-26 18:13:42,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 165 transitions, 1183 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 18:13:42,353 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 337 flow [2023-08-26 18:13:42,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2023-08-26 18:13:42,354 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-26 18:13:42,354 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 337 flow [2023-08-26 18:13:42,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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-26 18:13:42,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:42,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:42,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:13:42,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:42,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash -816215618, now seen corresponding path program 3 times [2023-08-26 18:13:42,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:42,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975518955] [2023-08-26 18:13:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:42,594 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-26 18:13:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975518955] [2023-08-26 18:13:42,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975518955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:42,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:42,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:13:42,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240015236] [2023-08-26 18:13:42,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:42,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:13:42,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:42,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:13:42,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:13:42,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 267 [2023-08-26 18:13:42,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 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-26 18:13:42,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:42,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 267 [2023-08-26 18:13:42,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:43,216 INFO L124 PetriNetUnfolderBase]: 3271/5257 cut-off events. [2023-08-26 18:13:43,217 INFO L125 PetriNetUnfolderBase]: For 8307/8366 co-relation queries the response was YES. [2023-08-26 18:13:43,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18113 conditions, 5257 events. 3271/5257 cut-off events. For 8307/8366 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 31349 event pairs, 572 based on Foata normal form. 329/5494 useless extension candidates. Maximal degree in co-relation 18095. Up to 1684 conditions per place. [2023-08-26 18:13:43,248 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 88 selfloop transitions, 18 changer transitions 19/139 dead transitions. [2023-08-26 18:13:43,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 139 transitions, 1074 flow [2023-08-26 18:13:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:13:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:13:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 932 transitions. [2023-08-26 18:13:43,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986623863028357 [2023-08-26 18:13:43,251 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 932 transitions. [2023-08-26 18:13:43,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 932 transitions. [2023-08-26 18:13:43,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:43,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 932 transitions. [2023-08-26 18:13:43,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 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-26 18:13:43,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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-26 18:13:43,257 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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-26 18:13:43,257 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 337 flow. Second operand 7 states and 932 transitions. [2023-08-26 18:13:43,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 139 transitions, 1074 flow [2023-08-26 18:13:43,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 139 transitions, 1009 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 18:13:43,340 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 446 flow [2023-08-26 18:13:43,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-08-26 18:13:43,341 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-08-26 18:13:43,341 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 446 flow [2023-08-26 18:13:43,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 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-26 18:13:43,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:43,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 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-26 18:13:43,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:13:43,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:43,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2107978843, now seen corresponding path program 1 times [2023-08-26 18:13:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951456954] [2023-08-26 18:13:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:43,515 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-26 18:13:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951456954] [2023-08-26 18:13:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951456954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:43,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:13:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493373182] [2023-08-26 18:13:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:43,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:13:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:43,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:13:43,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:13:43,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 267 [2023-08-26 18:13:43,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 446 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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-26 18:13:43,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:43,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 267 [2023-08-26 18:13:43,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:44,379 INFO L124 PetriNetUnfolderBase]: 5005/7930 cut-off events. [2023-08-26 18:13:44,380 INFO L125 PetriNetUnfolderBase]: For 18449/18485 co-relation queries the response was YES. [2023-08-26 18:13:44,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31107 conditions, 7930 events. 5005/7930 cut-off events. For 18449/18485 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 48371 event pairs, 1573 based on Foata normal form. 31/7884 useless extension candidates. Maximal degree in co-relation 31087. Up to 4100 conditions per place. [2023-08-26 18:13:44,423 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 68 selfloop transitions, 6 changer transitions 30/110 dead transitions. [2023-08-26 18:13:44,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 1020 flow [2023-08-26 18:13:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:13:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:13:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-26 18:13:44,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009363295880149 [2023-08-26 18:13:44,426 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-26 18:13:44,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-26 18:13:44,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:44,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-26 18:13:44,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 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-26 18:13:44,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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-26 18:13:44,429 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 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-26 18:13:44,429 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 446 flow. Second operand 4 states and 535 transitions. [2023-08-26 18:13:44,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 1020 flow [2023-08-26 18:13:44,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 885 flow, removed 55 selfloop flow, removed 3 redundant places. [2023-08-26 18:13:44,629 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 375 flow [2023-08-26 18:13:44,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2023-08-26 18:13:44,630 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-08-26 18:13:44,630 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 375 flow [2023-08-26 18:13:44,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 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-26 18:13:44,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:44,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 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-26 18:13:44,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:13:44,631 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:44,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash 102138357, now seen corresponding path program 1 times [2023-08-26 18:13:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:44,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692103185] [2023-08-26 18:13:44,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:45,619 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-26 18:13:45,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:45,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692103185] [2023-08-26 18:13:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692103185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:45,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:45,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:13:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527074808] [2023-08-26 18:13:45,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:45,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:13:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:45,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:13:45,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:13:45,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 267 [2023-08-26 18:13:45,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 375 flow. Second operand has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 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-26 18:13:45,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:45,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 267 [2023-08-26 18:13:45,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:46,851 INFO L124 PetriNetUnfolderBase]: 6664/11267 cut-off events. [2023-08-26 18:13:46,851 INFO L125 PetriNetUnfolderBase]: For 19280/19383 co-relation queries the response was YES. [2023-08-26 18:13:46,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40490 conditions, 11267 events. 6664/11267 cut-off events. For 19280/19383 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 84238 event pairs, 496 based on Foata normal form. 59/11104 useless extension candidates. Maximal degree in co-relation 40468. Up to 3604 conditions per place. [2023-08-26 18:13:46,912 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 130 selfloop transitions, 7 changer transitions 84/231 dead transitions. [2023-08-26 18:13:46,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 231 transitions, 1905 flow [2023-08-26 18:13:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:13:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:13:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1022 transitions. [2023-08-26 18:13:46,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47846441947565543 [2023-08-26 18:13:46,916 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1022 transitions. [2023-08-26 18:13:46,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1022 transitions. [2023-08-26 18:13:46,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:46,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1022 transitions. [2023-08-26 18:13:46,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.75) internal successors, (1022), 8 states have internal predecessors, (1022), 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-26 18:13:46,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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-26 18:13:46,922 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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-26 18:13:46,922 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 375 flow. Second operand 8 states and 1022 transitions. [2023-08-26 18:13:46,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 231 transitions, 1905 flow [2023-08-26 18:13:47,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 231 transitions, 1878 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 18:13:47,192 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 428 flow [2023-08-26 18:13:47,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=428, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2023-08-26 18:13:47,193 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 18:13:47,193 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 428 flow [2023-08-26 18:13:47,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 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-26 18:13:47,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:47,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 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-26 18:13:47,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:13:47,194 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:47,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:47,194 INFO L85 PathProgramCache]: Analyzing trace with hash -949518983, now seen corresponding path program 2 times [2023-08-26 18:13:47,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:47,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276475888] [2023-08-26 18:13:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:47,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:47,419 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-26 18:13:47,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:47,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276475888] [2023-08-26 18:13:47,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276475888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:47,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:47,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:13:47,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266561849] [2023-08-26 18:13:47,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:47,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:13:47,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:47,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:13:47,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:13:47,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 267 [2023-08-26 18:13:47,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 428 flow. Second operand has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-26 18:13:47,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:47,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 267 [2023-08-26 18:13:47,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:48,450 INFO L124 PetriNetUnfolderBase]: 4884/8283 cut-off events. [2023-08-26 18:13:48,450 INFO L125 PetriNetUnfolderBase]: For 19185/19328 co-relation queries the response was YES. [2023-08-26 18:13:48,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31996 conditions, 8283 events. 4884/8283 cut-off events. For 19185/19328 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 59712 event pairs, 583 based on Foata normal form. 206/8319 useless extension candidates. Maximal degree in co-relation 31970. Up to 2568 conditions per place. [2023-08-26 18:13:48,491 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 67 selfloop transitions, 21 changer transitions 60/154 dead transitions. [2023-08-26 18:13:48,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 154 transitions, 1291 flow [2023-08-26 18:13:48,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:13:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:13:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1169 transitions. [2023-08-26 18:13:48,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48647523928422803 [2023-08-26 18:13:48,495 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1169 transitions. [2023-08-26 18:13:48,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1169 transitions. [2023-08-26 18:13:48,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:48,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1169 transitions. [2023-08-26 18:13:48,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.88888888888889) internal successors, (1169), 9 states have internal predecessors, (1169), 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-26 18:13:48,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 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-26 18:13:48,502 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 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-26 18:13:48,502 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 428 flow. Second operand 9 states and 1169 transitions. [2023-08-26 18:13:48,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 154 transitions, 1291 flow [2023-08-26 18:13:48,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 154 transitions, 1232 flow, removed 19 selfloop flow, removed 6 redundant places. [2023-08-26 18:13:48,779 INFO L231 Difference]: Finished difference. Result has 81 places, 51 transitions, 371 flow [2023-08-26 18:13:48,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=371, PETRI_PLACES=81, PETRI_TRANSITIONS=51} [2023-08-26 18:13:48,780 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-26 18:13:48,780 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 51 transitions, 371 flow [2023-08-26 18:13:48,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-26 18:13:48,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:48,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:48,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:13:48,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:48,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash 428677180, now seen corresponding path program 1 times [2023-08-26 18:13:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:48,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504071299] [2023-08-26 18:13:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:48,994 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-26 18:13:48,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:48,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504071299] [2023-08-26 18:13:48,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504071299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:48,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:13:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287755631] [2023-08-26 18:13:48,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:48,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:13:48,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:13:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:13:48,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 267 [2023-08-26 18:13:48,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 51 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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-26 18:13:48,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:48,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 267 [2023-08-26 18:13:48,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:49,451 INFO L124 PetriNetUnfolderBase]: 2013/3311 cut-off events. [2023-08-26 18:13:49,452 INFO L125 PetriNetUnfolderBase]: For 9161/9161 co-relation queries the response was YES. [2023-08-26 18:13:49,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14134 conditions, 3311 events. 2013/3311 cut-off events. For 9161/9161 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 17499 event pairs, 691 based on Foata normal form. 1/3312 useless extension candidates. Maximal degree in co-relation 14109. Up to 1854 conditions per place. [2023-08-26 18:13:49,468 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 55 selfloop transitions, 5 changer transitions 57/117 dead transitions. [2023-08-26 18:13:49,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 1053 flow [2023-08-26 18:13:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:13:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:13:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-26 18:13:49,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579989299090423 [2023-08-26 18:13:49,471 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-26 18:13:49,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-26 18:13:49,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:49,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-26 18:13:49,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 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-26 18:13:49,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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-26 18:13:49,476 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 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-26 18:13:49,476 INFO L175 Difference]: Start difference. First operand has 81 places, 51 transitions, 371 flow. Second operand 7 states and 856 transitions. [2023-08-26 18:13:49,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 1053 flow [2023-08-26 18:13:49,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 117 transitions, 848 flow, removed 54 selfloop flow, removed 14 redundant places. [2023-08-26 18:13:49,523 INFO L231 Difference]: Finished difference. Result has 71 places, 42 transitions, 226 flow [2023-08-26 18:13:49,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2023-08-26 18:13:49,524 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-26 18:13:49,524 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 226 flow [2023-08-26 18:13:49,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 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-26 18:13:49,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:49,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:49,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:13:49,525 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:49,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash -911393578, now seen corresponding path program 2 times [2023-08-26 18:13:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:49,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85073518] [2023-08-26 18:13:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:50,373 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-26 18:13:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85073518] [2023-08-26 18:13:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85073518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:13:50,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905356240] [2023-08-26 18:13:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:50,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:13:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:50,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:13:50,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:13:50,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 267 [2023-08-26 18:13:50,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 42 transitions, 226 flow. Second operand has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 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-26 18:13:50,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:50,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 267 [2023-08-26 18:13:50,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:50,705 INFO L124 PetriNetUnfolderBase]: 596/1011 cut-off events. [2023-08-26 18:13:50,706 INFO L125 PetriNetUnfolderBase]: For 1550/1550 co-relation queries the response was YES. [2023-08-26 18:13:50,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 1011 events. 596/1011 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4170 event pairs, 74 based on Foata normal form. 1/1012 useless extension candidates. Maximal degree in co-relation 3713. Up to 500 conditions per place. [2023-08-26 18:13:50,710 INFO L140 encePairwiseOnDemand]: 256/267 looper letters, 75 selfloop transitions, 8 changer transitions 37/120 dead transitions. [2023-08-26 18:13:50,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 120 transitions, 870 flow [2023-08-26 18:13:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:13:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:13:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 927 transitions. [2023-08-26 18:13:50,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4339887640449438 [2023-08-26 18:13:50,713 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 927 transitions. [2023-08-26 18:13:50,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 927 transitions. [2023-08-26 18:13:50,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:50,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 927 transitions. [2023-08-26 18:13:50,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 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-26 18:13:50,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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-26 18:13:50,719 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 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-26 18:13:50,719 INFO L175 Difference]: Start difference. First operand has 71 places, 42 transitions, 226 flow. Second operand 8 states and 927 transitions. [2023-08-26 18:13:50,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 120 transitions, 870 flow [2023-08-26 18:13:50,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 120 transitions, 793 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-08-26 18:13:50,727 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 248 flow [2023-08-26 18:13:50,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-08-26 18:13:50,727 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-08-26 18:13:50,728 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 248 flow [2023-08-26 18:13:50,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 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-26 18:13:50,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:50,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:50,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:13:50,728 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:50,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2026191876, now seen corresponding path program 3 times [2023-08-26 18:13:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:50,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574517241] [2023-08-26 18:13:50,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:13:50,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:13:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:13:50,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:13:50,865 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:13:50,866 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:13:50,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:13:50,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:13:50,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:13:50,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:13:50,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:13:50,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:13:50,871 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:50,877 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:13:50,877 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:13:50,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:13:50 BasicIcfg [2023-08-26 18:13:50,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:13:50,974 INFO L158 Benchmark]: Toolchain (without parser) took 22228.44ms. Allocated memory was 417.3MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 392.3MB in the beginning and 657.6MB in the end (delta: -265.3MB). Peak memory consumption was 755.6MB. Max. memory is 16.0GB. [2023-08-26 18:13:50,974 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 417.3MB. Free memory is still 393.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:13:50,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.35ms. Allocated memory is still 417.3MB. Free memory was 392.0MB in the beginning and 368.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:50,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.99ms. Allocated memory is still 417.3MB. Free memory was 368.3MB in the beginning and 366.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:50,975 INFO L158 Benchmark]: Boogie Preprocessor took 25.67ms. Allocated memory is still 417.3MB. Free memory was 366.0MB in the beginning and 363.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:50,975 INFO L158 Benchmark]: RCFGBuilder took 680.62ms. Allocated memory is still 417.3MB. Free memory was 363.6MB in the beginning and 372.4MB in the end (delta: -8.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. [2023-08-26 18:13:50,976 INFO L158 Benchmark]: TraceAbstraction took 20853.64ms. Allocated memory was 417.3MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 371.8MB in the beginning and 657.6MB in the end (delta: -285.8MB). Peak memory consumption was 736.6MB. Max. memory is 16.0GB. [2023-08-26 18:13:50,977 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 417.3MB. Free memory is still 393.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 576.35ms. Allocated memory is still 417.3MB. Free memory was 392.0MB in the beginning and 368.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.99ms. Allocated memory is still 417.3MB. Free memory was 368.3MB in the beginning and 366.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.67ms. Allocated memory is still 417.3MB. Free memory was 366.0MB in the beginning and 363.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 680.62ms. Allocated memory is still 417.3MB. Free memory was 363.6MB in the beginning and 372.4MB in the end (delta: -8.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. * TraceAbstraction took 20853.64ms. Allocated memory was 417.3MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 371.8MB in the beginning and 657.6MB in the end (delta: -285.8MB). Peak memory consumption was 736.6MB. 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.9s, 148 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 3396 CoEnabledTransitionPairs, 8 FixpointIterations, 47 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 125 TotalNumberOfCompositions, 9774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4534, independent: 4279, independent conditional: 0, independent unconditional: 4279, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1769, independent: 1728, independent conditional: 0, independent unconditional: 1728, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4534, independent: 2551, independent conditional: 0, independent unconditional: 2551, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 1769, unknown conditional: 0, unknown unconditional: 1769] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-2, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-1, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=1, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix026_power.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 15 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: 20.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 631 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 631 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2078 IncrementalHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 40 mSDtfsCounter, 2078 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=8, InterpolantAutomatonStates: 80, 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.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:13:51,004 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...