/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 INSUFFICIENT_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 15:11:44,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:11:44,068 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 15:11:44,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:11:44,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:11:44,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:11:44,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:11:44,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:11:44,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:11:44,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:11:44,103 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:11:44,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:11:44,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:11:44,105 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:11:44,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:11:44,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:11:44,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:11:44,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:11:44,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:11:44,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:11:44,106 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:11:44,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:11:44,107 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:11:44,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:11:44,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:11:44,108 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:11:44,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:11:44,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:11:44,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:11:44,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:11:44,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:11:44,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:11:44,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:11:44,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:11:44,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:11:44,111 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 -> INSUFFICIENT_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 15:11:44,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:11:44,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:11:44,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:11:44,470 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:11:44,471 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:11:44,472 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 15:11:45,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:11:45,946 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:11:45,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2023-08-26 15:11:45,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7912f0d13/9043d0ad1a6842f5ba6a23bf36e703bf/FLAGaa3964e37 [2023-08-26 15:11:45,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7912f0d13/9043d0ad1a6842f5ba6a23bf36e703bf [2023-08-26 15:11:45,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:11:45,981 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:11:45,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:11:45,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:11:45,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:11:45,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:11:45" (1/1) ... [2023-08-26 15:11:45,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e60ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:45, skipping insertion in model container [2023-08-26 15:11:45,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:11:45" (1/1) ... [2023-08-26 15:11:46,050 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:11:46,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:11:46,464 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:11:46,495 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:11:46,497 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:11:46,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:11:46,564 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:11:46,564 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:11:46,570 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:11:46,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46 WrapperNode [2023-08-26 15:11:46,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:11:46,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:11:46,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:11:46,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:11:46,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,628 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-08-26 15:11:46,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:11:46,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:11:46,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:11:46,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:11:46,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:11:46,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:11:46,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:11:46,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:11:46,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (1/1) ... [2023-08-26 15:11:46,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:11:46,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:11:46,726 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 15:11:46,749 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 15:11:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:11:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:11:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:11:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:11:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:11:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:11:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:11:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:11:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:11:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:11:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:11:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 15:11:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 15:11:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:11:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:11:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:11:46,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:11:46,767 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 15:11:46,909 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:11:46,911 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:11:47,230 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:11:47,334 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:11:47,335 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:11:47,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:11:47 BoogieIcfgContainer [2023-08-26 15:11:47,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:11:47,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:11:47,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:11:47,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:11:47,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:11:45" (1/3) ... [2023-08-26 15:11:47,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:11:47, skipping insertion in model container [2023-08-26 15:11:47,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:11:46" (2/3) ... [2023-08-26 15:11:47,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:11:47, skipping insertion in model container [2023-08-26 15:11:47,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:11:47" (3/3) ... [2023-08-26 15:11:47,344 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2023-08-26 15:11:47,359 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:11:47,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 15:11:47,360 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:11:47,424 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:11:47,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 15:11:47,535 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 15:11:47,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:11:47,541 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 15:11:47,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 15:11:47,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-26 15:11:47,549 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:11:47,556 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 15:11:47,560 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 15:11:47,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-26 15:11:47,626 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 15:11:47,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:11:47,628 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 15:11:47,631 INFO L119 LiptonReduction]: Number of co-enabled transitions 3490 [2023-08-26 15:11:52,986 INFO L134 LiptonReduction]: Checked pairs total: 9693 [2023-08-26 15:11:52,987 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-08-26 15:11:52,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:11:53,004 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;@2782c739, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:11:53,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 15:11:53,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:11:53,005 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:11:53,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:11:53,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:53,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:11:53,006 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 15:11:53,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash 628, now seen corresponding path program 1 times [2023-08-26 15:11:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588899219] [2023-08-26 15:11:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:53,118 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 15:11:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588899219] [2023-08-26 15:11:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588899219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:11:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757404643] [2023-08-26 15:11:53,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:53,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:11:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:53,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:11:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:11:53,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 291 [2023-08-26 15:11:53,166 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 15:11:53,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:53,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 291 [2023-08-26 15:11:53,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:54,017 INFO L124 PetriNetUnfolderBase]: 4530/6302 cut-off events. [2023-08-26 15:11:54,017 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-26 15:11:54,030 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 15:11:54,060 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-26 15:11:54,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-26 15:11:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:11:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:11:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2023-08-26 15:11:54,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965635738831615 [2023-08-26 15:11:54,079 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2023-08-26 15:11:54,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2023-08-26 15:11:54,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:54,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2023-08-26 15:11:54,089 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 15:11:54,092 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 15:11:54,093 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 15:11:54,095 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 2 states and 289 transitions. [2023-08-26 15:11:54,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-26 15:11:54,099 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 15:11:54,100 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-26 15:11:54,102 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 15:11:54,105 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 15:11:54,105 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-26 15:11:54,105 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 15:11:54,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:54,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:54,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:11:54,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:11:54,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1409946044, now seen corresponding path program 1 times [2023-08-26 15:11:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:54,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861453292] [2023-08-26 15:11:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:54,417 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 15:11:54,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:54,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861453292] [2023-08-26 15:11:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861453292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:54,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:11:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436504305] [2023-08-26 15:11:54,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:54,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:11:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:54,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:11:54,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:11:54,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2023-08-26 15:11:54,421 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 15:11:54,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:54,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2023-08-26 15:11:54,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:55,059 INFO L124 PetriNetUnfolderBase]: 3567/5249 cut-off events. [2023-08-26 15:11:55,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:11:55,068 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 15:11:55,089 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-26 15:11:55,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 174 flow [2023-08-26 15:11:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:11:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:11:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 15:11:55,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822451317296678 [2023-08-26 15:11:55,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 15:11:55,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 15:11:55,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:55,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 15:11:55,096 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 15:11:55,100 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 15:11:55,101 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 15:11:55,102 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 421 transitions. [2023-08-26 15:11:55,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 174 flow [2023-08-26 15:11:55,105 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 15:11:55,105 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-26 15:11:55,106 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 15:11:55,106 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 15:11:55,107 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-26 15:11:55,108 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 15:11:55,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:55,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:55,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:11:55,112 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 15:11:55,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash -881577458, now seen corresponding path program 1 times [2023-08-26 15:11:55,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:55,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303180714] [2023-08-26 15:11:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:55,647 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 15:11:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303180714] [2023-08-26 15:11:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303180714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:55,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:55,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:11:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848418214] [2023-08-26 15:11:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:11:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:11:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:11:55,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 291 [2023-08-26 15:11:55,651 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 15:11:55,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:55,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 291 [2023-08-26 15:11:55,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:56,761 INFO L124 PetriNetUnfolderBase]: 8789/12038 cut-off events. [2023-08-26 15:11:56,763 INFO L125 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2023-08-26 15:11:56,795 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 15:11:56,851 INFO L140 encePairwiseOnDemand]: 279/291 looper letters, 43 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-08-26 15:11:56,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 232 flow [2023-08-26 15:11:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:11:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:11:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-08-26 15:11:56,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42955326460481097 [2023-08-26 15:11:56,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-08-26 15:11:56,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-08-26 15:11:56,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:56,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-08-26 15:11:56,855 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 15:11:56,857 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 15:11:56,858 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 15:11:56,858 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 4 states and 500 transitions. [2023-08-26 15:11:56,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 232 flow [2023-08-26 15:11:56,862 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 15:11:56,863 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 146 flow [2023-08-26 15:11:56,863 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 15:11:56,864 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2023-08-26 15:11:56,864 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 146 flow [2023-08-26 15:11:56,864 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 15:11:56,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:56,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:56,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:11:56,865 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 15:11:56,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1162858517, now seen corresponding path program 1 times [2023-08-26 15:11:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029085929] [2023-08-26 15:11:56,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:56,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:57,340 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 15:11:57,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:57,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029085929] [2023-08-26 15:11:57,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029085929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:57,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:57,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:11:57,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478208220] [2023-08-26 15:11:57,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:57,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:11:57,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:57,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:11:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:11:57,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 291 [2023-08-26 15:11:57,344 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 15:11:57,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:57,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 291 [2023-08-26 15:11:57,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:11:58,578 INFO L124 PetriNetUnfolderBase]: 9587/13160 cut-off events. [2023-08-26 15:11:58,578 INFO L125 PetriNetUnfolderBase]: For 6449/6449 co-relation queries the response was YES. [2023-08-26 15:11:58,598 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 15:11:58,652 INFO L140 encePairwiseOnDemand]: 279/291 looper letters, 54 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2023-08-26 15:11:58,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 75 transitions, 424 flow [2023-08-26 15:11:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:11:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:11:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-26 15:11:58,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43986254295532645 [2023-08-26 15:11:58,654 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-26 15:11:58,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-26 15:11:58,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:11:58,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-26 15:11:58,656 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 15:11:58,658 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 15:11:58,659 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 15:11:58,659 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 146 flow. Second operand 4 states and 512 transitions. [2023-08-26 15:11:58,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 75 transitions, 424 flow [2023-08-26 15:11:58,664 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 15:11:58,666 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 268 flow [2023-08-26 15:11:58,666 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 15:11:58,666 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-26 15:11:58,667 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 268 flow [2023-08-26 15:11:58,667 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 15:11:58,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:11:58,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:11:58,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:11:58,667 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 15:11:58,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:11:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1692308242, now seen corresponding path program 1 times [2023-08-26 15:11:58,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:11:58,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973658463] [2023-08-26 15:11:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:11:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:11:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:11:59,155 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 15:11:59,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:11:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973658463] [2023-08-26 15:11:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973658463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:11:59,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:11:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:11:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017521262] [2023-08-26 15:11:59,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:11:59,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:11:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:11:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:11:59,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:11:59,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 291 [2023-08-26 15:11:59,164 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 15:11:59,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:11:59,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 291 [2023-08-26 15:11:59,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:00,191 INFO L124 PetriNetUnfolderBase]: 9685/13290 cut-off events. [2023-08-26 15:12:00,191 INFO L125 PetriNetUnfolderBase]: For 14626/14626 co-relation queries the response was YES. [2023-08-26 15:12:00,234 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 15:12:00,294 INFO L140 encePairwiseOnDemand]: 282/291 looper letters, 78 selfloop transitions, 22 changer transitions 0/100 dead transitions. [2023-08-26 15:12:00,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 781 flow [2023-08-26 15:12:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:12:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:12:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-26 15:12:00,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44673539518900346 [2023-08-26 15:12:00,297 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-26 15:12:00,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-26 15:12:00,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:00,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-26 15:12:00,298 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 15:12:00,300 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 15:12:00,301 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 15:12:00,301 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 268 flow. Second operand 4 states and 520 transitions. [2023-08-26 15:12:00,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 781 flow [2023-08-26 15:12:00,310 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 15:12:00,311 INFO L231 Difference]: Finished difference. Result has 52 places, 67 transitions, 515 flow [2023-08-26 15:12:00,312 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 15:12:00,312 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2023-08-26 15:12:00,312 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 67 transitions, 515 flow [2023-08-26 15:12:00,313 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 15:12:00,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:00,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:00,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:12:00,313 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 15:12:00,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1233746533, now seen corresponding path program 1 times [2023-08-26 15:12:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:00,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436888693] [2023-08-26 15:12:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:00,650 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 15:12:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:00,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436888693] [2023-08-26 15:12:00,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436888693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:00,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:00,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:12:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029272733] [2023-08-26 15:12:00,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:00,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:12:00,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:00,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:12:00,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:12:00,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 291 [2023-08-26 15:12:00,655 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 15:12:00,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:00,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 291 [2023-08-26 15:12:00,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:01,645 INFO L124 PetriNetUnfolderBase]: 7910/11262 cut-off events. [2023-08-26 15:12:01,645 INFO L125 PetriNetUnfolderBase]: For 24695/24945 co-relation queries the response was YES. [2023-08-26 15:12:01,686 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 15:12:01,733 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 68 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2023-08-26 15:12:01,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 107 transitions, 946 flow [2023-08-26 15:12:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:12:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:12:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-26 15:12:01,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725085910652921 [2023-08-26 15:12:01,735 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-26 15:12:01,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-26 15:12:01,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:01,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-26 15:12:01,738 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 15:12:01,740 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 15:12:01,740 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 15:12:01,740 INFO L175 Difference]: Start difference. First operand has 52 places, 67 transitions, 515 flow. Second operand 4 states and 550 transitions. [2023-08-26 15:12:01,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 107 transitions, 946 flow [2023-08-26 15:12:01,749 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 15:12:01,751 INFO L231 Difference]: Finished difference. Result has 57 places, 76 transitions, 711 flow [2023-08-26 15:12:01,751 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 15:12:01,754 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-26 15:12:01,756 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 76 transitions, 711 flow [2023-08-26 15:12:01,757 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 15:12:01,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:01,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:01,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:12:01,757 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 15:12:01,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:01,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1233604956, now seen corresponding path program 1 times [2023-08-26 15:12:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:01,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723903293] [2023-08-26 15:12:01,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:02,258 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 15:12:02,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723903293] [2023-08-26 15:12:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723903293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:02,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:12:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687280683] [2023-08-26 15:12:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:02,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:12:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:12:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:12:02,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 291 [2023-08-26 15:12:02,262 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 15:12:02,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:02,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 291 [2023-08-26 15:12:02,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:03,283 INFO L124 PetriNetUnfolderBase]: 8092/11543 cut-off events. [2023-08-26 15:12:03,283 INFO L125 PetriNetUnfolderBase]: For 36991/37248 co-relation queries the response was YES. [2023-08-26 15:12:03,306 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 15:12:03,357 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 93 selfloop transitions, 14 changer transitions 0/118 dead transitions. [2023-08-26 15:12:03,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 118 transitions, 1197 flow [2023-08-26 15:12:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:12:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:12:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-26 15:12:03,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647766323024055 [2023-08-26 15:12:03,362 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-26 15:12:03,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-26 15:12:03,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:03,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-26 15:12:03,365 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 15:12:03,367 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 15:12:03,368 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 15:12:03,368 INFO L175 Difference]: Start difference. First operand has 57 places, 76 transitions, 711 flow. Second operand 4 states and 541 transitions. [2023-08-26 15:12:03,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 118 transitions, 1197 flow [2023-08-26 15:12:03,385 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 15:12:03,388 INFO L231 Difference]: Finished difference. Result has 61 places, 84 transitions, 830 flow [2023-08-26 15:12:03,388 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 15:12:03,389 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-26 15:12:03,389 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 84 transitions, 830 flow [2023-08-26 15:12:03,390 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 15:12:03,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:03,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:03,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:12:03,390 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 15:12:03,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash 412885549, now seen corresponding path program 1 times [2023-08-26 15:12:03,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:03,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128389661] [2023-08-26 15:12:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:03,883 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 15:12:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:03,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128389661] [2023-08-26 15:12:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128389661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:03,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:03,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597254916] [2023-08-26 15:12:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:03,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:03,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:03,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 291 [2023-08-26 15:12:03,887 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 15:12:03,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:03,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 291 [2023-08-26 15:12:03,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:05,089 INFO L124 PetriNetUnfolderBase]: 8723/12399 cut-off events. [2023-08-26 15:12:05,089 INFO L125 PetriNetUnfolderBase]: For 45635/46161 co-relation queries the response was YES. [2023-08-26 15:12:05,123 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 15:12:05,175 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 83 selfloop transitions, 41 changer transitions 0/135 dead transitions. [2023-08-26 15:12:05,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 135 transitions, 1407 flow [2023-08-26 15:12:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-08-26 15:12:05,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639175257731959 [2023-08-26 15:12:05,177 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-08-26 15:12:05,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-08-26 15:12:05,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:05,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-08-26 15:12:05,180 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 15:12:05,183 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 15:12:05,185 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 15:12:05,185 INFO L175 Difference]: Start difference. First operand has 61 places, 84 transitions, 830 flow. Second operand 5 states and 675 transitions. [2023-08-26 15:12:05,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 135 transitions, 1407 flow [2023-08-26 15:12:05,218 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 15:12:05,221 INFO L231 Difference]: Finished difference. Result has 65 places, 95 transitions, 1054 flow [2023-08-26 15:12:05,221 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 15:12:05,223 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2023-08-26 15:12:05,224 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 95 transitions, 1054 flow [2023-08-26 15:12:05,224 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 15:12:05,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:05,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:05,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:12:05,224 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 15:12:05,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash 408483859, now seen corresponding path program 2 times [2023-08-26 15:12:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14940941] [2023-08-26 15:12:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:05,660 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 15:12:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14940941] [2023-08-26 15:12:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14940941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:05,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890089258] [2023-08-26 15:12:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:05,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:05,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:05,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:05,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 15:12:05,667 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 15:12:05,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:05,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 15:12:05,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:06,995 INFO L124 PetriNetUnfolderBase]: 10409/14919 cut-off events. [2023-08-26 15:12:06,995 INFO L125 PetriNetUnfolderBase]: For 74095/74644 co-relation queries the response was YES. [2023-08-26 15:12:07,066 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 15:12:07,122 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 95 selfloop transitions, 70 changer transitions 0/176 dead transitions. [2023-08-26 15:12:07,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 176 transitions, 1994 flow [2023-08-26 15:12:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:12:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:12:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-08-26 15:12:07,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581901489117984 [2023-08-26 15:12:07,126 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-08-26 15:12:07,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-08-26 15:12:07,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:07,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-08-26 15:12:07,128 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 15:12:07,131 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 15:12:07,131 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 15:12:07,132 INFO L175 Difference]: Start difference. First operand has 65 places, 95 transitions, 1054 flow. Second operand 6 states and 800 transitions. [2023-08-26 15:12:07,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 176 transitions, 1994 flow [2023-08-26 15:12:07,229 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 15:12:07,232 INFO L231 Difference]: Finished difference. Result has 69 places, 119 transitions, 1486 flow [2023-08-26 15:12:07,233 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 15:12:07,233 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 15:12:07,233 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 119 transitions, 1486 flow [2023-08-26 15:12:07,234 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 15:12:07,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:07,234 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 15:12:07,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:12:07,234 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 15:12:07,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash -85454007, now seen corresponding path program 1 times [2023-08-26 15:12:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:07,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136802167] [2023-08-26 15:12:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:07,835 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 15:12:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136802167] [2023-08-26 15:12:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136802167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:07,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537880539] [2023-08-26 15:12:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:07,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:07,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-08-26 15:12:07,838 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 15:12:07,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:07,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-08-26 15:12:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:09,385 INFO L124 PetriNetUnfolderBase]: 11498/16491 cut-off events. [2023-08-26 15:12:09,385 INFO L125 PetriNetUnfolderBase]: For 113695/114380 co-relation queries the response was YES. [2023-08-26 15:12:09,468 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 15:12:09,530 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 120 selfloop transitions, 45 changer transitions 0/176 dead transitions. [2023-08-26 15:12:09,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 176 transitions, 2318 flow [2023-08-26 15:12:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-08-26 15:12:09,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4611683848797251 [2023-08-26 15:12:09,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-08-26 15:12:09,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-08-26 15:12:09,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:09,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-08-26 15:12:09,535 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 15:12:09,537 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 15:12:09,537 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 15:12:09,537 INFO L175 Difference]: Start difference. First operand has 69 places, 119 transitions, 1486 flow. Second operand 5 states and 671 transitions. [2023-08-26 15:12:09,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 176 transitions, 2318 flow [2023-08-26 15:12:09,749 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 15:12:09,752 INFO L231 Difference]: Finished difference. Result has 72 places, 129 transitions, 1657 flow [2023-08-26 15:12:09,752 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 15:12:09,752 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-26 15:12:09,752 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 129 transitions, 1657 flow [2023-08-26 15:12:09,753 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 15:12:09,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:09,753 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 15:12:09,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:12:09,753 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 15:12:09,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -972034167, now seen corresponding path program 2 times [2023-08-26 15:12:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940570522] [2023-08-26 15:12:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:10,429 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 15:12:10,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940570522] [2023-08-26 15:12:10,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940570522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:10,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:10,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:10,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609193937] [2023-08-26 15:12:10,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:10,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:10,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:10,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 291 [2023-08-26 15:12:10,433 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 15:12:10,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:10,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 291 [2023-08-26 15:12:10,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:12,443 INFO L124 PetriNetUnfolderBase]: 12360/17796 cut-off events. [2023-08-26 15:12:12,443 INFO L125 PetriNetUnfolderBase]: For 125342/126163 co-relation queries the response was YES. [2023-08-26 15:12:12,709 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 15:12:12,770 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 121 selfloop transitions, 89 changer transitions 0/221 dead transitions. [2023-08-26 15:12:12,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 221 transitions, 2935 flow [2023-08-26 15:12:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:12:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:12:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 796 transitions. [2023-08-26 15:12:12,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4558991981672394 [2023-08-26 15:12:12,774 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 796 transitions. [2023-08-26 15:12:12,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 796 transitions. [2023-08-26 15:12:12,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:12,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 796 transitions. [2023-08-26 15:12:12,776 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 15:12:12,779 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 15:12:12,779 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 15:12:12,779 INFO L175 Difference]: Start difference. First operand has 72 places, 129 transitions, 1657 flow. Second operand 6 states and 796 transitions. [2023-08-26 15:12:12,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 221 transitions, 2935 flow [2023-08-26 15:12:13,043 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 15:12:13,046 INFO L231 Difference]: Finished difference. Result has 75 places, 154 transitions, 2184 flow [2023-08-26 15:12:13,047 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 15:12:13,047 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2023-08-26 15:12:13,047 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 154 transitions, 2184 flow [2023-08-26 15:12:13,048 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 15:12:13,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:13,048 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 15:12:13,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:12:13,048 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 15:12:13,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:13,048 INFO L85 PathProgramCache]: Analyzing trace with hash -83514461, now seen corresponding path program 1 times [2023-08-26 15:12:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659477490] [2023-08-26 15:12:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:13,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:13,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 15:12:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:13,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659477490] [2023-08-26 15:12:13,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659477490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:13,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:13,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98325210] [2023-08-26 15:12:13,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:13,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:12:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:13,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:12:13,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:12:13,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 291 [2023-08-26 15:12:13,386 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 15:12:13,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:13,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 291 [2023-08-26 15:12:13,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:15,904 INFO L124 PetriNetUnfolderBase]: 20423/28282 cut-off events. [2023-08-26 15:12:15,904 INFO L125 PetriNetUnfolderBase]: For 188122/188122 co-relation queries the response was YES. [2023-08-26 15:12:16,049 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 15:12:16,120 INFO L140 encePairwiseOnDemand]: 278/291 looper letters, 143 selfloop transitions, 121 changer transitions 89/353 dead transitions. [2023-08-26 15:12:16,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 353 transitions, 5428 flow [2023-08-26 15:12:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:12:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:12:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-26 15:12:16,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42668957617411224 [2023-08-26 15:12:16,123 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-26 15:12:16,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-26 15:12:16,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:16,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-26 15:12:16,126 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 15:12:16,128 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 15:12:16,128 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 15:12:16,129 INFO L175 Difference]: Start difference. First operand has 75 places, 154 transitions, 2184 flow. Second operand 6 states and 745 transitions. [2023-08-26 15:12:16,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 353 transitions, 5428 flow [2023-08-26 15:12:16,557 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 15:12:16,561 INFO L231 Difference]: Finished difference. Result has 85 places, 196 transitions, 3254 flow [2023-08-26 15:12:16,561 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 15:12:16,562 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2023-08-26 15:12:16,562 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 196 transitions, 3254 flow [2023-08-26 15:12:16,562 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 15:12:16,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:16,562 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 15:12:16,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:12:16,563 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 15:12:16,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1760833109, now seen corresponding path program 2 times [2023-08-26 15:12:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8166217] [2023-08-26 15:12:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:16,706 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 15:12:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:16,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8166217] [2023-08-26 15:12:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8166217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:16,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:12:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456250635] [2023-08-26 15:12:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:16,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:12:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:16,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:12:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:12:16,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 15:12:16,708 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 15:12:16,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:16,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 15:12:16,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:19,122 INFO L124 PetriNetUnfolderBase]: 12288/18058 cut-off events. [2023-08-26 15:12:19,122 INFO L125 PetriNetUnfolderBase]: For 270337/273817 co-relation queries the response was YES. [2023-08-26 15:12:19,192 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 15:12:19,250 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 409 selfloop transitions, 10 changer transitions 40/479 dead transitions. [2023-08-26 15:12:19,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 479 transitions, 8957 flow [2023-08-26 15:12:19,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-26 15:12:19,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45910652920962197 [2023-08-26 15:12:19,252 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-26 15:12:19,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-26 15:12:19,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:19,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-26 15:12:19,254 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 15:12:19,256 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 15:12:19,256 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 15:12:19,256 INFO L175 Difference]: Start difference. First operand has 85 places, 196 transitions, 3254 flow. Second operand 5 states and 668 transitions. [2023-08-26 15:12:19,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 479 transitions, 8957 flow [2023-08-26 15:12:19,485 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 15:12:19,490 INFO L231 Difference]: Finished difference. Result has 91 places, 178 transitions, 2780 flow [2023-08-26 15:12:19,490 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 15:12:19,491 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2023-08-26 15:12:19,491 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 178 transitions, 2780 flow [2023-08-26 15:12:19,491 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 15:12:19,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:19,491 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 15:12:19,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:12:19,492 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 15:12:19,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1524709930, now seen corresponding path program 1 times [2023-08-26 15:12:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386966067] [2023-08-26 15:12:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:19,660 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 15:12:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386966067] [2023-08-26 15:12:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386966067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:19,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:12:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248922616] [2023-08-26 15:12:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:19,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:12:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:19,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:12:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:12:19,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 15:12:19,663 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 15:12:19,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:19,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 15:12:19,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:21,613 INFO L124 PetriNetUnfolderBase]: 9904/14822 cut-off events. [2023-08-26 15:12:21,614 INFO L125 PetriNetUnfolderBase]: For 235707/239817 co-relation queries the response was YES. [2023-08-26 15:12:21,676 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 15:12:21,717 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 461 selfloop transitions, 19 changer transitions 61/561 dead transitions. [2023-08-26 15:12:21,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 561 transitions, 10270 flow [2023-08-26 15:12:21,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 937 transitions. [2023-08-26 15:12:21,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45999018163966615 [2023-08-26 15:12:21,720 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 937 transitions. [2023-08-26 15:12:21,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 937 transitions. [2023-08-26 15:12:21,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:21,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 937 transitions. [2023-08-26 15:12:21,722 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 15:12:21,724 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 15:12:21,724 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 15:12:21,724 INFO L175 Difference]: Start difference. First operand has 91 places, 178 transitions, 2780 flow. Second operand 7 states and 937 transitions. [2023-08-26 15:12:21,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 561 transitions, 10270 flow [2023-08-26 15:12:21,957 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 15:12:21,962 INFO L231 Difference]: Finished difference. Result has 99 places, 159 transitions, 2415 flow [2023-08-26 15:12:21,962 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 15:12:21,962 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 49 predicate places. [2023-08-26 15:12:21,962 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 159 transitions, 2415 flow [2023-08-26 15:12:21,963 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 15:12:21,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:21,963 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 15:12:21,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:12:21,963 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 15:12:21,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash -362789357, now seen corresponding path program 1 times [2023-08-26 15:12:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164524355] [2023-08-26 15:12:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:21,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:22,305 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 15:12:22,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164524355] [2023-08-26 15:12:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164524355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:22,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:12:22,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070151079] [2023-08-26 15:12:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:22,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:12:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:12:22,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:12:22,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 291 [2023-08-26 15:12:22,308 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 15:12:22,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:22,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 291 [2023-08-26 15:12:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:24,860 INFO L124 PetriNetUnfolderBase]: 15932/23706 cut-off events. [2023-08-26 15:12:24,860 INFO L125 PetriNetUnfolderBase]: For 232659/232659 co-relation queries the response was YES. [2023-08-26 15:12:24,988 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 15:12:25,019 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 123 selfloop transitions, 16 changer transitions 97/236 dead transitions. [2023-08-26 15:12:25,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 236 transitions, 3686 flow [2023-08-26 15:12:25,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:12:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:12:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-26 15:12:25,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338487972508591 [2023-08-26 15:12:25,021 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-26 15:12:25,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-26 15:12:25,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:25,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-26 15:12:25,022 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 15:12:25,023 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 15:12:25,024 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 15:12:25,024 INFO L175 Difference]: Start difference. First operand has 99 places, 159 transitions, 2415 flow. Second operand 4 states and 505 transitions. [2023-08-26 15:12:25,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 236 transitions, 3686 flow [2023-08-26 15:12:26,540 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 15:12:26,542 INFO L231 Difference]: Finished difference. Result has 100 places, 102 transitions, 1403 flow [2023-08-26 15:12:26,543 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 15:12:26,543 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 50 predicate places. [2023-08-26 15:12:26,543 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 102 transitions, 1403 flow [2023-08-26 15:12:26,543 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 15:12:26,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:26,544 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 15:12:26,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:12:26,544 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 15:12:26,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1491430714, now seen corresponding path program 1 times [2023-08-26 15:12:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276720035] [2023-08-26 15:12:26,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:26,699 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 15:12:26,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:26,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276720035] [2023-08-26 15:12:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276720035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:26,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:26,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845869655] [2023-08-26 15:12:26,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:26,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:12:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:26,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:12:26,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:12:26,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 15:12:26,702 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 15:12:26,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:26,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 15:12:26,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:27,679 INFO L124 PetriNetUnfolderBase]: 4000/6535 cut-off events. [2023-08-26 15:12:27,679 INFO L125 PetriNetUnfolderBase]: For 101611/102547 co-relation queries the response was YES. [2023-08-26 15:12:27,704 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 15:12:27,717 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 183 selfloop transitions, 18 changer transitions 40/256 dead transitions. [2023-08-26 15:12:27,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 256 transitions, 4029 flow [2023-08-26 15:12:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 938 transitions. [2023-08-26 15:12:27,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46048109965635736 [2023-08-26 15:12:27,720 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 938 transitions. [2023-08-26 15:12:27,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 938 transitions. [2023-08-26 15:12:27,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:27,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 938 transitions. [2023-08-26 15:12:27,722 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 15:12:27,724 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 15:12:27,725 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 15:12:27,725 INFO L175 Difference]: Start difference. First operand has 100 places, 102 transitions, 1403 flow. Second operand 7 states and 938 transitions. [2023-08-26 15:12:27,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 256 transitions, 4029 flow [2023-08-26 15:12:27,823 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 15:12:27,826 INFO L231 Difference]: Finished difference. Result has 100 places, 101 transitions, 1304 flow [2023-08-26 15:12:27,826 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 15:12:27,826 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 50 predicate places. [2023-08-26 15:12:27,827 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 101 transitions, 1304 flow [2023-08-26 15:12:27,827 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 15:12:27,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:27,827 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 15:12:27,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:12:27,827 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 15:12:27,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1595035376, now seen corresponding path program 1 times [2023-08-26 15:12:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:27,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769255019] [2023-08-26 15:12:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:28,004 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 15:12:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769255019] [2023-08-26 15:12:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769255019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:28,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:28,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:12:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522703868] [2023-08-26 15:12:28,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:28,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:28,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:28,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2023-08-26 15:12:28,009 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 15:12:28,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:28,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2023-08-26 15:12:28,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:28,799 INFO L124 PetriNetUnfolderBase]: 3753/6050 cut-off events. [2023-08-26 15:12:28,799 INFO L125 PetriNetUnfolderBase]: For 67270/67804 co-relation queries the response was YES. [2023-08-26 15:12:28,824 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 15:12:28,834 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 140 selfloop transitions, 23 changer transitions 73/247 dead transitions. [2023-08-26 15:12:28,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 247 transitions, 3774 flow [2023-08-26 15:12:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:12:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:12:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1179 transitions. [2023-08-26 15:12:28,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45017182130584193 [2023-08-26 15:12:28,837 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1179 transitions. [2023-08-26 15:12:28,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1179 transitions. [2023-08-26 15:12:28,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:28,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1179 transitions. [2023-08-26 15:12:28,840 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 15:12:28,844 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 15:12:28,845 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 15:12:28,845 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 1304 flow. Second operand 9 states and 1179 transitions. [2023-08-26 15:12:28,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 247 transitions, 3774 flow [2023-08-26 15:12:29,092 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 15:12:29,094 INFO L231 Difference]: Finished difference. Result has 106 places, 80 transitions, 931 flow [2023-08-26 15:12:29,095 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 15:12:29,095 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 56 predicate places. [2023-08-26 15:12:29,095 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 931 flow [2023-08-26 15:12:29,096 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 15:12:29,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:29,096 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 15:12:29,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:12:29,096 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 15:12:29,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1466166705, now seen corresponding path program 1 times [2023-08-26 15:12:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:29,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034565563] [2023-08-26 15:12:29,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:29,263 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 15:12:29,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:29,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034565563] [2023-08-26 15:12:29,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034565563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:29,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:29,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:12:29,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703306844] [2023-08-26 15:12:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:29,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:12:29,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:29,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:12:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:12:29,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 291 [2023-08-26 15:12:29,277 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 15:12:29,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:29,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 291 [2023-08-26 15:12:29,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:29,616 INFO L124 PetriNetUnfolderBase]: 1408/2369 cut-off events. [2023-08-26 15:12:29,616 INFO L125 PetriNetUnfolderBase]: For 18939/18994 co-relation queries the response was YES. [2023-08-26 15:12:29,628 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 15:12:29,632 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 53 selfloop transitions, 1 changer transitions 88/146 dead transitions. [2023-08-26 15:12:29,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 146 transitions, 1963 flow [2023-08-26 15:12:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:12:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:12:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-08-26 15:12:29,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699312714776632 [2023-08-26 15:12:29,634 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-08-26 15:12:29,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-08-26 15:12:29,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:29,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-08-26 15:12:29,636 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 15:12:29,638 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 15:12:29,638 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 15:12:29,638 INFO L175 Difference]: Start difference. First operand has 106 places, 80 transitions, 931 flow. Second operand 4 states and 547 transitions. [2023-08-26 15:12:29,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 146 transitions, 1963 flow [2023-08-26 15:12:29,677 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 15:12:29,678 INFO L231 Difference]: Finished difference. Result has 93 places, 50 transitions, 456 flow [2023-08-26 15:12:29,679 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 15:12:29,680 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2023-08-26 15:12:29,680 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 50 transitions, 456 flow [2023-08-26 15:12:29,680 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 15:12:29,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:29,681 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 15:12:29,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:12:29,681 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 15:12:29,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -703087425, now seen corresponding path program 2 times [2023-08-26 15:12:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022876430] [2023-08-26 15:12:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:30,575 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 15:12:30,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:30,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022876430] [2023-08-26 15:12:30,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022876430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:30,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:12:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677873423] [2023-08-26 15:12:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:30,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:12:30,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:30,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:12:30,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:12:30,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 291 [2023-08-26 15:12:30,580 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 15:12:30,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:30,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 291 [2023-08-26 15:12:30,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:30,811 INFO L124 PetriNetUnfolderBase]: 398/731 cut-off events. [2023-08-26 15:12:30,811 INFO L125 PetriNetUnfolderBase]: For 4806/4810 co-relation queries the response was YES. [2023-08-26 15:12:30,814 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 15:12:30,815 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 57 selfloop transitions, 11 changer transitions 9/80 dead transitions. [2023-08-26 15:12:30,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 80 transitions, 828 flow [2023-08-26 15:12:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:12:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:12:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-26 15:12:30,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357388316151203 [2023-08-26 15:12:30,817 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-26 15:12:30,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-26 15:12:30,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:30,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-26 15:12:30,819 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 15:12:30,821 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 15:12:30,822 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 15:12:30,822 INFO L175 Difference]: Start difference. First operand has 93 places, 50 transitions, 456 flow. Second operand 5 states and 634 transitions. [2023-08-26 15:12:30,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 80 transitions, 828 flow [2023-08-26 15:12:30,835 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 15:12:30,836 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 376 flow [2023-08-26 15:12:30,836 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 15:12:30,837 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2023-08-26 15:12:30,837 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 376 flow [2023-08-26 15:12:30,837 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 15:12:30,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:30,837 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 15:12:30,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:12:30,837 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 15:12:30,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:30,838 INFO L85 PathProgramCache]: Analyzing trace with hash -549559819, now seen corresponding path program 3 times [2023-08-26 15:12:30,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:30,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961097740] [2023-08-26 15:12:30,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:12:32,069 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 15:12:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:12:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961097740] [2023-08-26 15:12:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961097740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:12:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:12:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:12:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35661101] [2023-08-26 15:12:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:12:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:12:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:12:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:12:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:12:32,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 291 [2023-08-26 15:12:32,073 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 15:12:32,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:12:32,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 291 [2023-08-26 15:12:32,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:12:32,447 INFO L124 PetriNetUnfolderBase]: 418/777 cut-off events. [2023-08-26 15:12:32,447 INFO L125 PetriNetUnfolderBase]: For 2415/2419 co-relation queries the response was YES. [2023-08-26 15:12:32,450 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 15:12:32,451 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 52 selfloop transitions, 5 changer transitions 31/91 dead transitions. [2023-08-26 15:12:32,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 789 flow [2023-08-26 15:12:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:12:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:12:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2023-08-26 15:12:32,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256259204712813 [2023-08-26 15:12:32,454 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2023-08-26 15:12:32,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2023-08-26 15:12:32,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:12:32,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2023-08-26 15:12:32,457 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 15:12:32,459 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 15:12:32,459 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 15:12:32,460 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 376 flow. Second operand 7 states and 867 transitions. [2023-08-26 15:12:32,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 789 flow [2023-08-26 15:12:32,466 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 15:12:32,467 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 351 flow [2023-08-26 15:12:32,467 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 15:12:32,468 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2023-08-26 15:12:32,468 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 351 flow [2023-08-26 15:12:32,468 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 15:12:32,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:12:32,469 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 15:12:32,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 15:12:32,469 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 15:12:32,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:12:32,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2016304329, now seen corresponding path program 4 times [2023-08-26 15:12:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:12:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670103538] [2023-08-26 15:12:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:12:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:12:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:12:32,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:12:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:12:32,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:12:32,594 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:12:32,595 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 15:12:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 15:12:32,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 15:12:32,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 15:12:32,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 15:12:32,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 15:12:32,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 15:12:32,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 15:12:32,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 15:12:32,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 15:12:32,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 15:12:32,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 15:12:32,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 15:12:32,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 15:12:32,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 15:12:32,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 15:12:32,602 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:12:32,609 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:12:32,609 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:12:32,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:12:32 BasicIcfg [2023-08-26 15:12:32,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:12:32,712 INFO L158 Benchmark]: Toolchain (without parser) took 46730.67ms. Allocated memory was 371.2MB in the beginning and 6.4GB in the end (delta: 6.0GB). Free memory was 345.7MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-08-26 15:12:32,712 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 371.2MB. Free memory was 348.0MB in the beginning and 347.9MB in the end (delta: 107.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:12:32,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.18ms. Allocated memory is still 371.2MB. Free memory was 345.7MB in the beginning and 321.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:12:32,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.14ms. Allocated memory is still 371.2MB. Free memory was 321.6MB in the beginning and 318.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 15:12:32,712 INFO L158 Benchmark]: Boogie Preprocessor took 50.95ms. Allocated memory is still 371.2MB. Free memory was 318.7MB in the beginning and 316.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:12:32,713 INFO L158 Benchmark]: RCFGBuilder took 655.80ms. Allocated memory is still 371.2MB. Free memory was 316.7MB in the beginning and 275.6MB in the end (delta: 41.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-26 15:12:32,713 INFO L158 Benchmark]: TraceAbstraction took 45372.54ms. Allocated memory was 371.2MB in the beginning and 6.4GB in the end (delta: 6.0GB). Free memory was 275.3MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-26 15:12:32,714 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.11ms. Allocated memory is still 371.2MB. Free memory was 348.0MB in the beginning and 347.9MB in the end (delta: 107.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 587.18ms. Allocated memory is still 371.2MB. Free memory was 345.7MB in the beginning and 321.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.14ms. Allocated memory is still 371.2MB. Free memory was 321.6MB in the beginning and 318.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.95ms. Allocated memory is still 371.2MB. Free memory was 318.7MB in the beginning and 316.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 655.80ms. Allocated memory is still 371.2MB. Free memory was 316.7MB in the beginning and 275.6MB in the end (delta: 41.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 45372.54ms. Allocated memory was 371.2MB in the beginning and 6.4GB in the end (delta: 6.0GB). Free memory was 275.3MB in the beginning and 5.0GB in the end (delta: -4.7GB). Peak memory consumption was 1.3GB. 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.4s, 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.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, 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.0s 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.5s SatisfiabilityAnalysisTime, 7.9s 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 15:12:32,742 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...