/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/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:15:59,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:15:59,581 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:15:59,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:15:59,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:15:59,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:15:59,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:15:59,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:15:59,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:15:59,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:15:59,623 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:15:59,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:15:59,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:15:59,624 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:15:59,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:15:59,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:15:59,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:15:59,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:15:59,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:15:59,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:15:59,626 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:15:59,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:15:59,627 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:15:59,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:15:59,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:15:59,628 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:15:59,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:15:59,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:15:59,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:15:59,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:15:59,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:15:59,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:15:59,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:15:59,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:15:59,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:15:59,630 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:15:59,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:15:59,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:15:59,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:15:59,982 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:15:59,983 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:15:59,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2023-08-26 18:16:01,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:16:01,610 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:16:01,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2023-08-26 18:16:01,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02428b37e/2c7d176eeb5f410eb843f7bc2d698056/FLAGb663fa6c8 [2023-08-26 18:16:01,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02428b37e/2c7d176eeb5f410eb843f7bc2d698056 [2023-08-26 18:16:01,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:16:01,651 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:16:01,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:16:01,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:16:01,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:16:01,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:16:01" (1/1) ... [2023-08-26 18:16:01,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275ad3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:01, skipping insertion in model container [2023-08-26 18:16:01,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:16:01" (1/1) ... [2023-08-26 18:16:01,712 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:16:02,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:16:02,082 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:16:02,099 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:16:02,100 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:16:02,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:16:02,163 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:16:02,163 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:16:02,169 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:16:02,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02 WrapperNode [2023-08-26 18:16:02,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:16:02,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:16:02,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:16:02,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:16:02,177 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:16:02" (1/1) ... [2023-08-26 18:16:02,191 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:16:02" (1/1) ... [2023-08-26 18:16:02,223 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-08-26 18:16:02,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:16:02,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:16:02,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:16:02,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:16:02,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:16:02,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:16:02,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:16:02,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:16:02,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (1/1) ... [2023-08-26 18:16:02,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:16:02,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:16:02,335 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:16:02,345 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:16:02,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:16:02,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:16:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:16:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:16:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:16:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:16:02,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:16:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:16:02,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:16:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:16:02,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:16:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:16:02,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:16:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:16:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:16:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:16:02,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:16:02,378 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:16:02,519 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:16:02,520 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:16:02,828 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:16:02,949 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:16:02,949 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:16:02,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:16:02 BoogieIcfgContainer [2023-08-26 18:16:02,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:16:02,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:16:02,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:16:02,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:16:02,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:16:01" (1/3) ... [2023-08-26 18:16:02,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c3d0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:16:02, skipping insertion in model container [2023-08-26 18:16:02,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:02" (2/3) ... [2023-08-26 18:16:02,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c3d0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:16:02, skipping insertion in model container [2023-08-26 18:16:02,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:16:02" (3/3) ... [2023-08-26 18:16:02,962 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2023-08-26 18:16:02,978 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:16:02,978 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:16:02,979 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:16:03,052 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:16:03,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 18:16:03,175 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 18:16:03,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:16:03,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 18:16:03,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 18:16:03,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-26 18:16:03,194 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:16:03,202 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 18:16:03,206 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 18:16:03,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-26 18:16:03,253 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 18:16:03,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:16:03,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 18:16:03,259 INFO L119 LiptonReduction]: Number of co-enabled transitions 3490 [2023-08-26 18:16:08,537 INFO L134 LiptonReduction]: Checked pairs total: 9693 [2023-08-26 18:16:08,538 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-08-26 18:16:08,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:16:08,553 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;@36c32ca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:16:08,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:16:08,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:16:08,554 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:16:08,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:16:08,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:08,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:16:08,555 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:08,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 628, now seen corresponding path program 1 times [2023-08-26 18:16:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:08,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627258051] [2023-08-26 18:16:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:08,669 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:16:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:08,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627258051] [2023-08-26 18:16:08,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627258051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:08,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:08,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:16:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186579671] [2023-08-26 18:16:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:08,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:16:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:08,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:16:08,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:16:08,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 291 [2023-08-26 18:16:08,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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:16:08,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:08,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 291 [2023-08-26 18:16:08,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:09,650 INFO L124 PetriNetUnfolderBase]: 4530/6302 cut-off events. [2023-08-26 18:16:09,651 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-26 18:16:09,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12641 conditions, 6302 events. 4530/6302 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32039 event pairs, 4530 based on Foata normal form. 0/5593 useless extension candidates. Maximal degree in co-relation 12629. Up to 6182 conditions per place. [2023-08-26 18:16:09,696 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-26 18:16:09,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-26 18:16:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:16:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:16:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2023-08-26 18:16:09,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965635738831615 [2023-08-26 18:16:09,717 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2023-08-26 18:16:09,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2023-08-26 18:16:09,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:09,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2023-08-26 18:16:09,724 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:16:09,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 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:16:09,728 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 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:16:09,730 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 2 states and 289 transitions. [2023-08-26 18:16:09,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-26 18:16:09,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:16:09,735 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-26 18:16:09,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-26 18:16:09,740 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 18:16:09,740 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-26 18:16:09,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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:16:09,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:09,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:09,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:16:09,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:09,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1409946044, now seen corresponding path program 1 times [2023-08-26 18:16:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:09,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645927015] [2023-08-26 18:16:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:10,071 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:16:10,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:10,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645927015] [2023-08-26 18:16:10,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645927015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:10,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:10,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:16:10,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739727179] [2023-08-26 18:16:10,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:10,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:16:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:10,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:16:10,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:16:10,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2023-08-26 18:16:10,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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:16:10,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:10,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2023-08-26 18:16:10,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:10,707 INFO L124 PetriNetUnfolderBase]: 3567/5249 cut-off events. [2023-08-26 18:16:10,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:16:10,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10274 conditions, 5249 events. 3567/5249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29477 event pairs, 678 based on Foata normal form. 0/4993 useless extension candidates. Maximal degree in co-relation 10271. Up to 3862 conditions per place. [2023-08-26 18:16:10,733 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-26 18:16:10,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 174 flow [2023-08-26 18:16:10,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:16:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:16:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 18:16:10,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822451317296678 [2023-08-26 18:16:10,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 18:16:10,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 18:16:10,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:10,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 18:16:10,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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:16:10,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:16:10,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 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:16:10,744 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 421 transitions. [2023-08-26 18:16:10,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 174 flow [2023-08-26 18:16:10,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:16:10,748 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-26 18:16:10,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, 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=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-26 18:16:10,749 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 18:16:10,750 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-26 18:16:10,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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:16:10,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:10,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:10,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:16:10,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:10,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -881577458, now seen corresponding path program 1 times [2023-08-26 18:16:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:10,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655919145] [2023-08-26 18:16:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:11,232 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:16:11,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655919145] [2023-08-26 18:16:11,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655919145] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:11,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:11,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:16:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096635513] [2023-08-26 18:16:11,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:11,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:16:11,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:11,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:16:11,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:16:11,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 291 [2023-08-26 18:16:11,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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:16:11,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:11,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 291 [2023-08-26 18:16:11,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:12,353 INFO L124 PetriNetUnfolderBase]: 8789/12038 cut-off events. [2023-08-26 18:16:12,353 INFO L125 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2023-08-26 18:16:12,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24971 conditions, 12038 events. 8789/12038 cut-off events. For 632/632 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 57137 event pairs, 2349 based on Foata normal form. 400/12438 useless extension candidates. Maximal degree in co-relation 24967. Up to 7461 conditions per place. [2023-08-26 18:16:12,428 INFO L140 encePairwiseOnDemand]: 279/291 looper letters, 43 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-08-26 18:16:12,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 232 flow [2023-08-26 18:16:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:16:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:16:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-08-26 18:16:12,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42955326460481097 [2023-08-26 18:16:12,431 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-08-26 18:16:12,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-08-26 18:16:12,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:12,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-08-26 18:16:12,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:16:12,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:12,436 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:12,436 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 4 states and 500 transitions. [2023-08-26 18:16:12,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 232 flow [2023-08-26 18:16:12,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:16:12,440 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 146 flow [2023-08-26 18:16:12,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-26 18:16:12,441 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2023-08-26 18:16:12,441 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 146 flow [2023-08-26 18:16:12,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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:16:12,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:12,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:12,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:16:12,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:12,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1162858517, now seen corresponding path program 1 times [2023-08-26 18:16:12,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:12,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084950417] [2023-08-26 18:16:12,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:12,900 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:16:12,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:12,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084950417] [2023-08-26 18:16:12,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084950417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:12,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:12,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:16:12,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828873713] [2023-08-26 18:16:12,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:12,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:16:12,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:16:12,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:16:12,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 291 [2023-08-26 18:16:12,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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:16:12,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:12,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 291 [2023-08-26 18:16:12,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:14,077 INFO L124 PetriNetUnfolderBase]: 9587/13160 cut-off events. [2023-08-26 18:16:14,077 INFO L125 PetriNetUnfolderBase]: For 6449/6449 co-relation queries the response was YES. [2023-08-26 18:16:14,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36114 conditions, 13160 events. 9587/13160 cut-off events. For 6449/6449 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 66770 event pairs, 1105 based on Foata normal form. 40/13200 useless extension candidates. Maximal degree in co-relation 36108. Up to 9929 conditions per place. [2023-08-26 18:16:14,134 INFO L140 encePairwiseOnDemand]: 279/291 looper letters, 54 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2023-08-26 18:16:14,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 75 transitions, 424 flow [2023-08-26 18:16:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:16:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:16:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-26 18:16:14,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43986254295532645 [2023-08-26 18:16:14,137 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-26 18:16:14,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-26 18:16:14,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:14,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-26 18:16:14,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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:16:14,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:14,141 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:14,142 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 146 flow. Second operand 4 states and 512 transitions. [2023-08-26 18:16:14,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 75 transitions, 424 flow [2023-08-26 18:16:14,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:16:14,148 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 268 flow [2023-08-26 18:16:14,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2023-08-26 18:16:14,149 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-26 18:16:14,149 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 268 flow [2023-08-26 18:16:14,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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:16:14,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:14,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:14,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:16:14,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:14,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1692308242, now seen corresponding path program 1 times [2023-08-26 18:16:14,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:14,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132559472] [2023-08-26 18:16:14,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:14,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:14,509 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:16:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132559472] [2023-08-26 18:16:14,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132559472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:14,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:16:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500611062] [2023-08-26 18:16:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:14,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:16:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:16:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:16:14,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 291 [2023-08-26 18:16:14,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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:16:14,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:14,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 291 [2023-08-26 18:16:14,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:15,632 INFO L124 PetriNetUnfolderBase]: 9685/13290 cut-off events. [2023-08-26 18:16:15,632 INFO L125 PetriNetUnfolderBase]: For 14626/14626 co-relation queries the response was YES. [2023-08-26 18:16:15,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45077 conditions, 13290 events. 9685/13290 cut-off events. For 14626/14626 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 66136 event pairs, 2113 based on Foata normal form. 20/13310 useless extension candidates. Maximal degree in co-relation 45068. Up to 12621 conditions per place. [2023-08-26 18:16:15,703 INFO L140 encePairwiseOnDemand]: 282/291 looper letters, 78 selfloop transitions, 22 changer transitions 0/100 dead transitions. [2023-08-26 18:16:15,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 781 flow [2023-08-26 18:16:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:16:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:16:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-26 18:16:15,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44673539518900346 [2023-08-26 18:16:15,706 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-26 18:16:15,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-26 18:16:15,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:15,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-26 18:16:15,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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:16:15,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:15,711 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:15,711 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 268 flow. Second operand 4 states and 520 transitions. [2023-08-26 18:16:15,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 781 flow [2023-08-26 18:16:15,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 100 transitions, 781 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:16:15,722 INFO L231 Difference]: Finished difference. Result has 52 places, 67 transitions, 515 flow [2023-08-26 18:16:15,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=52, PETRI_TRANSITIONS=67} [2023-08-26 18:16:15,723 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-26 18:16:15,723 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 67 transitions, 515 flow [2023-08-26 18:16:15,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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:16:15,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:15,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:15,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:16:15,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:15,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1233746533, now seen corresponding path program 1 times [2023-08-26 18:16:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:15,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660038312] [2023-08-26 18:16:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:16,121 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:16:16,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:16,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660038312] [2023-08-26 18:16:16,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660038312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:16,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:16,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:16:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771600423] [2023-08-26 18:16:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:16,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:16:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:16:16,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:16:16,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 291 [2023-08-26 18:16:16,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 67 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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:16:16,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:16,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 291 [2023-08-26 18:16:16,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:17,095 INFO L124 PetriNetUnfolderBase]: 7910/11262 cut-off events. [2023-08-26 18:16:17,095 INFO L125 PetriNetUnfolderBase]: For 24695/24945 co-relation queries the response was YES. [2023-08-26 18:16:17,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43572 conditions, 11262 events. 7910/11262 cut-off events. For 24695/24945 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 60944 event pairs, 1717 based on Foata normal form. 248/11283 useless extension candidates. Maximal degree in co-relation 43560. Up to 8240 conditions per place. [2023-08-26 18:16:17,212 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 68 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2023-08-26 18:16:17,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 107 transitions, 946 flow [2023-08-26 18:16:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:16:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:16:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-26 18:16:17,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725085910652921 [2023-08-26 18:16:17,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-26 18:16:17,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-26 18:16:17,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:17,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-26 18:16:17,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 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:16:17,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:17,220 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:17,220 INFO L175 Difference]: Start difference. First operand has 52 places, 67 transitions, 515 flow. Second operand 4 states and 550 transitions. [2023-08-26 18:16:17,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 107 transitions, 946 flow [2023-08-26 18:16:17,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 107 transitions, 946 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:16:17,234 INFO L231 Difference]: Finished difference. Result has 57 places, 76 transitions, 711 flow [2023-08-26 18:16:17,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=711, PETRI_PLACES=57, PETRI_TRANSITIONS=76} [2023-08-26 18:16:17,236 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-26 18:16:17,239 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 76 transitions, 711 flow [2023-08-26 18:16:17,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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:16:17,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:17,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:17,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:16:17,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:17,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1233604956, now seen corresponding path program 1 times [2023-08-26 18:16:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:17,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799662936] [2023-08-26 18:16:17,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:17,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:17,724 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:16:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799662936] [2023-08-26 18:16:17,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799662936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:17,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:17,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:16:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527483574] [2023-08-26 18:16:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:17,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:16:17,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:17,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:16:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:16:17,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 291 [2023-08-26 18:16:17,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 76 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:17,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:17,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 291 [2023-08-26 18:16:17,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:18,780 INFO L124 PetriNetUnfolderBase]: 8092/11543 cut-off events. [2023-08-26 18:16:18,781 INFO L125 PetriNetUnfolderBase]: For 36991/37248 co-relation queries the response was YES. [2023-08-26 18:16:18,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49676 conditions, 11543 events. 8092/11543 cut-off events. For 36991/37248 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 63457 event pairs, 1730 based on Foata normal form. 229/11493 useless extension candidates. Maximal degree in co-relation 49661. Up to 8687 conditions per place. [2023-08-26 18:16:18,853 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 93 selfloop transitions, 14 changer transitions 0/118 dead transitions. [2023-08-26 18:16:18,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 118 transitions, 1197 flow [2023-08-26 18:16:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:16:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:16:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-26 18:16:18,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647766323024055 [2023-08-26 18:16:18,856 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-26 18:16:18,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-26 18:16:18,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:18,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-26 18:16:18,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 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:16:18,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:18,860 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:18,860 INFO L175 Difference]: Start difference. First operand has 57 places, 76 transitions, 711 flow. Second operand 4 states and 541 transitions. [2023-08-26 18:16:18,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 118 transitions, 1197 flow [2023-08-26 18:16:18,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 1177 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 18:16:18,884 INFO L231 Difference]: Finished difference. Result has 61 places, 84 transitions, 830 flow [2023-08-26 18:16:18,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=830, PETRI_PLACES=61, PETRI_TRANSITIONS=84} [2023-08-26 18:16:18,885 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-26 18:16:18,885 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 84 transitions, 830 flow [2023-08-26 18:16:18,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:18,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:18,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:18,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:16:18,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:18,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash 412885549, now seen corresponding path program 1 times [2023-08-26 18:16:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657303519] [2023-08-26 18:16:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:19,354 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:16:19,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:19,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657303519] [2023-08-26 18:16:19,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657303519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:19,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:19,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:16:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927323720] [2023-08-26 18:16:19,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:19,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:16:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:19,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:16:19,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:16:19,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 291 [2023-08-26 18:16:19,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 84 transitions, 830 flow. Second operand has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 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:16:19,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:19,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 291 [2023-08-26 18:16:19,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:20,693 INFO L124 PetriNetUnfolderBase]: 8723/12399 cut-off events. [2023-08-26 18:16:20,693 INFO L125 PetriNetUnfolderBase]: For 45635/46161 co-relation queries the response was YES. [2023-08-26 18:16:20,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55933 conditions, 12399 events. 8723/12399 cut-off events. For 45635/46161 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 68517 event pairs, 1501 based on Foata normal form. 204/12298 useless extension candidates. Maximal degree in co-relation 55916. Up to 8835 conditions per place. [2023-08-26 18:16:20,803 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 83 selfloop transitions, 41 changer transitions 0/135 dead transitions. [2023-08-26 18:16:20,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 135 transitions, 1407 flow [2023-08-26 18:16:20,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:16:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:16:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-08-26 18:16:20,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639175257731959 [2023-08-26 18:16:20,806 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-08-26 18:16:20,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-08-26 18:16:20,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:20,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-08-26 18:16:20,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 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:16:20,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:16:20,811 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:16:20,811 INFO L175 Difference]: Start difference. First operand has 61 places, 84 transitions, 830 flow. Second operand 5 states and 675 transitions. [2023-08-26 18:16:20,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 135 transitions, 1407 flow [2023-08-26 18:16:20,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 135 transitions, 1392 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 18:16:20,848 INFO L231 Difference]: Finished difference. Result has 65 places, 95 transitions, 1054 flow [2023-08-26 18:16:20,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1054, PETRI_PLACES=65, PETRI_TRANSITIONS=95} [2023-08-26 18:16:20,848 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2023-08-26 18:16:20,849 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 95 transitions, 1054 flow [2023-08-26 18:16:20,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 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:16:20,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:20,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:20,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:16:20,850 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:20,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash 408483859, now seen corresponding path program 2 times [2023-08-26 18:16:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2405433] [2023-08-26 18:16:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:21,297 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:16:21,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:21,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2405433] [2023-08-26 18:16:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2405433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:16:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940892094] [2023-08-26 18:16:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:21,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:16:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:16:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:16:21,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 18:16:21,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 95 transitions, 1054 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 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:16:21,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:21,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 18:16:21,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:22,617 INFO L124 PetriNetUnfolderBase]: 10409/14919 cut-off events. [2023-08-26 18:16:22,617 INFO L125 PetriNetUnfolderBase]: For 74095/74644 co-relation queries the response was YES. [2023-08-26 18:16:22,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71017 conditions, 14919 events. 10409/14919 cut-off events. For 74095/74644 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 86389 event pairs, 1673 based on Foata normal form. 375/14897 useless extension candidates. Maximal degree in co-relation 70999. Up to 8005 conditions per place. [2023-08-26 18:16:22,737 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 95 selfloop transitions, 70 changer transitions 0/176 dead transitions. [2023-08-26 18:16:22,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 176 transitions, 1994 flow [2023-08-26 18:16:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:16:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:16:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-08-26 18:16:22,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581901489117984 [2023-08-26 18:16:22,740 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-08-26 18:16:22,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-08-26 18:16:22,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:22,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-08-26 18:16:22,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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:16:22,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:16:22,745 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:16:22,745 INFO L175 Difference]: Start difference. First operand has 65 places, 95 transitions, 1054 flow. Second operand 6 states and 800 transitions. [2023-08-26 18:16:22,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 176 transitions, 1994 flow [2023-08-26 18:16:22,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 176 transitions, 1902 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-26 18:16:22,859 INFO L231 Difference]: Finished difference. Result has 69 places, 119 transitions, 1486 flow [2023-08-26 18:16:22,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1486, PETRI_PLACES=69, PETRI_TRANSITIONS=119} [2023-08-26 18:16:22,859 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 18:16:22,859 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 119 transitions, 1486 flow [2023-08-26 18:16:22,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 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:16:22,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:22,860 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:16:22,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:16:22,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:22,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash -85454007, now seen corresponding path program 1 times [2023-08-26 18:16:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:22,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512744499] [2023-08-26 18:16:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:22,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:23,431 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:16:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:23,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512744499] [2023-08-26 18:16:23,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512744499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:23,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:23,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:16:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528569780] [2023-08-26 18:16:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:23,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:16:23,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:23,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:16:23,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:16:23,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-08-26 18:16:23,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 119 transitions, 1486 flow. Second operand has 7 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 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:16:23,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:23,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-08-26 18:16:23,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:25,093 INFO L124 PetriNetUnfolderBase]: 11498/16491 cut-off events. [2023-08-26 18:16:25,093 INFO L125 PetriNetUnfolderBase]: For 113695/114380 co-relation queries the response was YES. [2023-08-26 18:16:25,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86229 conditions, 16491 events. 11498/16491 cut-off events. For 113695/114380 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 97732 event pairs, 1882 based on Foata normal form. 253/16215 useless extension candidates. Maximal degree in co-relation 86209. Up to 10907 conditions per place. [2023-08-26 18:16:25,187 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 120 selfloop transitions, 45 changer transitions 0/176 dead transitions. [2023-08-26 18:16:25,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 176 transitions, 2318 flow [2023-08-26 18:16:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:16:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:16:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-26 18:16:25,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4611683848797251 [2023-08-26 18:16:25,190 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-26 18:16:25,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-26 18:16:25,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:25,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-26 18:16:25,192 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:16:25,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:16:25,195 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:16:25,195 INFO L175 Difference]: Start difference. First operand has 69 places, 119 transitions, 1486 flow. Second operand 5 states and 671 transitions. [2023-08-26 18:16:25,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 176 transitions, 2318 flow [2023-08-26 18:16:25,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 176 transitions, 2192 flow, removed 40 selfloop flow, removed 2 redundant places. [2023-08-26 18:16:25,410 INFO L231 Difference]: Finished difference. Result has 72 places, 129 transitions, 1657 flow [2023-08-26 18:16:25,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1657, PETRI_PLACES=72, PETRI_TRANSITIONS=129} [2023-08-26 18:16:25,410 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-26 18:16:25,410 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 129 transitions, 1657 flow [2023-08-26 18:16:25,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 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:16:25,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:25,411 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:16:25,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:16:25,411 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:25,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash -972034167, now seen corresponding path program 2 times [2023-08-26 18:16:25,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:25,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031540440] [2023-08-26 18:16:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:25,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:26,034 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:16:26,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:26,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031540440] [2023-08-26 18:16:26,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031540440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:26,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:26,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:16:26,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650203805] [2023-08-26 18:16:26,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:26,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:16:26,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:26,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:16:26,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:16:26,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 291 [2023-08-26 18:16:26,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 129 transitions, 1657 flow. Second operand has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 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:16:26,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:26,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 291 [2023-08-26 18:16:26,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:27,772 INFO L124 PetriNetUnfolderBase]: 12360/17796 cut-off events. [2023-08-26 18:16:27,773 INFO L125 PetriNetUnfolderBase]: For 125342/126163 co-relation queries the response was YES. [2023-08-26 18:16:27,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94165 conditions, 17796 events. 12360/17796 cut-off events. For 125342/126163 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 107810 event pairs, 1797 based on Foata normal form. 261/17475 useless extension candidates. Maximal degree in co-relation 94143. Up to 9164 conditions per place. [2023-08-26 18:16:27,916 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 121 selfloop transitions, 89 changer transitions 0/221 dead transitions. [2023-08-26 18:16:27,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 221 transitions, 2935 flow [2023-08-26 18:16:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:16:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:16:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 796 transitions. [2023-08-26 18:16:27,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558991981672394 [2023-08-26 18:16:27,920 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 796 transitions. [2023-08-26 18:16:27,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 796 transitions. [2023-08-26 18:16:27,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:27,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 796 transitions. [2023-08-26 18:16:27,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 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:16:27,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:16:27,925 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:16:27,925 INFO L175 Difference]: Start difference. First operand has 72 places, 129 transitions, 1657 flow. Second operand 6 states and 796 transitions. [2023-08-26 18:16:27,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 221 transitions, 2935 flow [2023-08-26 18:16:28,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 221 transitions, 2837 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 18:16:28,397 INFO L231 Difference]: Finished difference. Result has 75 places, 154 transitions, 2184 flow [2023-08-26 18:16:28,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2184, PETRI_PLACES=75, PETRI_TRANSITIONS=154} [2023-08-26 18:16:28,398 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2023-08-26 18:16:28,398 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 154 transitions, 2184 flow [2023-08-26 18:16:28,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 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:16:28,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:28,399 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:16:28,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:16:28,399 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:28,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash -83514461, now seen corresponding path program 1 times [2023-08-26 18:16:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109486939] [2023-08-26 18:16:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:28,738 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:16:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109486939] [2023-08-26 18:16:28,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109486939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:28,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:28,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:16:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205447912] [2023-08-26 18:16:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:28,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:16:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:28,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:16:28,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:16:28,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 291 [2023-08-26 18:16:28,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 154 transitions, 2184 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 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:16:28,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:28,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 291 [2023-08-26 18:16:28,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:31,569 INFO L124 PetriNetUnfolderBase]: 20423/28282 cut-off events. [2023-08-26 18:16:31,569 INFO L125 PetriNetUnfolderBase]: For 188122/188122 co-relation queries the response was YES. [2023-08-26 18:16:31,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147383 conditions, 28282 events. 20423/28282 cut-off events. For 188122/188122 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 161473 event pairs, 1221 based on Foata normal form. 196/28478 useless extension candidates. Maximal degree in co-relation 147360. Up to 12921 conditions per place. [2023-08-26 18:16:31,781 INFO L140 encePairwiseOnDemand]: 278/291 looper letters, 143 selfloop transitions, 121 changer transitions 89/353 dead transitions. [2023-08-26 18:16:31,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 353 transitions, 5428 flow [2023-08-26 18:16:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:16:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:16:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-26 18:16:31,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42668957617411224 [2023-08-26 18:16:31,784 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-26 18:16:31,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-26 18:16:31,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:31,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-26 18:16:31,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:31,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:16:31,789 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 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:16:31,789 INFO L175 Difference]: Start difference. First operand has 75 places, 154 transitions, 2184 flow. Second operand 6 states and 745 transitions. [2023-08-26 18:16:31,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 353 transitions, 5428 flow [2023-08-26 18:16:32,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 353 transitions, 5350 flow, removed 39 selfloop flow, removed 0 redundant places. [2023-08-26 18:16:32,233 INFO L231 Difference]: Finished difference. Result has 85 places, 196 transitions, 3254 flow [2023-08-26 18:16:32,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3254, PETRI_PLACES=85, PETRI_TRANSITIONS=196} [2023-08-26 18:16:32,234 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2023-08-26 18:16:32,234 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 196 transitions, 3254 flow [2023-08-26 18:16:32,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 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:16:32,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:32,235 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:16:32,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:16:32,235 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:32,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1760833109, now seen corresponding path program 2 times [2023-08-26 18:16:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:32,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070105731] [2023-08-26 18:16:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:32,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:32,383 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:16:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070105731] [2023-08-26 18:16:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070105731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:32,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:32,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:16:32,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159599836] [2023-08-26 18:16:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:32,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:16:32,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:16:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:16:32,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 18:16:32,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 196 transitions, 3254 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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:16:32,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:32,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 18:16:32,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:34,385 INFO L124 PetriNetUnfolderBase]: 12288/18058 cut-off events. [2023-08-26 18:16:34,385 INFO L125 PetriNetUnfolderBase]: For 270337/273817 co-relation queries the response was YES. [2023-08-26 18:16:34,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108473 conditions, 18058 events. 12288/18058 cut-off events. For 270337/273817 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 118991 event pairs, 1773 based on Foata normal form. 2574/19894 useless extension candidates. Maximal degree in co-relation 108445. Up to 10753 conditions per place. [2023-08-26 18:16:34,535 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 409 selfloop transitions, 10 changer transitions 40/479 dead transitions. [2023-08-26 18:16:34,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 479 transitions, 8957 flow [2023-08-26 18:16:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:16:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:16:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-26 18:16:34,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45910652920962197 [2023-08-26 18:16:34,538 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-26 18:16:34,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-26 18:16:34,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:34,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-26 18:16:34,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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:16:34,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:16:34,542 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:16:34,542 INFO L175 Difference]: Start difference. First operand has 85 places, 196 transitions, 3254 flow. Second operand 5 states and 668 transitions. [2023-08-26 18:16:34,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 479 transitions, 8957 flow [2023-08-26 18:16:34,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 479 transitions, 8795 flow, removed 66 selfloop flow, removed 1 redundant places. [2023-08-26 18:16:34,813 INFO L231 Difference]: Finished difference. Result has 91 places, 178 transitions, 2780 flow [2023-08-26 18:16:34,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=2662, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2780, PETRI_PLACES=91, PETRI_TRANSITIONS=178} [2023-08-26 18:16:34,814 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2023-08-26 18:16:34,814 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 178 transitions, 2780 flow [2023-08-26 18:16:34,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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:16:34,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:34,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:34,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:16:34,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:34,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1524709930, now seen corresponding path program 1 times [2023-08-26 18:16:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338409220] [2023-08-26 18:16:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:34,964 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:16:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338409220] [2023-08-26 18:16:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338409220] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:34,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:34,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:16:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44726250] [2023-08-26 18:16:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:34,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:16:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:16:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:16:34,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 18:16:34,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 178 transitions, 2780 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:34,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:34,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 18:16:34,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:37,117 INFO L124 PetriNetUnfolderBase]: 9904/14822 cut-off events. [2023-08-26 18:16:37,118 INFO L125 PetriNetUnfolderBase]: For 235707/239817 co-relation queries the response was YES. [2023-08-26 18:16:37,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96041 conditions, 14822 events. 9904/14822 cut-off events. For 235707/239817 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 98964 event pairs, 647 based on Foata normal form. 2443/16654 useless extension candidates. Maximal degree in co-relation 96010. Up to 6502 conditions per place. [2023-08-26 18:16:37,206 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 461 selfloop transitions, 19 changer transitions 61/561 dead transitions. [2023-08-26 18:16:37,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 561 transitions, 10270 flow [2023-08-26 18:16:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:16:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:16:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 937 transitions. [2023-08-26 18:16:37,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45999018163966615 [2023-08-26 18:16:37,209 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 937 transitions. [2023-08-26 18:16:37,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 937 transitions. [2023-08-26 18:16:37,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:37,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 937 transitions. [2023-08-26 18:16:37,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.85714285714286) internal successors, (937), 7 states have internal predecessors, (937), 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:16:37,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 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:16:37,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 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:16:37,214 INFO L175 Difference]: Start difference. First operand has 91 places, 178 transitions, 2780 flow. Second operand 7 states and 937 transitions. [2023-08-26 18:16:37,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 561 transitions, 10270 flow [2023-08-26 18:16:37,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 561 transitions, 10211 flow, removed 27 selfloop flow, removed 1 redundant places. [2023-08-26 18:16:37,411 INFO L231 Difference]: Finished difference. Result has 99 places, 159 transitions, 2415 flow [2023-08-26 18:16:37,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=2341, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2415, PETRI_PLACES=99, PETRI_TRANSITIONS=159} [2023-08-26 18:16:37,411 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 49 predicate places. [2023-08-26 18:16:37,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 159 transitions, 2415 flow [2023-08-26 18:16:37,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:16:37,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:37,412 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:16:37,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:16:37,412 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:37,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:37,412 INFO L85 PathProgramCache]: Analyzing trace with hash -362789357, now seen corresponding path program 1 times [2023-08-26 18:16:37,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:37,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848591444] [2023-08-26 18:16:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:37,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:37,758 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:16:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848591444] [2023-08-26 18:16:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848591444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:37,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:16:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766639383] [2023-08-26 18:16:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:37,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:16:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:16:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:16:37,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 291 [2023-08-26 18:16:37,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 159 transitions, 2415 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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:16:37,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:37,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 291 [2023-08-26 18:16:37,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:40,703 INFO L124 PetriNetUnfolderBase]: 15932/23706 cut-off events. [2023-08-26 18:16:40,704 INFO L125 PetriNetUnfolderBase]: For 232659/232659 co-relation queries the response was YES. [2023-08-26 18:16:40,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152837 conditions, 23706 events. 15932/23706 cut-off events. For 232659/232659 co-relation queries the response was YES. Maximal size of possible extension queue 1026. Compared 153019 event pairs, 3906 based on Foata normal form. 55/23761 useless extension candidates. Maximal degree in co-relation 152803. Up to 11965 conditions per place. [2023-08-26 18:16:40,838 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 123 selfloop transitions, 16 changer transitions 97/236 dead transitions. [2023-08-26 18:16:40,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 236 transitions, 3686 flow [2023-08-26 18:16:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:16:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:16:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-26 18:16:40,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338487972508591 [2023-08-26 18:16:40,840 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-26 18:16:40,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-26 18:16:40,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:40,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-26 18:16:40,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 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:16:40,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:40,843 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:40,843 INFO L175 Difference]: Start difference. First operand has 99 places, 159 transitions, 2415 flow. Second operand 4 states and 505 transitions. [2023-08-26 18:16:40,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 236 transitions, 3686 flow [2023-08-26 18:16:42,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 236 transitions, 3586 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-26 18:16:42,279 INFO L231 Difference]: Finished difference. Result has 100 places, 102 transitions, 1403 flow [2023-08-26 18:16:42,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=2365, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1403, PETRI_PLACES=100, PETRI_TRANSITIONS=102} [2023-08-26 18:16:42,280 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 50 predicate places. [2023-08-26 18:16:42,280 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 102 transitions, 1403 flow [2023-08-26 18:16:42,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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:16:42,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:42,280 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] [2023-08-26 18:16:42,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:16:42,280 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:42,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1491430714, now seen corresponding path program 1 times [2023-08-26 18:16:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830220485] [2023-08-26 18:16:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:42,446 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:16:42,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:42,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830220485] [2023-08-26 18:16:42,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830220485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:42,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:42,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:16:42,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931024285] [2023-08-26 18:16:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:42,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:16:42,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:42,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:16:42,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:16:42,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 18:16:42,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 102 transitions, 1403 flow. Second operand has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 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:16:42,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:42,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 18:16:42,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:43,621 INFO L124 PetriNetUnfolderBase]: 4000/6535 cut-off events. [2023-08-26 18:16:43,621 INFO L125 PetriNetUnfolderBase]: For 101611/102547 co-relation queries the response was YES. [2023-08-26 18:16:43,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41087 conditions, 6535 events. 4000/6535 cut-off events. For 101611/102547 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 42498 event pairs, 487 based on Foata normal form. 705/7049 useless extension candidates. Maximal degree in co-relation 41052. Up to 2943 conditions per place. [2023-08-26 18:16:43,650 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 183 selfloop transitions, 18 changer transitions 40/256 dead transitions. [2023-08-26 18:16:43,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 256 transitions, 4029 flow [2023-08-26 18:16:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:16:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:16:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 938 transitions. [2023-08-26 18:16:43,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46048109965635736 [2023-08-26 18:16:43,652 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 938 transitions. [2023-08-26 18:16:43,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 938 transitions. [2023-08-26 18:16:43,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:43,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 938 transitions. [2023-08-26 18:16:43,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 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:16:43,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 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:16:43,657 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 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:16:43,657 INFO L175 Difference]: Start difference. First operand has 100 places, 102 transitions, 1403 flow. Second operand 7 states and 938 transitions. [2023-08-26 18:16:43,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 256 transitions, 4029 flow [2023-08-26 18:16:43,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 256 transitions, 3891 flow, removed 54 selfloop flow, removed 5 redundant places. [2023-08-26 18:16:43,744 INFO L231 Difference]: Finished difference. Result has 100 places, 101 transitions, 1304 flow [2023-08-26 18:16:43,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1304, PETRI_PLACES=100, PETRI_TRANSITIONS=101} [2023-08-26 18:16:43,744 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 50 predicate places. [2023-08-26 18:16:43,744 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 101 transitions, 1304 flow [2023-08-26 18:16:43,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 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:16:43,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:43,745 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:16:43,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:16:43,745 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:43,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1595035376, now seen corresponding path program 1 times [2023-08-26 18:16:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:43,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002172763] [2023-08-26 18:16:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:43,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:43,952 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:16:43,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:43,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002172763] [2023-08-26 18:16:43,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002172763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:43,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:43,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:16:43,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126464764] [2023-08-26 18:16:43,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:43,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:16:43,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:43,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:16:43,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:16:43,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 18:16:43,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 1304 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 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:16:43,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:43,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 18:16:43,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:45,043 INFO L124 PetriNetUnfolderBase]: 3753/6050 cut-off events. [2023-08-26 18:16:45,043 INFO L125 PetriNetUnfolderBase]: For 67270/67804 co-relation queries the response was YES. [2023-08-26 18:16:45,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39450 conditions, 6050 events. 3753/6050 cut-off events. For 67270/67804 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 38576 event pairs, 456 based on Foata normal form. 188/6050 useless extension candidates. Maximal degree in co-relation 39415. Up to 2758 conditions per place. [2023-08-26 18:16:45,076 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 140 selfloop transitions, 23 changer transitions 73/247 dead transitions. [2023-08-26 18:16:45,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 247 transitions, 3774 flow [2023-08-26 18:16:45,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:16:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:16:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1179 transitions. [2023-08-26 18:16:45,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45017182130584193 [2023-08-26 18:16:45,079 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1179 transitions. [2023-08-26 18:16:45,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1179 transitions. [2023-08-26 18:16:45,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:45,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1179 transitions. [2023-08-26 18:16:45,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 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:16:45,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 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:16:45,086 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 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:16:45,086 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 1304 flow. Second operand 9 states and 1179 transitions. [2023-08-26 18:16:45,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 247 transitions, 3774 flow [2023-08-26 18:16:45,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 247 transitions, 3609 flow, removed 69 selfloop flow, removed 4 redundant places. [2023-08-26 18:16:45,342 INFO L231 Difference]: Finished difference. Result has 106 places, 80 transitions, 931 flow [2023-08-26 18:16:45,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=931, PETRI_PLACES=106, PETRI_TRANSITIONS=80} [2023-08-26 18:16:45,343 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2023-08-26 18:16:45,343 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 931 flow [2023-08-26 18:16:45,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 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:16:45,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:45,344 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] [2023-08-26 18:16:45,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:16:45,344 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:45,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:45,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1466166705, now seen corresponding path program 1 times [2023-08-26 18:16:45,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:45,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752810177] [2023-08-26 18:16:45,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:45,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:45,547 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:16:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752810177] [2023-08-26 18:16:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752810177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:45,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:16:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669163451] [2023-08-26 18:16:45,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:45,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:16:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:16:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:16:45,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 291 [2023-08-26 18:16:45,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 80 transitions, 931 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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:16:45,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:45,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 291 [2023-08-26 18:16:45,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:45,913 INFO L124 PetriNetUnfolderBase]: 1408/2369 cut-off events. [2023-08-26 18:16:45,914 INFO L125 PetriNetUnfolderBase]: For 18939/18994 co-relation queries the response was YES. [2023-08-26 18:16:45,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14463 conditions, 2369 events. 1408/2369 cut-off events. For 18939/18994 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12521 event pairs, 321 based on Foata normal form. 10/2360 useless extension candidates. Maximal degree in co-relation 14426. Up to 1520 conditions per place. [2023-08-26 18:16:45,928 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 53 selfloop transitions, 1 changer transitions 88/146 dead transitions. [2023-08-26 18:16:45,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 146 transitions, 1963 flow [2023-08-26 18:16:45,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:16:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:16:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-08-26 18:16:45,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699312714776632 [2023-08-26 18:16:45,930 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-08-26 18:16:45,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-08-26 18:16:45,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:45,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-08-26 18:16:45,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 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:16:45,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:45,934 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 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:16:45,934 INFO L175 Difference]: Start difference. First operand has 106 places, 80 transitions, 931 flow. Second operand 4 states and 547 transitions. [2023-08-26 18:16:45,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 146 transitions, 1963 flow [2023-08-26 18:16:45,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 146 transitions, 1701 flow, removed 66 selfloop flow, removed 16 redundant places. [2023-08-26 18:16:45,973 INFO L231 Difference]: Finished difference. Result has 93 places, 50 transitions, 456 flow [2023-08-26 18:16:45,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=93, PETRI_TRANSITIONS=50} [2023-08-26 18:16:45,974 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2023-08-26 18:16:45,974 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 50 transitions, 456 flow [2023-08-26 18:16:45,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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:16:45,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:45,974 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] [2023-08-26 18:16:45,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:16:45,974 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:45,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash -703087425, now seen corresponding path program 2 times [2023-08-26 18:16:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967667402] [2023-08-26 18:16:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:46,715 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:16:46,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:46,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967667402] [2023-08-26 18:16:46,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967667402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:46,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:46,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:16:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882489347] [2023-08-26 18:16:46,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:46,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:16:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:16:46,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:16:46,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 291 [2023-08-26 18:16:46,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 50 transitions, 456 flow. Second operand has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 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:16:46,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:46,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 291 [2023-08-26 18:16:46,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:47,001 INFO L124 PetriNetUnfolderBase]: 398/731 cut-off events. [2023-08-26 18:16:47,002 INFO L125 PetriNetUnfolderBase]: For 4806/4810 co-relation queries the response was YES. [2023-08-26 18:16:47,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4109 conditions, 731 events. 398/731 cut-off events. For 4806/4810 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3198 event pairs, 40 based on Foata normal form. 1/727 useless extension candidates. Maximal degree in co-relation 4077. Up to 454 conditions per place. [2023-08-26 18:16:47,005 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 57 selfloop transitions, 11 changer transitions 9/80 dead transitions. [2023-08-26 18:16:47,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 80 transitions, 828 flow [2023-08-26 18:16:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:16:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:16:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-26 18:16:47,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357388316151203 [2023-08-26 18:16:47,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-26 18:16:47,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-26 18:16:47,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:47,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-26 18:16:47,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 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:16:47,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:16:47,011 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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:16:47,012 INFO L175 Difference]: Start difference. First operand has 93 places, 50 transitions, 456 flow. Second operand 5 states and 634 transitions. [2023-08-26 18:16:47,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 80 transitions, 828 flow [2023-08-26 18:16:47,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 80 transitions, 668 flow, removed 46 selfloop flow, removed 21 redundant places. [2023-08-26 18:16:47,022 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 376 flow [2023-08-26 18:16:47,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2023-08-26 18:16:47,023 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2023-08-26 18:16:47,023 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 376 flow [2023-08-26 18:16:47,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 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:16:47,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:47,024 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] [2023-08-26 18:16:47,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:16:47,024 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:47,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash -549559819, now seen corresponding path program 3 times [2023-08-26 18:16:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:47,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679464471] [2023-08-26 18:16:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:16:48,100 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:16:48,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:16:48,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679464471] [2023-08-26 18:16:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679464471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:16:48,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:16:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:16:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738909098] [2023-08-26 18:16:48,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:16:48,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:16:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:16:48,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:16:48,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:16:48,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 291 [2023-08-26 18:16:48,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 376 flow. Second operand has 9 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 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:16:48,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:16:48,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 291 [2023-08-26 18:16:48,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:16:48,425 INFO L124 PetriNetUnfolderBase]: 418/777 cut-off events. [2023-08-26 18:16:48,425 INFO L125 PetriNetUnfolderBase]: For 2415/2419 co-relation queries the response was YES. [2023-08-26 18:16:48,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 777 events. 418/777 cut-off events. For 2415/2419 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3463 event pairs, 77 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 3823. Up to 324 conditions per place. [2023-08-26 18:16:48,429 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 52 selfloop transitions, 5 changer transitions 31/91 dead transitions. [2023-08-26 18:16:48,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 789 flow [2023-08-26 18:16:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:16:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:16:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2023-08-26 18:16:48,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256259204712813 [2023-08-26 18:16:48,431 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2023-08-26 18:16:48,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2023-08-26 18:16:48,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:16:48,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2023-08-26 18:16:48,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 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:16:48,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 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:16:48,436 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 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:16:48,436 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 376 flow. Second operand 7 states and 867 transitions. [2023-08-26 18:16:48,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 789 flow [2023-08-26 18:16:48,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 91 transitions, 776 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 18:16:48,442 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 351 flow [2023-08-26 18:16:48,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-08-26 18:16:48,443 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2023-08-26 18:16:48,443 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 351 flow [2023-08-26 18:16:48,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 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:16:48,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:16:48,444 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] [2023-08-26 18:16:48,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:16:48,444 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:16:48,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:16:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2016304329, now seen corresponding path program 4 times [2023-08-26 18:16:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:16:48,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532620221] [2023-08-26 18:16:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:16:48,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:16:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:16:48,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:16:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:16:48,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:16:48,582 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:16:48,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:16:48,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:16:48,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:16:48,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:16:48,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:16:48,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:16:48,589 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:16:48,596 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:16:48,596 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:16:48,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:16:48 BasicIcfg [2023-08-26 18:16:48,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:16:48,694 INFO L158 Benchmark]: Toolchain (without parser) took 47043.20ms. Allocated memory was 348.1MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 322.7MB in the beginning and 5.6GB in the end (delta: -5.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-26 18:16:48,694 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 348.1MB. Free memory is still 323.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:16:48,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.86ms. Allocated memory is still 348.1MB. Free memory was 322.7MB in the beginning and 298.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:16:48,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.08ms. Allocated memory is still 348.1MB. Free memory was 298.7MB in the beginning and 296.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:16:48,695 INFO L158 Benchmark]: Boogie Preprocessor took 48.41ms. Allocated memory is still 348.1MB. Free memory was 296.0MB in the beginning and 293.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:16:48,695 INFO L158 Benchmark]: RCFGBuilder took 680.03ms. Allocated memory is still 348.1MB. Free memory was 293.9MB in the beginning and 304.4MB in the end (delta: -10.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 18:16:48,695 INFO L158 Benchmark]: TraceAbstraction took 45738.81ms. Allocated memory was 348.1MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 304.4MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-26 18:16:48,696 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.14ms. Allocated memory is still 348.1MB. Free memory is still 323.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 516.86ms. Allocated memory is still 348.1MB. Free memory was 322.7MB in the beginning and 298.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.08ms. Allocated memory is still 348.1MB. Free memory was 298.7MB in the beginning and 296.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.41ms. Allocated memory is still 348.1MB. Free memory was 296.0MB in the beginning and 293.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 680.03ms. Allocated memory is still 348.1MB. Free memory was 293.9MB in the beginning and 304.4MB in the end (delta: -10.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 45738.81ms. Allocated memory was 348.1MB in the beginning and 6.8GB in the end (delta: 6.5GB). Free memory was 304.4MB in the beginning and 5.6GB in the end (delta: -5.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 149 PlacesBefore, 50 PlacesAfterwards, 139 TransitionsBefore, 37 TransitionsAfterwards, 3490 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 148 TotalNumberOfCompositions, 9693 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5038, independent: 4805, independent conditional: 0, independent unconditional: 4805, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1929, independent: 1886, independent conditional: 0, independent unconditional: 1886, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5038, independent: 2919, independent conditional: 0, independent unconditional: 2919, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 1929, unknown conditional: 0, unknown unconditional: 1929] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1081, ((void *)0), P0, ((void *)0))=-3, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1082, ((void *)0), P1, ((void *)0))=-2, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1083, ((void *)0), P2, ((void *)0))=-1, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t1084; [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1084, ((void *)0), P3, ((void *)0))=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L820] 4 a = 1 [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix040_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 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: 45.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2353 IncrementalHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 45 mSDtfsCounter, 2353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3254occurred in iteration=12, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 3719 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:16:48,725 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...