/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 20:05:20,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 20:05:20,339 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 20:05:20,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 20:05:20,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 20:05:20,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 20:05:20,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 20:05:20,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 20:05:20,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 20:05:20,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 20:05:20,380 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 20:05:20,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 20:05:20,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 20:05:20,382 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 20:05:20,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 20:05:20,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 20:05:20,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 20:05:20,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 20:05:20,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 20:05:20,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 20:05:20,383 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 20:05:20,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 20:05:20,384 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 20:05:20,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 20:05:20,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 20:05:20,385 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 20:05:20,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 20:05:20,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:05:20,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 20:05:20,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 20:05:20,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 20:05:20,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 20:05:20,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 20:05:20,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 20:05:20,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 20:05:20,388 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 20:05:20,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 20:05:20,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 20:05:20,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 20:05:20,749 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 20:05:20,749 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 20:05:20,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-26 20:05:21,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 20:05:22,095 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 20:05:22,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2023-08-26 20:05:22,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bd741f4/033a02e1764841679fde43ceedea5a24/FLAG1ffc6018a [2023-08-26 20:05:22,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bd741f4/033a02e1764841679fde43ceedea5a24 [2023-08-26 20:05:22,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 20:05:22,115 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 20:05:22,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 20:05:22,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 20:05:22,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 20:05:22,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b32388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22, skipping insertion in model container [2023-08-26 20:05:22,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 20:05:22,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:05:22,335 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 20:05:22,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 20:05:22,379 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 20:05:22,380 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 20:05:22,386 INFO L206 MainTranslator]: Completed translation [2023-08-26 20:05:22,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22 WrapperNode [2023-08-26 20:05:22,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 20:05:22,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 20:05:22,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 20:05:22,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 20:05:22,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,437 INFO L138 Inliner]: procedures = 23, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-08-26 20:05:22,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 20:05:22,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 20:05:22,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 20:05:22,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 20:05:22,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 20:05:22,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 20:05:22,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 20:05:22,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 20:05:22,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (1/1) ... [2023-08-26 20:05:22,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 20:05:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:05:22,510 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 20:05:22,537 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 20:05:22,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 20:05:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 20:05:22,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 20:05:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 20:05:22,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 20:05:22,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 20:05:22,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 20:05:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 20:05:22,552 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 20:05:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 20:05:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 20:05:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 20:05:22,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 20:05:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 20:05:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 20:05:22,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 20:05:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 20:05:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 20:05:22,555 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 20:05:22,668 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 20:05:22,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 20:05:22,929 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 20:05:22,965 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 20:05:22,965 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 20:05:22,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:05:22 BoogieIcfgContainer [2023-08-26 20:05:22,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 20:05:22,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 20:05:22,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 20:05:22,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 20:05:22,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:05:22" (1/3) ... [2023-08-26 20:05:22,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b2e34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:05:22, skipping insertion in model container [2023-08-26 20:05:22,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:05:22" (2/3) ... [2023-08-26 20:05:22,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b2e34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:05:22, skipping insertion in model container [2023-08-26 20:05:22,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:05:22" (3/3) ... [2023-08-26 20:05:22,974 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2023-08-26 20:05:22,991 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 20:05:22,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-08-26 20:05:22,991 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 20:05:23,085 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-26 20:05:23,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 141 transitions, 314 flow [2023-08-26 20:05:23,186 INFO L124 PetriNetUnfolderBase]: 9/137 cut-off events. [2023-08-26 20:05:23,186 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 20:05:23,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 9/137 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 166 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-26 20:05:23,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 141 transitions, 314 flow [2023-08-26 20:05:23,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 124 transitions, 272 flow [2023-08-26 20:05:23,205 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 20:05:23,217 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 124 transitions, 272 flow [2023-08-26 20:05:23,225 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 124 transitions, 272 flow [2023-08-26 20:05:23,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 124 transitions, 272 flow [2023-08-26 20:05:23,278 INFO L124 PetriNetUnfolderBase]: 9/124 cut-off events. [2023-08-26 20:05:23,278 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 20:05:23,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 124 events. 9/124 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 167 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-26 20:05:23,283 INFO L119 LiptonReduction]: Number of co-enabled transitions 3608 [2023-08-26 20:05:27,095 INFO L134 LiptonReduction]: Checked pairs total: 3733 [2023-08-26 20:05:27,095 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 20:05:27,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 20:05:27,112 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;@5a9a3b2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 20:05:27,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-26 20:05:27,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 20:05:27,113 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 20:05:27,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 20:05:27,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:27,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 20:05:27,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:27,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash 567, now seen corresponding path program 1 times [2023-08-26 20:05:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:27,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330857141] [2023-08-26 20:05:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:27,202 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 20:05:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330857141] [2023-08-26 20:05:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330857141] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 20:05:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862735300] [2023-08-26 20:05:27,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:27,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 20:05:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:27,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 20:05:27,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 20:05:27,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 257 [2023-08-26 20:05:27,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 114 flow. Second operand has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:27,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:27,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 257 [2023-08-26 20:05:27,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:27,573 INFO L124 PetriNetUnfolderBase]: 2546/3185 cut-off events. [2023-08-26 20:05:27,573 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-26 20:05:27,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6469 conditions, 3185 events. 2546/3185 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11580 event pairs, 1193 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 5013. Up to 3159 conditions per place. [2023-08-26 20:05:27,596 INFO L140 encePairwiseOnDemand]: 255/257 looper letters, 39 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-08-26 20:05:27,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 188 flow [2023-08-26 20:05:27,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 20:05:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 20:05:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-26 20:05:27,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583657587548638 [2023-08-26 20:05:27,609 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-26 20:05:27,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-26 20:05:27,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:27,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-26 20:05:27,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:27,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:27,618 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:27,619 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 114 flow. Second operand 2 states and 287 transitions. [2023-08-26 20:05:27,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 188 flow [2023-08-26 20:05:27,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-26 20:05:27,626 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 94 flow [2023-08-26 20:05:27,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-26 20:05:27,631 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-08-26 20:05:27,631 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 94 flow [2023-08-26 20:05:27,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:27,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:27,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 20:05:27,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 20:05:27,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:27,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash 557160, now seen corresponding path program 1 times [2023-08-26 20:05:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:27,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213981299] [2023-08-26 20:05:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:27,918 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 20:05:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:27,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213981299] [2023-08-26 20:05:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213981299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:27,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:27,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:05:27,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020869509] [2023-08-26 20:05:27,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:27,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:05:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:05:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:05:27,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 257 [2023-08-26 20:05:27,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:27,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:27,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 257 [2023-08-26 20:05:27,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:28,183 INFO L124 PetriNetUnfolderBase]: 2435/3044 cut-off events. [2023-08-26 20:05:28,183 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:05:28,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 3044 events. 2435/3044 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10862 event pairs, 1138 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 6101. Up to 3017 conditions per place. [2023-08-26 20:05:28,201 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 36 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 20:05:28,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 164 flow [2023-08-26 20:05:28,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-08-26 20:05:28,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4085603112840467 [2023-08-26 20:05:28,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-08-26 20:05:28,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-08-26 20:05:28,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:28,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-08-26 20:05:28,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,215 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 3 states and 315 transitions. [2023-08-26 20:05:28,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 164 flow [2023-08-26 20:05:28,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 20:05:28,218 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 92 flow [2023-08-26 20:05:28,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-08-26 20:05:28,219 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-08-26 20:05:28,219 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 92 flow [2023-08-26 20:05:28,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:28,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 20:05:28,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 20:05:28,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:28,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash 557161, now seen corresponding path program 1 times [2023-08-26 20:05:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359195497] [2023-08-26 20:05:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:28,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:28,368 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 20:05:28,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:28,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359195497] [2023-08-26 20:05:28,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359195497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:28,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:05:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604139478] [2023-08-26 20:05:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:28,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:05:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:05:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:05:28,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 257 [2023-08-26 20:05:28,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:28,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 257 [2023-08-26 20:05:28,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:28,568 INFO L124 PetriNetUnfolderBase]: 2324/2903 cut-off events. [2023-08-26 20:05:28,568 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:05:28,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5824 conditions, 2903 events. 2324/2903 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10268 event pairs, 1083 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 5820. Up to 2876 conditions per place. [2023-08-26 20:05:28,587 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 34 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 20:05:28,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 158 flow [2023-08-26 20:05:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-26 20:05:28,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42153047989623865 [2023-08-26 20:05:28,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-26 20:05:28,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-26 20:05:28,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:28,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-26 20:05:28,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,593 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 92 flow. Second operand 3 states and 325 transitions. [2023-08-26 20:05:28,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 158 flow [2023-08-26 20:05:28,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:28,595 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 89 flow [2023-08-26 20:05:28,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-26 20:05:28,596 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-26 20:05:28,596 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 89 flow [2023-08-26 20:05:28,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:28,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:05:28,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 20:05:28,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:28,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:28,597 INFO L85 PathProgramCache]: Analyzing trace with hash 535446030, now seen corresponding path program 1 times [2023-08-26 20:05:28,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:28,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948803292] [2023-08-26 20:05:28,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:28,719 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 20:05:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:28,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948803292] [2023-08-26 20:05:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948803292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:28,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:28,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:05:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619092546] [2023-08-26 20:05:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:28,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:05:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:05:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:05:28,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 257 [2023-08-26 20:05:28,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:28,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 257 [2023-08-26 20:05:28,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:28,955 INFO L124 PetriNetUnfolderBase]: 2278/2839 cut-off events. [2023-08-26 20:05:28,956 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:05:28,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5697 conditions, 2839 events. 2278/2839 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9934 event pairs, 1061 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 5693. Up to 2812 conditions per place. [2023-08-26 20:05:28,970 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 32 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-26 20:05:28,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 151 flow [2023-08-26 20:05:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-26 20:05:28,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41893644617380027 [2023-08-26 20:05:28,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-26 20:05:28,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-26 20:05:28,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:28,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-26 20:05:28,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,975 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 89 flow. Second operand 3 states and 323 transitions. [2023-08-26 20:05:28,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 151 flow [2023-08-26 20:05:28,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:28,977 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 86 flow [2023-08-26 20:05:28,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-26 20:05:28,978 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-26 20:05:28,978 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 86 flow [2023-08-26 20:05:28,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:28,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:28,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 20:05:28,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 20:05:28,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:28,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash 535446029, now seen corresponding path program 1 times [2023-08-26 20:05:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:28,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113643332] [2023-08-26 20:05:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:29,018 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 20:05:29,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113643332] [2023-08-26 20:05:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113643332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:29,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:29,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:05:29,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103535665] [2023-08-26 20:05:29,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:29,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:05:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:29,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:05:29,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:05:29,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 257 [2023-08-26 20:05:29,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:29,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 257 [2023-08-26 20:05:29,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:29,191 INFO L124 PetriNetUnfolderBase]: 2232/2775 cut-off events. [2023-08-26 20:05:29,191 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:05:29,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5570 conditions, 2775 events. 2232/2775 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9686 event pairs, 1039 based on Foata normal form. 0/1346 useless extension candidates. Maximal degree in co-relation 5566. Up to 2748 conditions per place. [2023-08-26 20:05:29,208 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 30 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-26 20:05:29,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 144 flow [2023-08-26 20:05:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-26 20:05:29,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40077821011673154 [2023-08-26 20:05:29,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-26 20:05:29,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-26 20:05:29,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:29,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-26 20:05:29,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,213 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 86 flow. Second operand 3 states and 309 transitions. [2023-08-26 20:05:29,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 144 flow [2023-08-26 20:05:29,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:29,214 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 83 flow [2023-08-26 20:05:29,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-26 20:05:29,215 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -12 predicate places. [2023-08-26 20:05:29,215 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 83 flow [2023-08-26 20:05:29,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:29,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:05:29,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 20:05:29,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:29,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -832429323, now seen corresponding path program 1 times [2023-08-26 20:05:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:29,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642578668] [2023-08-26 20:05:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:29,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:29,267 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 20:05:29,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:29,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642578668] [2023-08-26 20:05:29,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642578668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:29,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:29,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:05:29,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475026980] [2023-08-26 20:05:29,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:29,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:05:29,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:29,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:05:29,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:05:29,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 257 [2023-08-26 20:05:29,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:29,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 257 [2023-08-26 20:05:29,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:29,469 INFO L124 PetriNetUnfolderBase]: 2126/2639 cut-off events. [2023-08-26 20:05:29,469 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:05:29,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5299 conditions, 2639 events. 2126/2639 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9066 event pairs, 989 based on Foata normal form. 0/1296 useless extension candidates. Maximal degree in co-relation 5295. Up to 2612 conditions per place. [2023-08-26 20:05:29,482 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-26 20:05:29,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 137 flow [2023-08-26 20:05:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-26 20:05:29,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41374837872892345 [2023-08-26 20:05:29,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-26 20:05:29,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-26 20:05:29,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:29,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-26 20:05:29,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,487 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 83 flow. Second operand 3 states and 319 transitions. [2023-08-26 20:05:29,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 137 flow [2023-08-26 20:05:29,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:29,489 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 80 flow [2023-08-26 20:05:29,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-08-26 20:05:29,489 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2023-08-26 20:05:29,490 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 80 flow [2023-08-26 20:05:29,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:29,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:05:29,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 20:05:29,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:29,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash -832429322, now seen corresponding path program 1 times [2023-08-26 20:05:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:29,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501158499] [2023-08-26 20:05:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:29,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:29,525 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 20:05:29,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:29,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501158499] [2023-08-26 20:05:29,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501158499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:29,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:29,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:05:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240249049] [2023-08-26 20:05:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:29,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:05:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:05:29,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:05:29,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 257 [2023-08-26 20:05:29,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:29,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 257 [2023-08-26 20:05:29,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:29,712 INFO L124 PetriNetUnfolderBase]: 2020/2503 cut-off events. [2023-08-26 20:05:29,712 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:05:29,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5028 conditions, 2503 events. 2020/2503 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8491 event pairs, 939 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 5024. Up to 2476 conditions per place. [2023-08-26 20:05:29,724 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 26 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-26 20:05:29,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 130 flow [2023-08-26 20:05:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-08-26 20:05:29,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3955901426718547 [2023-08-26 20:05:29,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-08-26 20:05:29,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-08-26 20:05:29,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:29,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-08-26 20:05:29,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,729 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 80 flow. Second operand 3 states and 305 transitions. [2023-08-26 20:05:29,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 130 flow [2023-08-26 20:05:29,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:29,730 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 77 flow [2023-08-26 20:05:29,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-26 20:05:29,731 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2023-08-26 20:05:29,731 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 77 flow [2023-08-26 20:05:29,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:29,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:05:29,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 20:05:29,731 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:29,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1100647044, now seen corresponding path program 1 times [2023-08-26 20:05:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416084994] [2023-08-26 20:05:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:29,938 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 20:05:29,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:29,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416084994] [2023-08-26 20:05:29,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416084994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:29,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:29,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 20:05:29,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215349585] [2023-08-26 20:05:29,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:29,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:29,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:29,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:29,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:29,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 257 [2023-08-26 20:05:29,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:29,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:29,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 257 [2023-08-26 20:05:29,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:30,078 INFO L124 PetriNetUnfolderBase]: 1606/2008 cut-off events. [2023-08-26 20:05:30,079 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:05:30,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4039 conditions, 2008 events. 1606/2008 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6659 event pairs, 741 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 4035. Up to 1981 conditions per place. [2023-08-26 20:05:30,088 INFO L140 encePairwiseOnDemand]: 255/257 looper letters, 25 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2023-08-26 20:05:30,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 127 flow [2023-08-26 20:05:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-08-26 20:05:30,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.377431906614786 [2023-08-26 20:05:30,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-08-26 20:05:30,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-08-26 20:05:30,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:30,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-08-26 20:05:30,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,092 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 77 flow. Second operand 3 states and 291 transitions. [2023-08-26 20:05:30,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 127 flow [2023-08-26 20:05:30,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:30,093 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2023-08-26 20:05:30,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 20:05:30,094 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2023-08-26 20:05:30,094 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2023-08-26 20:05:30,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:30,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:05:30,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 20:05:30,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:30,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:30,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1100647046, now seen corresponding path program 1 times [2023-08-26 20:05:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:30,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118050939] [2023-08-26 20:05:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:30,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:30,185 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 20:05:30,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:30,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118050939] [2023-08-26 20:05:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118050939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:30,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:30,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 20:05:30,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766219884] [2023-08-26 20:05:30,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:30,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 20:05:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:30,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 20:05:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 20:05:30,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 257 [2023-08-26 20:05:30,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:30,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 257 [2023-08-26 20:05:30,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:30,306 INFO L124 PetriNetUnfolderBase]: 1192/1513 cut-off events. [2023-08-26 20:05:30,306 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 20:05:30,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3050 conditions, 1513 events. 1192/1513 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4885 event pairs, 543 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 3046. Up to 1486 conditions per place. [2023-08-26 20:05:30,312 INFO L140 encePairwiseOnDemand]: 255/257 looper letters, 24 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-26 20:05:30,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 124 flow [2023-08-26 20:05:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-26 20:05:30,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35667963683527887 [2023-08-26 20:05:30,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-26 20:05:30,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-26 20:05:30,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:30,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-26 20:05:30,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,316 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,316 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 3 states and 275 transitions. [2023-08-26 20:05:30,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 124 flow [2023-08-26 20:05:30,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:30,317 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 75 flow [2023-08-26 20:05:30,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-26 20:05:30,318 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -14 predicate places. [2023-08-26 20:05:30,318 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 75 flow [2023-08-26 20:05:30,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:30,319 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] [2023-08-26 20:05:30,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 20:05:30,319 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:30,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1866693389, now seen corresponding path program 1 times [2023-08-26 20:05:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017320503] [2023-08-26 20:05:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:30,418 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 20:05:30,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:30,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017320503] [2023-08-26 20:05:30,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017320503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:30,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 20:05:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091700831] [2023-08-26 20:05:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:30,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 20:05:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 20:05:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 20:05:30,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 257 [2023-08-26 20:05:30,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:30,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 257 [2023-08-26 20:05:30,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:30,562 INFO L124 PetriNetUnfolderBase]: 1537/1954 cut-off events. [2023-08-26 20:05:30,563 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-26 20:05:30,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 1954 events. 1537/1954 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6419 event pairs, 141 based on Foata normal form. 1/1124 useless extension candidates. Maximal degree in co-relation 3952. Up to 1733 conditions per place. [2023-08-26 20:05:30,572 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-08-26 20:05:30,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2023-08-26 20:05:30,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 20:05:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 20:05:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-26 20:05:30,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5291828793774319 [2023-08-26 20:05:30,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-26 20:05:30,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-26 20:05:30,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:30,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-26 20:05:30,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,577 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 75 flow. Second operand 3 states and 408 transitions. [2023-08-26 20:05:30,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2023-08-26 20:05:30,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:30,578 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 107 flow [2023-08-26 20:05:30,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-26 20:05:30,579 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -12 predicate places. [2023-08-26 20:05:30,579 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 107 flow [2023-08-26 20:05:30,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:30,580 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] [2023-08-26 20:05:30,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 20:05:30,580 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:30,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash -954029490, now seen corresponding path program 1 times [2023-08-26 20:05:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:30,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767712888] [2023-08-26 20:05:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767712888] [2023-08-26 20:05:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767712888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649877307] [2023-08-26 20:05:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:30,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:30,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:30,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:30,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:30,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:30,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:30,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:30,943 INFO L124 PetriNetUnfolderBase]: 2463/3233 cut-off events. [2023-08-26 20:05:30,943 INFO L125 PetriNetUnfolderBase]: For 898/903 co-relation queries the response was YES. [2023-08-26 20:05:30,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7922 conditions, 3233 events. 2463/3233 cut-off events. For 898/903 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 13327 event pairs, 566 based on Foata normal form. 59/3221 useless extension candidates. Maximal degree in co-relation 7917. Up to 1487 conditions per place. [2023-08-26 20:05:30,987 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 83 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2023-08-26 20:05:30,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 458 flow [2023-08-26 20:05:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-08-26 20:05:30,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46926070038910506 [2023-08-26 20:05:30,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-08-26 20:05:30,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-08-26 20:05:30,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:30,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-08-26 20:05:30,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:30,994 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 107 flow. Second operand 5 states and 603 transitions. [2023-08-26 20:05:30,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 458 flow [2023-08-26 20:05:30,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 91 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:30,999 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 145 flow [2023-08-26 20:05:30,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-26 20:05:31,000 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-26 20:05:31,000 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 145 flow [2023-08-26 20:05:31,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:31,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:31,000 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] [2023-08-26 20:05:31,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 20:05:31,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:31,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1117922634, now seen corresponding path program 1 times [2023-08-26 20:05:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:31,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030989400] [2023-08-26 20:05:31,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:31,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:31,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:31,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030989400] [2023-08-26 20:05:31,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030989400] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:05:31,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807709551] [2023-08-26 20:05:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:31,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:05:31,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:05:31,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:05:31,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 20:05:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:31,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:05:31,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:05:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:31,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:05:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807709551] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:05:31,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:05:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-26 20:05:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087508937] [2023-08-26 20:05:31,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:05:31,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:05:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:05:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:05:31,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:31,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 145 flow. Second operand has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:31,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:31,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:31,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:31,709 INFO L124 PetriNetUnfolderBase]: 2715/3533 cut-off events. [2023-08-26 20:05:31,709 INFO L125 PetriNetUnfolderBase]: For 2619/2762 co-relation queries the response was YES. [2023-08-26 20:05:31,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10204 conditions, 3533 events. 2715/3533 cut-off events. For 2619/2762 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14650 event pairs, 625 based on Foata normal form. 206/3641 useless extension candidates. Maximal degree in co-relation 10196. Up to 1454 conditions per place. [2023-08-26 20:05:31,728 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 99 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2023-08-26 20:05:31,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 112 transitions, 596 flow [2023-08-26 20:05:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 20:05:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 20:05:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2023-08-26 20:05:31,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46581434130072263 [2023-08-26 20:05:31,732 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2023-08-26 20:05:31,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2023-08-26 20:05:31,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:31,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2023-08-26 20:05:31,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:31,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:31,738 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:31,738 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 145 flow. Second operand 7 states and 838 transitions. [2023-08-26 20:05:31,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 112 transitions, 596 flow [2023-08-26 20:05:31,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 589 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:31,746 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 200 flow [2023-08-26 20:05:31,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-26 20:05:31,747 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-08-26 20:05:31,747 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 200 flow [2023-08-26 20:05:31,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:31,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:31,748 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] [2023-08-26 20:05:31,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 20:05:31,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-26 20:05:31,957 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:31,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1422445816, now seen corresponding path program 2 times [2023-08-26 20:05:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973035591] [2023-08-26 20:05:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973035591] [2023-08-26 20:05:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973035591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415583514] [2023-08-26 20:05:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:32,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:32,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:32,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:32,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:32,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:32,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:32,483 INFO L124 PetriNetUnfolderBase]: 3893/5124 cut-off events. [2023-08-26 20:05:32,484 INFO L125 PetriNetUnfolderBase]: For 10323/10531 co-relation queries the response was YES. [2023-08-26 20:05:32,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17375 conditions, 5124 events. 3893/5124 cut-off events. For 10323/10531 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 22547 event pairs, 959 based on Foata normal form. 242/5220 useless extension candidates. Maximal degree in co-relation 17363. Up to 2643 conditions per place. [2023-08-26 20:05:32,514 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 94 selfloop transitions, 8 changer transitions 0/106 dead transitions. [2023-08-26 20:05:32,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 701 flow [2023-08-26 20:05:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-08-26 20:05:32,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466147859922179 [2023-08-26 20:05:32,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-08-26 20:05:32,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-08-26 20:05:32,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:32,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-08-26 20:05:32,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:32,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:32,520 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:32,520 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 200 flow. Second operand 5 states and 599 transitions. [2023-08-26 20:05:32,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 701 flow [2023-08-26 20:05:32,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 669 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 20:05:32,542 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 250 flow [2023-08-26 20:05:32,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-08-26 20:05:32,543 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2023-08-26 20:05:32,543 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 250 flow [2023-08-26 20:05:32,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:32,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:32,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, 1, 1, 1, 1, 1] [2023-08-26 20:05:32,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 20:05:32,544 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:32,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1576936788, now seen corresponding path program 2 times [2023-08-26 20:05:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883921355] [2023-08-26 20:05:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:32,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883921355] [2023-08-26 20:05:32,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883921355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:32,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978234602] [2023-08-26 20:05:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:32,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:32,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:32,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:32,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:32,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:32,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:33,143 INFO L124 PetriNetUnfolderBase]: 4223/5551 cut-off events. [2023-08-26 20:05:33,144 INFO L125 PetriNetUnfolderBase]: For 14875/15090 co-relation queries the response was YES. [2023-08-26 20:05:33,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20722 conditions, 5551 events. 4223/5551 cut-off events. For 14875/15090 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 23945 event pairs, 1073 based on Foata normal form. 237/5550 useless extension candidates. Maximal degree in co-relation 20707. Up to 4330 conditions per place. [2023-08-26 20:05:33,179 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 76 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2023-08-26 20:05:33,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 666 flow [2023-08-26 20:05:33,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:05:33,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:05:33,181 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:05:33,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:05:33,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:33,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:05:33,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:33,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:33,186 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:33,186 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 250 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:05:33,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 666 flow [2023-08-26 20:05:33,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 633 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:33,206 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 347 flow [2023-08-26 20:05:33,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2023-08-26 20:05:33,206 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2023-08-26 20:05:33,207 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 347 flow [2023-08-26 20:05:33,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:33,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:33,207 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] [2023-08-26 20:05:33,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 20:05:33,207 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:33,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash -190029956, now seen corresponding path program 3 times [2023-08-26 20:05:33,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:33,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023237213] [2023-08-26 20:05:33,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:33,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:33,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:33,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023237213] [2023-08-26 20:05:33,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023237213] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:05:33,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923163845] [2023-08-26 20:05:33,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 20:05:33,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:05:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:05:33,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:05:33,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 20:05:33,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 20:05:33,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:05:33,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:05:33,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:05:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:33,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:05:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923163845] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:05:33,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:05:33,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-26 20:05:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096514247] [2023-08-26 20:05:33,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:05:33,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:05:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:33,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:05:33,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:05:33,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:33,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 347 flow. Second operand has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:33,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:33,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:33,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:34,153 INFO L124 PetriNetUnfolderBase]: 4709/6179 cut-off events. [2023-08-26 20:05:34,153 INFO L125 PetriNetUnfolderBase]: For 16607/16810 co-relation queries the response was YES. [2023-08-26 20:05:34,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23800 conditions, 6179 events. 4709/6179 cut-off events. For 16607/16810 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 27259 event pairs, 593 based on Foata normal form. 299/6396 useless extension candidates. Maximal degree in co-relation 23783. Up to 2359 conditions per place. [2023-08-26 20:05:34,189 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 136 selfloop transitions, 24 changer transitions 0/163 dead transitions. [2023-08-26 20:05:34,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 163 transitions, 1245 flow [2023-08-26 20:05:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 20:05:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 20:05:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2023-08-26 20:05:34,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46581434130072263 [2023-08-26 20:05:34,192 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2023-08-26 20:05:34,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2023-08-26 20:05:34,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:34,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2023-08-26 20:05:34,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:34,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:34,197 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:34,197 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 347 flow. Second operand 7 states and 838 transitions. [2023-08-26 20:05:34,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 163 transitions, 1245 flow [2023-08-26 20:05:34,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 163 transitions, 1175 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 20:05:34,265 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 499 flow [2023-08-26 20:05:34,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=499, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2023-08-26 20:05:34,266 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2023-08-26 20:05:34,266 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 499 flow [2023-08-26 20:05:34,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:34,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:34,267 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] [2023-08-26 20:05:34,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-26 20:05:34,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 20:05:34,480 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:34,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash -403587429, now seen corresponding path program 1 times [2023-08-26 20:05:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:34,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86227969] [2023-08-26 20:05:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86227969] [2023-08-26 20:05:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86227969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:34,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252372436] [2023-08-26 20:05:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:34,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:34,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:34,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:34,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:34,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:34,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:34,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:35,282 INFO L124 PetriNetUnfolderBase]: 6292/8173 cut-off events. [2023-08-26 20:05:35,283 INFO L125 PetriNetUnfolderBase]: For 46895/49249 co-relation queries the response was YES. [2023-08-26 20:05:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36505 conditions, 8173 events. 6292/8173 cut-off events. For 46895/49249 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 35708 event pairs, 1595 based on Foata normal form. 740/8746 useless extension candidates. Maximal degree in co-relation 36484. Up to 4954 conditions per place. [2023-08-26 20:05:35,334 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 117 selfloop transitions, 36 changer transitions 4/162 dead transitions. [2023-08-26 20:05:35,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 162 transitions, 1529 flow [2023-08-26 20:05:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-26 20:05:35,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070038910505834 [2023-08-26 20:05:35,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-26 20:05:35,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-26 20:05:35,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:35,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-26 20:05:35,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:35,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:35,340 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:35,341 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 499 flow. Second operand 5 states and 592 transitions. [2023-08-26 20:05:35,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 162 transitions, 1529 flow [2023-08-26 20:05:35,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 162 transitions, 1477 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 20:05:35,420 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 751 flow [2023-08-26 20:05:35,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2023-08-26 20:05:35,421 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2023-08-26 20:05:35,421 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 751 flow [2023-08-26 20:05:35,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:35,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:35,422 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] [2023-08-26 20:05:35,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 20:05:35,422 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:35,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:35,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1550521841, now seen corresponding path program 2 times [2023-08-26 20:05:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:35,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399002335] [2023-08-26 20:05:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:35,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:35,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399002335] [2023-08-26 20:05:35,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399002335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:35,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:35,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:35,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874392905] [2023-08-26 20:05:35,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:35,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:35,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:35,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:35,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:35,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 85 transitions, 751 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:35,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:35,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:35,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:36,263 INFO L124 PetriNetUnfolderBase]: 7155/9418 cut-off events. [2023-08-26 20:05:36,263 INFO L125 PetriNetUnfolderBase]: For 58239/58813 co-relation queries the response was YES. [2023-08-26 20:05:36,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47072 conditions, 9418 events. 7155/9418 cut-off events. For 58239/58813 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 45033 event pairs, 1354 based on Foata normal form. 752/9919 useless extension candidates. Maximal degree in co-relation 47049. Up to 4615 conditions per place. [2023-08-26 20:05:36,447 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 164 selfloop transitions, 14 changer transitions 3/186 dead transitions. [2023-08-26 20:05:36,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 186 transitions, 1899 flow [2023-08-26 20:05:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-08-26 20:05:36,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46926070038910506 [2023-08-26 20:05:36,451 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-08-26 20:05:36,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-08-26 20:05:36,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:36,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-08-26 20:05:36,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:36,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:36,456 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:36,456 INFO L175 Difference]: Start difference. First operand has 79 places, 85 transitions, 751 flow. Second operand 5 states and 603 transitions. [2023-08-26 20:05:36,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 186 transitions, 1899 flow [2023-08-26 20:05:36,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 186 transitions, 1811 flow, removed 44 selfloop flow, removed 0 redundant places. [2023-08-26 20:05:36,673 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 841 flow [2023-08-26 20:05:36,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=841, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2023-08-26 20:05:36,674 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2023-08-26 20:05:36,674 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 841 flow [2023-08-26 20:05:36,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:36,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:36,675 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] [2023-08-26 20:05:36,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 20:05:36,675 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:36,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1961318210, now seen corresponding path program 4 times [2023-08-26 20:05:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:36,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796041156] [2023-08-26 20:05:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:36,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796041156] [2023-08-26 20:05:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796041156] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:05:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051813690] [2023-08-26 20:05:36,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 20:05:36,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:05:36,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:05:36,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:05:36,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 20:05:36,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 20:05:36,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:05:36,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:05:36,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:05:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:36,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:05:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051813690] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:05:36,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:05:36,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-26 20:05:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952522474] [2023-08-26 20:05:36,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:05:36,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 20:05:36,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:36,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 20:05:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-26 20:05:36,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:36,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 841 flow. Second operand has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:36,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:36,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:36,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:38,104 INFO L124 PetriNetUnfolderBase]: 8142/10639 cut-off events. [2023-08-26 20:05:38,104 INFO L125 PetriNetUnfolderBase]: For 70944/71577 co-relation queries the response was YES. [2023-08-26 20:05:38,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53519 conditions, 10639 events. 8142/10639 cut-off events. For 70944/71577 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 49092 event pairs, 1633 based on Foata normal form. 770/11145 useless extension candidates. Maximal degree in co-relation 53493. Up to 5944 conditions per place. [2023-08-26 20:05:38,163 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 129 selfloop transitions, 72 changer transitions 3/208 dead transitions. [2023-08-26 20:05:38,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 208 transitions, 2228 flow [2023-08-26 20:05:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:05:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:05:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-08-26 20:05:38,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46173800259403375 [2023-08-26 20:05:38,166 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-08-26 20:05:38,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-08-26 20:05:38,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:38,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-08-26 20:05:38,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:38,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:38,171 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:38,171 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 841 flow. Second operand 6 states and 712 transitions. [2023-08-26 20:05:38,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 208 transitions, 2228 flow [2023-08-26 20:05:38,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 208 transitions, 2118 flow, removed 30 selfloop flow, removed 2 redundant places. [2023-08-26 20:05:38,455 INFO L231 Difference]: Finished difference. Result has 91 places, 125 transitions, 1452 flow [2023-08-26 20:05:38,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1452, PETRI_PLACES=91, PETRI_TRANSITIONS=125} [2023-08-26 20:05:38,456 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 37 predicate places. [2023-08-26 20:05:38,456 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 125 transitions, 1452 flow [2023-08-26 20:05:38,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.5) internal successors, (1085), 10 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:38,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:38,456 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] [2023-08-26 20:05:38,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 20:05:38,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 20:05:38,657 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:38,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:38,657 INFO L85 PathProgramCache]: Analyzing trace with hash 645102934, now seen corresponding path program 3 times [2023-08-26 20:05:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611388449] [2023-08-26 20:05:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611388449] [2023-08-26 20:05:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611388449] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273497808] [2023-08-26 20:05:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:38,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:38,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 125 transitions, 1452 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:38,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:38,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:38,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:39,893 INFO L124 PetriNetUnfolderBase]: 8944/11693 cut-off events. [2023-08-26 20:05:39,893 INFO L125 PetriNetUnfolderBase]: For 90715/92308 co-relation queries the response was YES. [2023-08-26 20:05:39,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65164 conditions, 11693 events. 8944/11693 cut-off events. For 90715/92308 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 55304 event pairs, 2267 based on Foata normal form. 1128/12306 useless extension candidates. Maximal degree in co-relation 65135. Up to 8788 conditions per place. [2023-08-26 20:05:40,028 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 165 selfloop transitions, 31 changer transitions 2/210 dead transitions. [2023-08-26 20:05:40,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 210 transitions, 2634 flow [2023-08-26 20:05:40,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-26 20:05:40,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070038910505834 [2023-08-26 20:05:40,032 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-26 20:05:40,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-26 20:05:40,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:40,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-26 20:05:40,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:40,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:40,036 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:40,036 INFO L175 Difference]: Start difference. First operand has 91 places, 125 transitions, 1452 flow. Second operand 5 states and 592 transitions. [2023-08-26 20:05:40,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 210 transitions, 2634 flow [2023-08-26 20:05:40,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 210 transitions, 2433 flow, removed 54 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:40,432 INFO L231 Difference]: Finished difference. Result has 97 places, 136 transitions, 1535 flow [2023-08-26 20:05:40,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1535, PETRI_PLACES=97, PETRI_TRANSITIONS=136} [2023-08-26 20:05:40,432 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-08-26 20:05:40,432 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 136 transitions, 1535 flow [2023-08-26 20:05:40,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:40,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:40,433 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] [2023-08-26 20:05:40,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 20:05:40,433 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:40,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash -184001736, now seen corresponding path program 5 times [2023-08-26 20:05:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:40,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675791721] [2023-08-26 20:05:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:40,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675791721] [2023-08-26 20:05:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675791721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:40,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:40,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999748679] [2023-08-26 20:05:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:40,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:40,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 136 transitions, 1535 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:40,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:40,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:40,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:41,607 INFO L124 PetriNetUnfolderBase]: 9291/12136 cut-off events. [2023-08-26 20:05:41,607 INFO L125 PetriNetUnfolderBase]: For 100681/102217 co-relation queries the response was YES. [2023-08-26 20:05:41,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68536 conditions, 12136 events. 9291/12136 cut-off events. For 100681/102217 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 57905 event pairs, 1007 based on Foata normal form. 1191/12902 useless extension candidates. Maximal degree in co-relation 68504. Up to 5296 conditions per place. [2023-08-26 20:05:41,686 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 193 selfloop transitions, 28 changer transitions 1/234 dead transitions. [2023-08-26 20:05:41,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 234 transitions, 2830 flow [2023-08-26 20:05:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2023-08-26 20:05:41,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467704280155642 [2023-08-26 20:05:41,689 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2023-08-26 20:05:41,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2023-08-26 20:05:41,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:41,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2023-08-26 20:05:41,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:41,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:41,792 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:41,792 INFO L175 Difference]: Start difference. First operand has 97 places, 136 transitions, 1535 flow. Second operand 5 states and 601 transitions. [2023-08-26 20:05:41,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 234 transitions, 2830 flow [2023-08-26 20:05:42,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 234 transitions, 2770 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-26 20:05:42,071 INFO L231 Difference]: Finished difference. Result has 102 places, 138 transitions, 1575 flow [2023-08-26 20:05:42,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1575, PETRI_PLACES=102, PETRI_TRANSITIONS=138} [2023-08-26 20:05:42,072 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2023-08-26 20:05:42,072 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 138 transitions, 1575 flow [2023-08-26 20:05:42,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:42,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:42,073 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] [2023-08-26 20:05:42,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 20:05:42,073 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:42,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1354076020, now seen corresponding path program 4 times [2023-08-26 20:05:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:42,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332465032] [2023-08-26 20:05:42,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:42,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:42,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:42,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332465032] [2023-08-26 20:05:42,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332465032] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:05:42,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816777774] [2023-08-26 20:05:42,132 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 20:05:42,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:05:42,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:05:42,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:05:42,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 20:05:42,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 20:05:42,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:05:42,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:05:42,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:05:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:42,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:05:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816777774] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:05:42,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:05:42,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-26 20:05:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694122863] [2023-08-26 20:05:42,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:05:42,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 20:05:42,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:42,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 20:05:42,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-26 20:05:42,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:42,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 138 transitions, 1575 flow. Second operand has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:42,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:42,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:42,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:43,788 INFO L124 PetriNetUnfolderBase]: 11775/15277 cut-off events. [2023-08-26 20:05:43,788 INFO L125 PetriNetUnfolderBase]: For 139817/141231 co-relation queries the response was YES. [2023-08-26 20:05:43,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88353 conditions, 15277 events. 11775/15277 cut-off events. For 139817/141231 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 73429 event pairs, 1375 based on Foata normal form. 1475/16440 useless extension candidates. Maximal degree in co-relation 88318. Up to 7741 conditions per place. [2023-08-26 20:05:43,998 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 277 selfloop transitions, 122 changer transitions 5/412 dead transitions. [2023-08-26 20:05:43,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 412 transitions, 5194 flow [2023-08-26 20:05:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 20:05:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 20:05:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1174 transitions. [2023-08-26 20:05:44,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45680933852140077 [2023-08-26 20:05:44,002 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1174 transitions. [2023-08-26 20:05:44,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1174 transitions. [2023-08-26 20:05:44,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:44,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1174 transitions. [2023-08-26 20:05:44,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.4) internal successors, (1174), 10 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:44,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:44,010 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:44,010 INFO L175 Difference]: Start difference. First operand has 102 places, 138 transitions, 1575 flow. Second operand 10 states and 1174 transitions. [2023-08-26 20:05:44,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 412 transitions, 5194 flow [2023-08-26 20:05:44,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 412 transitions, 5090 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 20:05:44,448 INFO L231 Difference]: Finished difference. Result has 115 places, 226 transitions, 3178 flow [2023-08-26 20:05:44,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3178, PETRI_PLACES=115, PETRI_TRANSITIONS=226} [2023-08-26 20:05:44,449 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 61 predicate places. [2023-08-26 20:05:44,449 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 226 transitions, 3178 flow [2023-08-26 20:05:44,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:44,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:44,450 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] [2023-08-26 20:05:44,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 20:05:44,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:05:44,655 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:44,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1953638462, now seen corresponding path program 5 times [2023-08-26 20:05:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:44,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915956755] [2023-08-26 20:05:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915956755] [2023-08-26 20:05:44,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915956755] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:44,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:44,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128904164] [2023-08-26 20:05:44,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:44,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:44,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:44,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:44,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:44,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 226 transitions, 3178 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:44,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:44,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:44,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:45,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork1_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2][45], [Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 104#L92-1true, 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), 16#L72-4true, Black: 390#(<= 1 ~N~0), Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), 40#L51-4true, Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 123#L41-4true, Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), 42#L62-4true, 573#(= thread3Thread1of1ForFork1_~i~2 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), Black: 196#(<= ~N~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 928#(= thread3Thread1of1ForFork1_~i~2 0), 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 205#(<= 1 ~N~0), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 373#(<= ~N~0 0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:05:45,422 INFO L294 olderBase$Statistics]: this new event has 15 ancestors and is cut-off event [2023-08-26 20:05:45,422 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-26 20:05:45,422 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-26 20:05:45,422 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2023-08-26 20:05:45,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork1_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2][69], [Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 104#L92-1true, 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), Black: 390#(<= 1 ~N~0), 16#L72-4true, Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 755#true, 40#L51-4true, Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 76#thread1EXITtrue, Black: 566#(<= ~N~0 0), 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 190#(= ~counter2~0 ~counter1~0), 42#L62-4true, 573#(= thread3Thread1of1ForFork1_~i~2 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), Black: 196#(<= ~N~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 928#(= thread3Thread1of1ForFork1_~i~2 0), 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 205#(<= 1 ~N~0), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 373#(<= ~N~0 0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:05:45,612 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-26 20:05:45,613 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:05:45,613 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-26 20:05:45,613 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2023-08-26 20:05:45,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork1_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2][69], [Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), 16#L72-4true, Black: 390#(<= 1 ~N~0), Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 755#true, 40#L51-4true, Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 566#(<= ~N~0 0), 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 190#(= ~counter2~0 ~counter1~0), 42#L62-4true, Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 573#(= thread3Thread1of1ForFork1_~i~2 0), Black: 196#(<= ~N~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 928#(= thread3Thread1of1ForFork1_~i~2 0), 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 59#L92-2true, Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 205#(<= 1 ~N~0), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 373#(<= ~N~0 0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:05:45,951 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-26 20:05:45,951 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:05:45,951 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:05:45,951 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:05:46,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] $Ultimate##0-->L62-4: Formula: (= v_thread3Thread1of1ForFork1_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2][69], [Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), 16#L72-4true, Black: 390#(<= 1 ~N~0), Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 755#true, 40#L51-4true, Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 566#(<= ~N~0 0), 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 190#(= ~counter2~0 ~counter1~0), 111#L93-1true, 42#L62-4true, Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 573#(= thread3Thread1of1ForFork1_~i~2 0), Black: 196#(<= ~N~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 928#(= thread3Thread1of1ForFork1_~i~2 0), 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 205#(<= 1 ~N~0), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 373#(<= ~N~0 0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:05:46,135 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-26 20:05:46,135 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:05:46,136 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:05:46,136 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:05:46,561 INFO L124 PetriNetUnfolderBase]: 12667/16665 cut-off events. [2023-08-26 20:05:46,561 INFO L125 PetriNetUnfolderBase]: For 183008/184531 co-relation queries the response was YES. [2023-08-26 20:05:46,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104804 conditions, 16665 events. 12667/16665 cut-off events. For 183008/184531 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 83363 event pairs, 2320 based on Foata normal form. 1243/17570 useless extension candidates. Maximal degree in co-relation 104763. Up to 7228 conditions per place. [2023-08-26 20:05:46,656 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 179 selfloop transitions, 141 changer transitions 3/331 dead transitions. [2023-08-26 20:05:46,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 331 transitions, 4907 flow [2023-08-26 20:05:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-08-26 20:05:46,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46303501945525294 [2023-08-26 20:05:46,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-08-26 20:05:46,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-08-26 20:05:46,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:46,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-08-26 20:05:46,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:46,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:46,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:46,662 INFO L175 Difference]: Start difference. First operand has 115 places, 226 transitions, 3178 flow. Second operand 5 states and 595 transitions. [2023-08-26 20:05:46,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 331 transitions, 4907 flow [2023-08-26 20:05:47,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 331 transitions, 4520 flow, removed 115 selfloop flow, removed 3 redundant places. [2023-08-26 20:05:47,636 INFO L231 Difference]: Finished difference. Result has 118 places, 234 transitions, 3290 flow [2023-08-26 20:05:47,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=2834, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3290, PETRI_PLACES=118, PETRI_TRANSITIONS=234} [2023-08-26 20:05:47,637 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 64 predicate places. [2023-08-26 20:05:47,637 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 234 transitions, 3290 flow [2023-08-26 20:05:47,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:47,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:47,638 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] [2023-08-26 20:05:47,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 20:05:47,638 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:47,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash -665742615, now seen corresponding path program 3 times [2023-08-26 20:05:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353499746] [2023-08-26 20:05:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:47,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:47,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353499746] [2023-08-26 20:05:47,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353499746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:47,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:47,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754510790] [2023-08-26 20:05:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:47,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:47,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:47,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:47,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:47,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 234 transitions, 3290 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:47,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:47,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:47,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:49,828 INFO L124 PetriNetUnfolderBase]: 12921/17091 cut-off events. [2023-08-26 20:05:49,828 INFO L125 PetriNetUnfolderBase]: For 207593/209071 co-relation queries the response was YES. [2023-08-26 20:05:49,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105839 conditions, 17091 events. 12921/17091 cut-off events. For 207593/209071 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 86131 event pairs, 1919 based on Foata normal form. 1167/17931 useless extension candidates. Maximal degree in co-relation 105796. Up to 7472 conditions per place. [2023-08-26 20:05:49,926 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 178 selfloop transitions, 138 changer transitions 1/326 dead transitions. [2023-08-26 20:05:49,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 326 transitions, 4825 flow [2023-08-26 20:05:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-08-26 20:05:49,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466147859922179 [2023-08-26 20:05:49,929 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-08-26 20:05:49,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-08-26 20:05:49,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:49,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-08-26 20:05:49,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:49,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:49,932 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:49,933 INFO L175 Difference]: Start difference. First operand has 118 places, 234 transitions, 3290 flow. Second operand 5 states and 599 transitions. [2023-08-26 20:05:49,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 326 transitions, 4825 flow [2023-08-26 20:05:50,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 326 transitions, 4568 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 20:05:50,964 INFO L231 Difference]: Finished difference. Result has 122 places, 239 transitions, 3513 flow [2023-08-26 20:05:50,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=3037, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3513, PETRI_PLACES=122, PETRI_TRANSITIONS=239} [2023-08-26 20:05:50,965 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 68 predicate places. [2023-08-26 20:05:50,965 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 239 transitions, 3513 flow [2023-08-26 20:05:50,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:50,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:50,965 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] [2023-08-26 20:05:50,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 20:05:50,965 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:50,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:50,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1776227434, now seen corresponding path program 1 times [2023-08-26 20:05:50,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:50,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036489595] [2023-08-26 20:05:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:51,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036489595] [2023-08-26 20:05:51,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036489595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:51,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:51,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939668492] [2023-08-26 20:05:51,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:51,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:51,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:51,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:51,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:51,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 239 transitions, 3513 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:51,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:51,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:51,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:53,230 INFO L124 PetriNetUnfolderBase]: 14316/18973 cut-off events. [2023-08-26 20:05:53,230 INFO L125 PetriNetUnfolderBase]: For 258770/260810 co-relation queries the response was YES. [2023-08-26 20:05:53,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119747 conditions, 18973 events. 14316/18973 cut-off events. For 258770/260810 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 95322 event pairs, 2882 based on Foata normal form. 1343/20112 useless extension candidates. Maximal degree in co-relation 119702. Up to 10778 conditions per place. [2023-08-26 20:05:53,345 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 344 selfloop transitions, 35 changer transitions 7/406 dead transitions. [2023-08-26 20:05:53,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 406 transitions, 6432 flow [2023-08-26 20:05:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2023-08-26 20:05:53,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467704280155642 [2023-08-26 20:05:53,347 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2023-08-26 20:05:53,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2023-08-26 20:05:53,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:53,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2023-08-26 20:05:53,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:53,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:53,350 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:53,350 INFO L175 Difference]: Start difference. First operand has 122 places, 239 transitions, 3513 flow. Second operand 5 states and 601 transitions. [2023-08-26 20:05:53,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 406 transitions, 6432 flow [2023-08-26 20:05:54,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 406 transitions, 6152 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 20:05:54,833 INFO L231 Difference]: Finished difference. Result has 126 places, 243 transitions, 3457 flow [2023-08-26 20:05:54,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=3336, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3457, PETRI_PLACES=126, PETRI_TRANSITIONS=243} [2023-08-26 20:05:54,834 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 72 predicate places. [2023-08-26 20:05:54,834 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 243 transitions, 3457 flow [2023-08-26 20:05:54,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:54,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:54,835 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] [2023-08-26 20:05:54,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 20:05:54,835 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:54,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1423703512, now seen corresponding path program 2 times [2023-08-26 20:05:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284389973] [2023-08-26 20:05:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284389973] [2023-08-26 20:05:54,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284389973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:54,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:54,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401520784] [2023-08-26 20:05:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:54,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:54,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:54,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:54,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 243 transitions, 3457 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:54,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:54,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:54,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:05:57,461 INFO L124 PetriNetUnfolderBase]: 16829/22112 cut-off events. [2023-08-26 20:05:57,462 INFO L125 PetriNetUnfolderBase]: For 316186/320223 co-relation queries the response was YES. [2023-08-26 20:05:57,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146882 conditions, 22112 events. 16829/22112 cut-off events. For 316186/320223 co-relation queries the response was YES. Maximal size of possible extension queue 1007. Compared 111891 event pairs, 3003 based on Foata normal form. 2143/24089 useless extension candidates. Maximal degree in co-relation 146835. Up to 10675 conditions per place. [2023-08-26 20:05:57,595 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 229 selfloop transitions, 187 changer transitions 1/432 dead transitions. [2023-08-26 20:05:57,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 432 transitions, 6842 flow [2023-08-26 20:05:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:05:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:05:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:05:57,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:05:57,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:05:57,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:05:57,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:05:57,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:05:57,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:57,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:57,601 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:57,601 INFO L175 Difference]: Start difference. First operand has 126 places, 243 transitions, 3457 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:05:57,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 432 transitions, 6842 flow [2023-08-26 20:05:58,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 432 transitions, 6728 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:05:58,965 INFO L231 Difference]: Finished difference. Result has 128 places, 291 transitions, 4541 flow [2023-08-26 20:05:58,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=3403, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4541, PETRI_PLACES=128, PETRI_TRANSITIONS=291} [2023-08-26 20:05:58,965 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 74 predicate places. [2023-08-26 20:05:58,966 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 291 transitions, 4541 flow [2023-08-26 20:05:58,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:58,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:05:58,966 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] [2023-08-26 20:05:58,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 20:05:58,966 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:05:58,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:05:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash -30266634, now seen corresponding path program 3 times [2023-08-26 20:05:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:05:58,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707455143] [2023-08-26 20:05:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:05:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:05:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:05:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:05:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:05:59,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707455143] [2023-08-26 20:05:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707455143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:05:59,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:05:59,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:05:59,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332965045] [2023-08-26 20:05:59,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:05:59,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:05:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:05:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:05:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:05:59,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:05:59,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 291 transitions, 4541 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:05:59,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:05:59,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:05:59,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:06:01,772 INFO L124 PetriNetUnfolderBase]: 16968/22430 cut-off events. [2023-08-26 20:06:01,772 INFO L125 PetriNetUnfolderBase]: For 319682/323025 co-relation queries the response was YES. [2023-08-26 20:06:01,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152582 conditions, 22430 events. 16968/22430 cut-off events. For 319682/323025 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 114686 event pairs, 3392 based on Foata normal form. 1768/24027 useless extension candidates. Maximal degree in co-relation 152535. Up to 11218 conditions per place. [2023-08-26 20:06:01,961 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 204 selfloop transitions, 185 changer transitions 6/410 dead transitions. [2023-08-26 20:06:01,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 410 transitions, 6667 flow [2023-08-26 20:06:01,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:06:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:06:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-08-26 20:06:01,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466147859922179 [2023-08-26 20:06:01,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-08-26 20:06:01,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-08-26 20:06:01,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:06:01,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-08-26 20:06:01,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:01,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:01,966 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:01,966 INFO L175 Difference]: Start difference. First operand has 128 places, 291 transitions, 4541 flow. Second operand 5 states and 599 transitions. [2023-08-26 20:06:01,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 410 transitions, 6667 flow [2023-08-26 20:06:03,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 410 transitions, 6423 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:06:03,802 INFO L231 Difference]: Finished difference. Result has 132 places, 295 transitions, 4732 flow [2023-08-26 20:06:03,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=4297, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4732, PETRI_PLACES=132, PETRI_TRANSITIONS=295} [2023-08-26 20:06:03,803 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 78 predicate places. [2023-08-26 20:06:03,803 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 295 transitions, 4732 flow [2023-08-26 20:06:03,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:03,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:06:03,803 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] [2023-08-26 20:06:03,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 20:06:03,803 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:06:03,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:06:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 914102409, now seen corresponding path program 4 times [2023-08-26 20:06:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:06:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983174163] [2023-08-26 20:06:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:06:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:06:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:06:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:06:03,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983174163] [2023-08-26 20:06:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983174163] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:06:03,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75111026] [2023-08-26 20:06:03,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 20:06:03,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:06:03,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:06:03,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:06:03,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 20:06:03,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 20:06:03,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:06:03,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:06:03,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:06:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:03,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:06:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75111026] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:06:04,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:06:04,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-26 20:06:04,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713016993] [2023-08-26 20:06:04,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:06:04,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 20:06:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:06:04,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 20:06:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-26 20:06:04,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:06:04,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 295 transitions, 4732 flow. Second operand has 10 states, 10 states have (on average 108.8) internal successors, (1088), 10 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:04,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:06:04,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:06:04,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:06:06,755 INFO L124 PetriNetUnfolderBase]: 16656/21984 cut-off events. [2023-08-26 20:06:06,755 INFO L125 PetriNetUnfolderBase]: For 371383/373287 co-relation queries the response was YES. [2023-08-26 20:06:06,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152785 conditions, 21984 events. 16656/21984 cut-off events. For 371383/373287 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 114608 event pairs, 4188 based on Foata normal form. 1697/23218 useless extension candidates. Maximal degree in co-relation 152736. Up to 17094 conditions per place. [2023-08-26 20:06:06,920 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 323 selfloop transitions, 89 changer transitions 0/425 dead transitions. [2023-08-26 20:06:06,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 425 transitions, 7195 flow [2023-08-26 20:06:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:06:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:06:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2023-08-26 20:06:06,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4604409857328145 [2023-08-26 20:06:06,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 710 transitions. [2023-08-26 20:06:06,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 710 transitions. [2023-08-26 20:06:06,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:06:06,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 710 transitions. [2023-08-26 20:06:06,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:06,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:06,926 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:06,926 INFO L175 Difference]: Start difference. First operand has 132 places, 295 transitions, 4732 flow. Second operand 6 states and 710 transitions. [2023-08-26 20:06:06,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 425 transitions, 7195 flow [2023-08-26 20:06:08,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 425 transitions, 6767 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-26 20:06:08,940 INFO L231 Difference]: Finished difference. Result has 138 places, 353 transitions, 5791 flow [2023-08-26 20:06:08,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=4379, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5791, PETRI_PLACES=138, PETRI_TRANSITIONS=353} [2023-08-26 20:06:08,941 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 84 predicate places. [2023-08-26 20:06:08,941 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 353 transitions, 5791 flow [2023-08-26 20:06:08,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.8) internal successors, (1088), 10 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:08,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:06:08,941 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] [2023-08-26 20:06:08,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 20:06:09,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-26 20:06:09,142 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:06:09,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:06:09,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1550069656, now seen corresponding path program 4 times [2023-08-26 20:06:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:06:09,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257136792] [2023-08-26 20:06:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:06:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:06:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:06:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:09,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:06:09,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257136792] [2023-08-26 20:06:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257136792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:06:09,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:06:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:06:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889568339] [2023-08-26 20:06:09,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:06:09,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:06:09,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:06:09,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:06:09,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:06:09,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:06:09,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 353 transitions, 5791 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:09,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:06:09,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:06:09,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:06:12,620 INFO L124 PetriNetUnfolderBase]: 20744/27128 cut-off events. [2023-08-26 20:06:12,621 INFO L125 PetriNetUnfolderBase]: For 451113/455489 co-relation queries the response was YES. [2023-08-26 20:06:12,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192117 conditions, 27128 events. 20744/27128 cut-off events. For 451113/455489 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 139650 event pairs, 4482 based on Foata normal form. 2145/29018 useless extension candidates. Maximal degree in co-relation 192065. Up to 20710 conditions per place. [2023-08-26 20:06:12,840 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 490 selfloop transitions, 108 changer transitions 7/620 dead transitions. [2023-08-26 20:06:12,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 620 transitions, 11101 flow [2023-08-26 20:06:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:06:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:06:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:06:12,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:06:12,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:06:12,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:06:12,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:06:12,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:06:12,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:12,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:12,845 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:12,846 INFO L175 Difference]: Start difference. First operand has 138 places, 353 transitions, 5791 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:06:12,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 620 transitions, 11101 flow [2023-08-26 20:06:15,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 620 transitions, 10667 flow, removed 164 selfloop flow, removed 1 redundant places. [2023-08-26 20:06:15,170 INFO L231 Difference]: Finished difference. Result has 143 places, 447 transitions, 7742 flow [2023-08-26 20:06:15,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=5548, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7742, PETRI_PLACES=143, PETRI_TRANSITIONS=447} [2023-08-26 20:06:15,170 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 89 predicate places. [2023-08-26 20:06:15,171 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 447 transitions, 7742 flow [2023-08-26 20:06:15,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:15,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:06:15,171 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] [2023-08-26 20:06:15,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 20:06:15,171 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:06:15,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:06:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash 73529112, now seen corresponding path program 5 times [2023-08-26 20:06:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:06:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295865334] [2023-08-26 20:06:15,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:06:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:06:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:06:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:06:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295865334] [2023-08-26 20:06:15,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295865334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:06:15,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:06:15,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:06:15,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052966534] [2023-08-26 20:06:15,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:06:15,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:06:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:06:15,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:06:15,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:06:15,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:06:15,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 447 transitions, 7742 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:15,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:06:15,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:06:15,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:06:20,028 INFO L124 PetriNetUnfolderBase]: 25205/33163 cut-off events. [2023-08-26 20:06:20,029 INFO L125 PetriNetUnfolderBase]: For 596773/602780 co-relation queries the response was YES. [2023-08-26 20:06:20,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243434 conditions, 33163 events. 25205/33163 cut-off events. For 596773/602780 co-relation queries the response was YES. Maximal size of possible extension queue 1568. Compared 178568 event pairs, 2957 based on Foata normal form. 3063/36004 useless extension candidates. Maximal degree in co-relation 243380. Up to 14580 conditions per place. [2023-08-26 20:06:20,301 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 674 selfloop transitions, 94 changer transitions 7/790 dead transitions. [2023-08-26 20:06:20,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 790 transitions, 14702 flow [2023-08-26 20:06:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:06:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:06:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-08-26 20:06:20,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46459143968871597 [2023-08-26 20:06:20,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-08-26 20:06:20,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-08-26 20:06:20,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:06:20,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-08-26 20:06:20,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:20,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:20,305 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:20,305 INFO L175 Difference]: Start difference. First operand has 143 places, 447 transitions, 7742 flow. Second operand 5 states and 597 transitions. [2023-08-26 20:06:20,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 790 transitions, 14702 flow [2023-08-26 20:06:24,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 790 transitions, 14646 flow, removed 28 selfloop flow, removed 0 redundant places. [2023-08-26 20:06:24,438 INFO L231 Difference]: Finished difference. Result has 149 places, 519 transitions, 9608 flow [2023-08-26 20:06:24,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=7698, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9608, PETRI_PLACES=149, PETRI_TRANSITIONS=519} [2023-08-26 20:06:24,438 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 95 predicate places. [2023-08-26 20:06:24,438 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 519 transitions, 9608 flow [2023-08-26 20:06:24,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:24,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:06:24,439 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] [2023-08-26 20:06:24,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-26 20:06:24,439 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:06:24,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:06:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -659779307, now seen corresponding path program 5 times [2023-08-26 20:06:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:06:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659167295] [2023-08-26 20:06:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:06:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:06:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:06:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:06:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659167295] [2023-08-26 20:06:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659167295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:06:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:06:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:06:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960145575] [2023-08-26 20:06:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:06:24,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:06:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:06:24,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:06:24,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:06:24,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:06:24,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 519 transitions, 9608 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:24,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:06:24,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:06:24,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:06:29,699 INFO L124 PetriNetUnfolderBase]: 25660/33979 cut-off events. [2023-08-26 20:06:29,700 INFO L125 PetriNetUnfolderBase]: For 666677/671674 co-relation queries the response was YES. [2023-08-26 20:06:29,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245054 conditions, 33979 events. 25660/33979 cut-off events. For 666677/671674 co-relation queries the response was YES. Maximal size of possible extension queue 1648. Compared 187426 event pairs, 5018 based on Foata normal form. 3171/36928 useless extension candidates. Maximal degree in co-relation 244997. Up to 20711 conditions per place. [2023-08-26 20:06:29,976 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 745 selfloop transitions, 35 changer transitions 43/838 dead transitions. [2023-08-26 20:06:29,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 838 transitions, 16351 flow [2023-08-26 20:06:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:06:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:06:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-08-26 20:06:29,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46303501945525294 [2023-08-26 20:06:29,978 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-08-26 20:06:29,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-08-26 20:06:29,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:06:29,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-08-26 20:06:29,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:29,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:29,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:29,980 INFO L175 Difference]: Start difference. First operand has 149 places, 519 transitions, 9608 flow. Second operand 5 states and 595 transitions. [2023-08-26 20:06:29,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 838 transitions, 16351 flow [2023-08-26 20:06:34,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 838 transitions, 16149 flow, removed 82 selfloop flow, removed 2 redundant places. [2023-08-26 20:06:34,544 INFO L231 Difference]: Finished difference. Result has 153 places, 532 transitions, 10016 flow [2023-08-26 20:06:34,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=9418, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10016, PETRI_PLACES=153, PETRI_TRANSITIONS=532} [2023-08-26 20:06:34,545 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 99 predicate places. [2023-08-26 20:06:34,545 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 532 transitions, 10016 flow [2023-08-26 20:06:34,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:34,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:06:34,545 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] [2023-08-26 20:06:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-26 20:06:34,545 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:06:34,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:06:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1644744352, now seen corresponding path program 6 times [2023-08-26 20:06:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:06:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541998970] [2023-08-26 20:06:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:06:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:06:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:06:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:34,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:06:34,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541998970] [2023-08-26 20:06:34,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541998970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:06:34,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:06:34,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:06:34,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694262905] [2023-08-26 20:06:34,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:06:34,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:06:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:06:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:06:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:06:34,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:06:34,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 532 transitions, 10016 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:34,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:06:34,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:06:34,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:06:39,874 INFO L124 PetriNetUnfolderBase]: 25328/33470 cut-off events. [2023-08-26 20:06:39,874 INFO L125 PetriNetUnfolderBase]: For 666607/672076 co-relation queries the response was YES. [2023-08-26 20:06:40,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244833 conditions, 33470 events. 25328/33470 cut-off events. For 666607/672076 co-relation queries the response was YES. Maximal size of possible extension queue 1598. Compared 181118 event pairs, 5589 based on Foata normal form. 2911/36197 useless extension candidates. Maximal degree in co-relation 244774. Up to 16165 conditions per place. [2023-08-26 20:06:40,162 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 225 selfloop transitions, 399 changer transitions 9/648 dead transitions. [2023-08-26 20:06:40,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 648 transitions, 12702 flow [2023-08-26 20:06:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:06:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:06:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:06:40,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:06:40,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:06:40,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:06:40,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:06:40,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:06:40,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:40,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:40,170 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:40,170 INFO L175 Difference]: Start difference. First operand has 153 places, 532 transitions, 10016 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:06:40,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 648 transitions, 12702 flow [2023-08-26 20:06:45,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 648 transitions, 12526 flow, removed 70 selfloop flow, removed 2 redundant places. [2023-08-26 20:06:45,228 INFO L231 Difference]: Finished difference. Result has 156 places, 532 transitions, 10647 flow [2023-08-26 20:06:45,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=9842, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=397, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10647, PETRI_PLACES=156, PETRI_TRANSITIONS=532} [2023-08-26 20:06:45,229 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 102 predicate places. [2023-08-26 20:06:45,229 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 532 transitions, 10647 flow [2023-08-26 20:06:45,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:45,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:06:45,229 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] [2023-08-26 20:06:45,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-26 20:06:45,229 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:06:45,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:06:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1998565941, now seen corresponding path program 6 times [2023-08-26 20:06:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:06:45,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173354951] [2023-08-26 20:06:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:06:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:06:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:06:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:45,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:06:45,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173354951] [2023-08-26 20:06:45,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173354951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:06:45,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:06:45,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:06:45,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811430049] [2023-08-26 20:06:45,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:06:45,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:06:45,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:06:45,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:06:45,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:06:45,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:06:45,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 532 transitions, 10647 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:45,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:06:45,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:06:45,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:06:50,590 INFO L124 PetriNetUnfolderBase]: 24693/33039 cut-off events. [2023-08-26 20:06:50,590 INFO L125 PetriNetUnfolderBase]: For 722824/726065 co-relation queries the response was YES. [2023-08-26 20:06:50,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244565 conditions, 33039 events. 24693/33039 cut-off events. For 722824/726065 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 185588 event pairs, 5117 based on Foata normal form. 3164/35767 useless extension candidates. Maximal degree in co-relation 244505. Up to 19531 conditions per place. [2023-08-26 20:06:50,899 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 612 selfloop transitions, 59 changer transitions 28/712 dead transitions. [2023-08-26 20:06:50,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 712 transitions, 15096 flow [2023-08-26 20:06:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:06:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:06:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2023-08-26 20:06:50,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467704280155642 [2023-08-26 20:06:50,901 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2023-08-26 20:06:50,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2023-08-26 20:06:50,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:06:50,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2023-08-26 20:06:50,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:50,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:50,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:50,903 INFO L175 Difference]: Start difference. First operand has 156 places, 532 transitions, 10647 flow. Second operand 5 states and 601 transitions. [2023-08-26 20:06:50,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 712 transitions, 15096 flow [2023-08-26 20:06:55,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 712 transitions, 14109 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-26 20:06:55,441 INFO L231 Difference]: Finished difference. Result has 159 places, 544 transitions, 10420 flow [2023-08-26 20:06:55,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=9851, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10420, PETRI_PLACES=159, PETRI_TRANSITIONS=544} [2023-08-26 20:06:55,441 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 105 predicate places. [2023-08-26 20:06:55,441 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 544 transitions, 10420 flow [2023-08-26 20:06:55,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:55,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:06:55,442 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] [2023-08-26 20:06:55,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-26 20:06:55,442 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:06:55,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:06:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash -131146238, now seen corresponding path program 7 times [2023-08-26 20:06:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:06:55,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054389952] [2023-08-26 20:06:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:06:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:06:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:06:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:06:55,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:06:55,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054389952] [2023-08-26 20:06:55,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054389952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:06:55,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:06:55,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:06:55,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102602837] [2023-08-26 20:06:55,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:06:55,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:06:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:06:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:06:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:06:55,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:06:55,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 544 transitions, 10420 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:06:55,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:06:55,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:06:55,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:07:01,386 INFO L124 PetriNetUnfolderBase]: 28020/37098 cut-off events. [2023-08-26 20:07:01,386 INFO L125 PetriNetUnfolderBase]: For 826685/831091 co-relation queries the response was YES. [2023-08-26 20:07:01,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275570 conditions, 37098 events. 28020/37098 cut-off events. For 826685/831091 co-relation queries the response was YES. Maximal size of possible extension queue 1826. Compared 205103 event pairs, 6776 based on Foata normal form. 2881/39551 useless extension candidates. Maximal degree in co-relation 275508. Up to 28893 conditions per place. [2023-08-26 20:07:01,716 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 642 selfloop transitions, 76 changer transitions 18/805 dead transitions. [2023-08-26 20:07:01,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 805 transitions, 16109 flow [2023-08-26 20:07:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:07:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:07:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-08-26 20:07:01,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591439688715953 [2023-08-26 20:07:01,718 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-08-26 20:07:01,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-08-26 20:07:01,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:07:01,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-08-26 20:07:01,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:01,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:01,719 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:01,720 INFO L175 Difference]: Start difference. First operand has 159 places, 544 transitions, 10420 flow. Second operand 5 states and 590 transitions. [2023-08-26 20:07:01,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 805 transitions, 16109 flow [2023-08-26 20:07:06,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 805 transitions, 15797 flow, removed 59 selfloop flow, removed 2 redundant places. [2023-08-26 20:07:06,989 INFO L231 Difference]: Finished difference. Result has 163 places, 596 transitions, 11257 flow [2023-08-26 20:07:06,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=10226, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11257, PETRI_PLACES=163, PETRI_TRANSITIONS=596} [2023-08-26 20:07:06,990 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 109 predicate places. [2023-08-26 20:07:06,990 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 596 transitions, 11257 flow [2023-08-26 20:07:06,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:06,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:07:06,991 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] [2023-08-26 20:07:06,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-26 20:07:06,991 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:07:06,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:07:06,991 INFO L85 PathProgramCache]: Analyzing trace with hash -990778760, now seen corresponding path program 8 times [2023-08-26 20:07:06,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:07:06,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261925000] [2023-08-26 20:07:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:07:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:07:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:07:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:07:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:07:07,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261925000] [2023-08-26 20:07:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261925000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:07:07,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:07:07,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:07:07,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435131661] [2023-08-26 20:07:07,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:07:07,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:07:07,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:07:07,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:07:07,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:07:07,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:07:07,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 596 transitions, 11257 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:07,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:07:07,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:07:07,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:07:12,844 INFO L124 PetriNetUnfolderBase]: 26434/35231 cut-off events. [2023-08-26 20:07:12,844 INFO L125 PetriNetUnfolderBase]: For 761994/764938 co-relation queries the response was YES. [2023-08-26 20:07:13,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268071 conditions, 35231 events. 26434/35231 cut-off events. For 761994/764938 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 196840 event pairs, 5966 based on Foata normal form. 2550/37484 useless extension candidates. Maximal degree in co-relation 268007. Up to 23710 conditions per place. [2023-08-26 20:07:13,173 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 612 selfloop transitions, 187 changer transitions 20/838 dead transitions. [2023-08-26 20:07:13,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 838 transitions, 16768 flow [2023-08-26 20:07:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:07:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:07:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:07:13,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:07:13,174 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:07:13,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:07:13,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:07:13,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:07:13,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:13,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:13,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:13,176 INFO L175 Difference]: Start difference. First operand has 163 places, 596 transitions, 11257 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:07:13,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 838 transitions, 16768 flow [2023-08-26 20:07:18,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 838 transitions, 16724 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 20:07:18,157 INFO L231 Difference]: Finished difference. Result has 167 places, 638 transitions, 12734 flow [2023-08-26 20:07:18,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=11213, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12734, PETRI_PLACES=167, PETRI_TRANSITIONS=638} [2023-08-26 20:07:18,158 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 113 predicate places. [2023-08-26 20:07:18,158 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 638 transitions, 12734 flow [2023-08-26 20:07:18,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:18,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:07:18,159 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] [2023-08-26 20:07:18,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-26 20:07:18,159 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:07:18,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:07:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 78716705, now seen corresponding path program 7 times [2023-08-26 20:07:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:07:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788897737] [2023-08-26 20:07:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:07:18,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:07:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:07:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:07:18,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:07:18,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788897737] [2023-08-26 20:07:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788897737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:07:18,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:07:18,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:07:18,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261241454] [2023-08-26 20:07:18,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:07:18,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:07:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:07:18,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:07:18,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:07:18,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:07:18,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 638 transitions, 12734 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:18,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:07:18,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:07:18,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:07:24,195 INFO L124 PetriNetUnfolderBase]: 26515/35626 cut-off events. [2023-08-26 20:07:24,196 INFO L125 PetriNetUnfolderBase]: For 846863/850085 co-relation queries the response was YES. [2023-08-26 20:07:24,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274176 conditions, 35626 events. 26515/35626 cut-off events. For 846863/850085 co-relation queries the response was YES. Maximal size of possible extension queue 1844. Compared 204602 event pairs, 6068 based on Foata normal form. 3273/38291 useless extension candidates. Maximal degree in co-relation 274111. Up to 26551 conditions per place. [2023-08-26 20:07:24,775 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 583 selfloop transitions, 137 changer transitions 34/772 dead transitions. [2023-08-26 20:07:24,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 772 transitions, 16081 flow [2023-08-26 20:07:24,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:07:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:07:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:07:24,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:07:24,777 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:07:24,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:07:24,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:07:24,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:07:24,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:24,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:24,780 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:24,780 INFO L175 Difference]: Start difference. First operand has 167 places, 638 transitions, 12734 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:07:24,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 772 transitions, 16081 flow [2023-08-26 20:07:30,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 772 transitions, 15356 flow, removed 154 selfloop flow, removed 3 redundant places. [2023-08-26 20:07:30,304 INFO L231 Difference]: Finished difference. Result has 169 places, 645 transitions, 12788 flow [2023-08-26 20:07:30,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=12120, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12788, PETRI_PLACES=169, PETRI_TRANSITIONS=645} [2023-08-26 20:07:30,305 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 115 predicate places. [2023-08-26 20:07:30,305 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 645 transitions, 12788 flow [2023-08-26 20:07:30,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:30,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:07:30,306 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] [2023-08-26 20:07:30,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-26 20:07:30,306 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:07:30,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:07:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -328075203, now seen corresponding path program 8 times [2023-08-26 20:07:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:07:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405237561] [2023-08-26 20:07:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:07:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:07:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:07:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:07:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:07:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405237561] [2023-08-26 20:07:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405237561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:07:30,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:07:30,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:07:30,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491411499] [2023-08-26 20:07:30,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:07:30,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:07:30,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:07:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:07:30,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:07:30,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:07:30,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 645 transitions, 12788 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:30,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:07:30,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:07:30,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:07:36,904 INFO L124 PetriNetUnfolderBase]: 27807/37464 cut-off events. [2023-08-26 20:07:36,905 INFO L125 PetriNetUnfolderBase]: For 815694/818275 co-relation queries the response was YES. [2023-08-26 20:07:37,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283761 conditions, 37464 events. 27807/37464 cut-off events. For 815694/818275 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 215015 event pairs, 5086 based on Foata normal form. 2391/39586 useless extension candidates. Maximal degree in co-relation 283695. Up to 18410 conditions per place. [2023-08-26 20:07:37,295 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 288 selfloop transitions, 464 changer transitions 15/786 dead transitions. [2023-08-26 20:07:37,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 786 transitions, 16265 flow [2023-08-26 20:07:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:07:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:07:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2023-08-26 20:07:37,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467704280155642 [2023-08-26 20:07:37,297 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2023-08-26 20:07:37,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2023-08-26 20:07:37,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:07:37,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2023-08-26 20:07:37,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:37,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:37,299 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:37,299 INFO L175 Difference]: Start difference. First operand has 169 places, 645 transitions, 12788 flow. Second operand 5 states and 601 transitions. [2023-08-26 20:07:37,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 786 transitions, 16265 flow [2023-08-26 20:07:43,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 786 transitions, 15885 flow, removed 36 selfloop flow, removed 3 redundant places. [2023-08-26 20:07:43,897 INFO L231 Difference]: Finished difference. Result has 172 places, 648 transitions, 13803 flow [2023-08-26 20:07:43,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=12454, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13803, PETRI_PLACES=172, PETRI_TRANSITIONS=648} [2023-08-26 20:07:43,898 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 118 predicate places. [2023-08-26 20:07:43,898 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 648 transitions, 13803 flow [2023-08-26 20:07:43,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:43,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:07:43,898 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] [2023-08-26 20:07:43,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-26 20:07:43,898 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:07:43,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:07:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash -585725098, now seen corresponding path program 6 times [2023-08-26 20:07:43,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:07:43,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642495564] [2023-08-26 20:07:43,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:07:43,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:07:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:07:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:07:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:07:43,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642495564] [2023-08-26 20:07:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642495564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:07:43,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:07:43,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:07:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859324222] [2023-08-26 20:07:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:07:43,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:07:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:07:43,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:07:43,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:07:43,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:07:43,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 648 transitions, 13803 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:43,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:07:43,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:07:43,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:07:46,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L62-4-->L62-4: Formula: (and (= (+ v_thread3Thread1of1ForFork1_~i~2_36 1) v_thread3Thread1of1ForFork1_~i~2_35) (< v_thread3Thread1of1ForFork1_~i~2_36 v_~N~0_55) (= (+ v_~counter2~0_59 1) v_~counter2~0_58)) InVars {~counter2~0=v_~counter2~0_59, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_36, ~N~0=v_~N~0_55} OutVars{~counter2~0=v_~counter2~0_58, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_9|, thread3Thread1of1ForFork1_#t~post5=|v_thread3Thread1of1ForFork1_#t~post5_13|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_35, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6, thread3Thread1of1ForFork1_#t~post5, thread3Thread1of1ForFork1_~i~2][321], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 104#L92-1true, Black: 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1164#(<= ~N~0 0), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 929#(<= ~N~0 0), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1194#(<= 1 ~N~0), Black: 390#(<= 1 ~N~0), 16#L72-4true, Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 937#(<= 1 ~N~0), Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), 40#L51-4true, Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 945#(<= ~N~0 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 76#thread1EXITtrue, Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 42#L62-4true, Black: 959#(<= ~N~0 0), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 573#(= thread3Thread1of1ForFork1_~i~2 0), 205#(<= 1 ~N~0), Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), 555#true, Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 373#(<= ~N~0 0), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:07:46,607 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-26 20:07:46,607 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:07:46,607 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:07:46,607 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:07:46,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_37 |v_thread2Thread1of1ForFork2_~i~1#1_28|) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_28|, ~N~0=v_~N~0_37} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~N~0=v_~N~0_37, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#res#1.base][72], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 104#L92-1true, Black: 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 373#(<= ~N~0 0), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), 9#thread2EXITtrue, Black: 929#(<= ~N~0 0), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 390#(<= 1 ~N~0), 16#L72-4true, Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 937#(<= 1 ~N~0), Black: 1194#(<= 1 ~N~0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 945#(<= ~N~0 0), Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 76#thread1EXITtrue, Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 42#L62-4true, Black: 959#(<= ~N~0 0), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 573#(= thread3Thread1of1ForFork1_~i~2 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1157#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 205#(<= 1 ~N~0), 738#true, Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 372#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 1164#(<= ~N~0 0), 1193#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-26 20:07:46,607 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is cut-off event [2023-08-26 20:07:46,608 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:07:46,608 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:07:46,608 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-08-26 20:07:47,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_7| 0) (<= v_~N~0_39 v_thread3Thread1of1ForFork1_~i~2_32) (= |v_thread3Thread1of1ForFork1_#res.base_7| 0)) InVars {thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_32, ~N~0=v_~N~0_39} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_7|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_7|, ~N~0=v_~N~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~i~2, thread3Thread1of1ForFork1_#res.base][199], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 104#L92-1true, 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1164#(<= ~N~0 0), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), 959#(<= ~N~0 0), 92#thread3EXITtrue, Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 16#L72-4true, Black: 390#(<= 1 ~N~0), Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 937#(<= 1 ~N~0), Black: 1194#(<= 1 ~N~0), 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 40#L51-4true, Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 945#(<= ~N~0 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 76#thread1EXITtrue, Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 573#(= thread3Thread1of1ForFork1_~i~2 0), 205#(<= 1 ~N~0), 929#(<= ~N~0 0), Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 555#true, 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 1191#true, Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 373#(<= ~N~0 0), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:07:47,036 INFO L294 olderBase$Statistics]: this new event has 16 ancestors and is not cut-off event [2023-08-26 20:07:47,036 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-26 20:07:47,036 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-26 20:07:47,036 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is not cut-off event [2023-08-26 20:07:47,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_7| 0) (<= v_~N~0_39 v_thread3Thread1of1ForFork1_~i~2_32) (= |v_thread3Thread1of1ForFork1_#res.base_7| 0)) InVars {thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_32, ~N~0=v_~N~0_39} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_7|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_7|, ~N~0=v_~N~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~i~2, thread3Thread1of1ForFork1_#res.base][199], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1164#(<= ~N~0 0), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), 959#(<= ~N~0 0), 92#thread3EXITtrue, Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 390#(<= 1 ~N~0), 16#L72-4true, Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 937#(<= 1 ~N~0), Black: 1194#(<= 1 ~N~0), 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), 40#L51-4true, Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 945#(<= ~N~0 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 573#(= thread3Thread1of1ForFork1_~i~2 0), 205#(<= 1 ~N~0), 59#L92-2true, 929#(<= ~N~0 0), Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 555#true, 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), 1191#true, Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 373#(<= ~N~0 0), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:07:47,806 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,806 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,806 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,806 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L62-4-->L62-4: Formula: (and (= (+ v_thread3Thread1of1ForFork1_~i~2_36 1) v_thread3Thread1of1ForFork1_~i~2_35) (< v_thread3Thread1of1ForFork1_~i~2_36 v_~N~0_55) (= (+ v_~counter2~0_59 1) v_~counter2~0_58)) InVars {~counter2~0=v_~counter2~0_59, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_36, ~N~0=v_~N~0_55} OutVars{~counter2~0=v_~counter2~0_58, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_9|, thread3Thread1of1ForFork1_#t~post5=|v_thread3Thread1of1ForFork1_#t~post5_13|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_35, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6, thread3Thread1of1ForFork1_#t~post5, thread3Thread1of1ForFork1_~i~2][321], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1164#(<= ~N~0 0), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 929#(<= ~N~0 0), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 1194#(<= 1 ~N~0), Black: 390#(<= 1 ~N~0), 16#L72-4true, Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 937#(<= 1 ~N~0), Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), 40#L51-4true, Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 945#(<= ~N~0 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 42#L62-4true, Black: 959#(<= ~N~0 0), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 573#(= thread3Thread1of1ForFork1_~i~2 0), 205#(<= 1 ~N~0), 59#L92-2true, Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), 555#true, Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 373#(<= ~N~0 0), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:07:47,806 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,806 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,807 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,807 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_37 |v_thread2Thread1of1ForFork2_~i~1#1_28|) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_28|, ~N~0=v_~N~0_37} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~N~0=v_~N~0_37, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#res#1.base][72], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 373#(<= ~N~0 0), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), 9#thread2EXITtrue, Black: 929#(<= ~N~0 0), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 390#(<= 1 ~N~0), 16#L72-4true, Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 937#(<= 1 ~N~0), Black: 1194#(<= 1 ~N~0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 945#(<= ~N~0 0), Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 42#L62-4true, Black: 959#(<= ~N~0 0), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 573#(= thread3Thread1of1ForFork1_~i~2 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1157#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 205#(<= 1 ~N~0), 738#true, 59#L92-2true, Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 372#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 1164#(<= ~N~0 0), 1193#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-26 20:07:47,807 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,807 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,807 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:47,807 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-26 20:07:48,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_7| 0) (<= v_~N~0_39 v_thread3Thread1of1ForFork1_~i~2_32) (= |v_thread3Thread1of1ForFork1_#res.base_7| 0)) InVars {thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_32, ~N~0=v_~N~0_39} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_7|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_7|, ~N~0=v_~N~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~i~2, thread3Thread1of1ForFork1_#res.base][199], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1164#(<= ~N~0 0), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), 92#thread3EXITtrue, 959#(<= ~N~0 0), Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 390#(<= 1 ~N~0), 16#L72-4true, Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 937#(<= 1 ~N~0), Black: 1194#(<= 1 ~N~0), 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 40#L51-4true, Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 945#(<= ~N~0 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), 111#L93-1true, Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 573#(= thread3Thread1of1ForFork1_~i~2 0), 205#(<= 1 ~N~0), 929#(<= ~N~0 0), Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 555#true, 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), 1191#true, Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 373#(<= ~N~0 0), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:07:48,607 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,607 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,607 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,607 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([528] L62-4-->L62-4: Formula: (and (= (+ v_thread3Thread1of1ForFork1_~i~2_36 1) v_thread3Thread1of1ForFork1_~i~2_35) (< v_thread3Thread1of1ForFork1_~i~2_36 v_~N~0_55) (= (+ v_~counter2~0_59 1) v_~counter2~0_58)) InVars {~counter2~0=v_~counter2~0_59, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_36, ~N~0=v_~N~0_55} OutVars{~counter2~0=v_~counter2~0_58, thread3Thread1of1ForFork1_#t~post6=|v_thread3Thread1of1ForFork1_#t~post6_9|, thread3Thread1of1ForFork1_#t~post5=|v_thread3Thread1of1ForFork1_#t~post5_13|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_35, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork1_#t~post6, thread3Thread1of1ForFork1_#t~post5, thread3Thread1of1ForFork1_~i~2][321], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1164#(<= ~N~0 0), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 929#(<= ~N~0 0), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 390#(<= 1 ~N~0), 16#L72-4true, 1194#(<= 1 ~N~0), Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 937#(<= 1 ~N~0), 40#L51-4true, Black: 558#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 945#(<= ~N~0 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), 111#L93-1true, Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 42#L62-4true, Black: 959#(<= ~N~0 0), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 573#(= thread3Thread1of1ForFork1_~i~2 0), 205#(<= 1 ~N~0), Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 555#true, 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 373#(<= ~N~0 0), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0))]) [2023-08-26 20:07:48,607 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,607 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,608 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,608 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([507] L51-4-->thread2EXIT: Formula: (and (<= v_~N~0_37 |v_thread2Thread1of1ForFork2_~i~1#1_28|) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_28|, ~N~0=v_~N~0_37} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~N~0=v_~N~0_37, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_#res#1.base][72], [Black: 1149#(<= ~N~0 0), Black: 1150#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 381#(= thread1Thread1of1ForFork0_~i~0 0), Black: 382#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 161#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 1158#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 373#(<= ~N~0 0), 186#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 153#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 1165#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 177#(and (or (and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1172#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 757#(= thread1Thread1of1ForFork0_~i~0 0), Black: 794#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork1_~i~2 0)), Black: 758#(and (= thread1Thread1of1ForFork0_~i~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 759#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 916#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 798#(and (<= thread3Thread1of1ForFork1_~i~2 0) (<= 1 ~N~0)), Black: 1181#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), 9#thread2EXITtrue, Black: 929#(<= ~N~0 0), Black: 930#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 1188#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 390#(<= 1 ~N~0), 16#L72-4true, Black: 391#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 546#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|)), 148#true, Black: 549#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 938#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0)), 173#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 937#(<= 1 ~N~0), Black: 1194#(<= 1 ~N~0), Black: 1195#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= 1 ~N~0)), 945#(<= ~N~0 0), Black: 557#(= thread3Thread1of1ForFork1_~i~2 0), Black: 946#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), Black: 567#(and (<= ~N~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 169#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 566#(<= ~N~0 0), Black: 190#(= ~counter2~0 ~counter1~0), 111#L93-1true, Black: 960#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (<= ~N~0 0)), 42#L62-4true, Black: 959#(<= ~N~0 0), 1171#(= |thread4Thread1of1ForFork3_~i~3#1| 0), 573#(= thread3Thread1of1ForFork1_~i~2 0), Black: 195#(= thread1Thread1of1ForFork0_~i~0 0), 157#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 196#(<= ~N~0 0), Black: 197#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~N~0 0)), 1199#true, 165#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1157#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 574#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 732#(and (<= 1 ~N~0) (<= 0 |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork1_~i~2 0)), 205#(<= 1 ~N~0), 738#true, Black: 1125#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= 1 ~N~0) (<= 0 thread3Thread1of1ForFork1_~i~2)), Black: 967#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 741#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 1132#(= |thread4Thread1of1ForFork3_~i~3#1| 0), Black: 740#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 966#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 742#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), Black: 361#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0)), Black: 206#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 364#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1133#(and (= |thread4Thread1of1ForFork3_~i~3#1| 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 750#(<= 1 ~N~0), Black: 751#(and (<= 1 ~N~0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 372#(= |thread2Thread1of1ForFork2_~i~1#1| 0), Black: 1142#(and (<= 1 ~N~0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 1141#(<= 1 ~N~0), Black: 374#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~N~0 0)), 1164#(<= ~N~0 0), 1193#(= thread3Thread1of1ForFork1_~i~2 0)]) [2023-08-26 20:07:48,608 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,608 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,608 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:48,608 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-26 20:07:50,629 INFO L124 PetriNetUnfolderBase]: 27262/36623 cut-off events. [2023-08-26 20:07:50,630 INFO L125 PetriNetUnfolderBase]: For 942032/946016 co-relation queries the response was YES. [2023-08-26 20:07:50,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284522 conditions, 36623 events. 27262/36623 cut-off events. For 942032/946016 co-relation queries the response was YES. Maximal size of possible extension queue 1943. Compared 210858 event pairs, 7422 based on Foata normal form. 3516/39663 useless extension candidates. Maximal degree in co-relation 284454. Up to 28979 conditions per place. [2023-08-26 20:07:50,975 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 602 selfloop transitions, 144 changer transitions 34/793 dead transitions. [2023-08-26 20:07:50,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 793 transitions, 18191 flow [2023-08-26 20:07:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:07:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:07:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-08-26 20:07:50,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45680933852140077 [2023-08-26 20:07:50,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-08-26 20:07:50,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-08-26 20:07:50,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:07:50,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-08-26 20:07:50,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:50,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:50,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:50,978 INFO L175 Difference]: Start difference. First operand has 172 places, 648 transitions, 13803 flow. Second operand 5 states and 587 transitions. [2023-08-26 20:07:50,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 793 transitions, 18191 flow [2023-08-26 20:07:57,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 793 transitions, 17496 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 20:07:57,856 INFO L231 Difference]: Finished difference. Result has 174 places, 637 transitions, 13262 flow [2023-08-26 20:07:57,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=13203, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13262, PETRI_PLACES=174, PETRI_TRANSITIONS=637} [2023-08-26 20:07:57,857 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 120 predicate places. [2023-08-26 20:07:57,857 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 637 transitions, 13262 flow [2023-08-26 20:07:57,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:57,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:07:57,857 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] [2023-08-26 20:07:57,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-26 20:07:57,858 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:07:57,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:07:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1899506859, now seen corresponding path program 9 times [2023-08-26 20:07:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:07:57,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038912897] [2023-08-26 20:07:57,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:07:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:07:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:07:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:07:57,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:07:57,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038912897] [2023-08-26 20:07:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038912897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:07:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:07:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:07:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307055146] [2023-08-26 20:07:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:07:57,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:07:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:07:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:07:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:07:57,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:07:57,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 637 transitions, 13262 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:07:57,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:07:57,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:07:57,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:03,934 INFO L124 PetriNetUnfolderBase]: 26333/35453 cut-off events. [2023-08-26 20:08:03,935 INFO L125 PetriNetUnfolderBase]: For 836106/839533 co-relation queries the response was YES. [2023-08-26 20:08:04,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271594 conditions, 35453 events. 26333/35453 cut-off events. For 836106/839533 co-relation queries the response was YES. Maximal size of possible extension queue 1785. Compared 202497 event pairs, 5945 based on Foata normal form. 2991/37996 useless extension candidates. Maximal degree in co-relation 271526. Up to 16202 conditions per place. [2023-08-26 20:08:04,517 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 254 selfloop transitions, 464 changer transitions 2/738 dead transitions. [2023-08-26 20:08:04,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 738 transitions, 16014 flow [2023-08-26 20:08:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:08:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:08:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:08:04,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:08:04,519 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:08:04,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:08:04,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:04,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:08:04,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:04,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:04,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:04,532 INFO L175 Difference]: Start difference. First operand has 174 places, 637 transitions, 13262 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:08:04,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 738 transitions, 16014 flow [2023-08-26 20:08:11,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 738 transitions, 15581 flow, removed 80 selfloop flow, removed 3 redundant places. [2023-08-26 20:08:11,332 INFO L231 Difference]: Finished difference. Result has 175 places, 638 transitions, 13928 flow [2023-08-26 20:08:11,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=12920, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13928, PETRI_PLACES=175, PETRI_TRANSITIONS=638} [2023-08-26 20:08:11,333 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 121 predicate places. [2023-08-26 20:08:11,333 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 638 transitions, 13928 flow [2023-08-26 20:08:11,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:11,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:11,334 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] [2023-08-26 20:08:11,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-26 20:08:11,334 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:11,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1406786617, now seen corresponding path program 10 times [2023-08-26 20:08:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142038983] [2023-08-26 20:08:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142038983] [2023-08-26 20:08:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142038983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:11,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:08:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408266316] [2023-08-26 20:08:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:11,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:08:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:08:11,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:08:11,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:08:11,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 638 transitions, 13928 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:11,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:11,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:08:11,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:17,829 INFO L124 PetriNetUnfolderBase]: 24994/33734 cut-off events. [2023-08-26 20:08:17,829 INFO L125 PetriNetUnfolderBase]: For 824682/827965 co-relation queries the response was YES. [2023-08-26 20:08:18,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256085 conditions, 33734 events. 24994/33734 cut-off events. For 824682/827965 co-relation queries the response was YES. Maximal size of possible extension queue 1714. Compared 193520 event pairs, 5406 based on Foata normal form. 3157/36472 useless extension candidates. Maximal degree in co-relation 256017. Up to 15504 conditions per place. [2023-08-26 20:08:18,121 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 236 selfloop transitions, 463 changer transitions 42/757 dead transitions. [2023-08-26 20:08:18,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 757 transitions, 16994 flow [2023-08-26 20:08:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:08:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:08:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:08:18,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:08:18,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:08:18,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:08:18,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:18,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:08:18,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:18,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:18,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:18,125 INFO L175 Difference]: Start difference. First operand has 175 places, 638 transitions, 13928 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:08:18,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 757 transitions, 16994 flow [2023-08-26 20:08:24,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 757 transitions, 16152 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 20:08:24,636 INFO L231 Difference]: Finished difference. Result has 177 places, 631 transitions, 13987 flow [2023-08-26 20:08:24,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=13054, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=458, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13987, PETRI_PLACES=177, PETRI_TRANSITIONS=631} [2023-08-26 20:08:24,637 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 123 predicate places. [2023-08-26 20:08:24,637 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 631 transitions, 13987 flow [2023-08-26 20:08:24,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:24,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:24,638 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] [2023-08-26 20:08:24,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-26 20:08:24,638 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:24,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash -622877868, now seen corresponding path program 7 times [2023-08-26 20:08:24,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:24,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942936668] [2023-08-26 20:08:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:24,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:24,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942936668] [2023-08-26 20:08:24,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942936668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:24,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:24,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:08:24,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53898127] [2023-08-26 20:08:24,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:24,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:08:24,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:24,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:08:24,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:08:24,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:08:24,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 631 transitions, 13987 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:24,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:24,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:08:24,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:30,327 INFO L124 PetriNetUnfolderBase]: 24060/32357 cut-off events. [2023-08-26 20:08:30,327 INFO L125 PetriNetUnfolderBase]: For 788329/792227 co-relation queries the response was YES. [2023-08-26 20:08:30,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247120 conditions, 32357 events. 24060/32357 cut-off events. For 788329/792227 co-relation queries the response was YES. Maximal size of possible extension queue 1685. Compared 183747 event pairs, 5592 based on Foata normal form. 3296/35369 useless extension candidates. Maximal degree in co-relation 247052. Up to 15721 conditions per place. [2023-08-26 20:08:30,650 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 208 selfloop transitions, 545 changer transitions 11/776 dead transitions. [2023-08-26 20:08:30,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 776 transitions, 18478 flow [2023-08-26 20:08:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:08:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:08:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-08-26 20:08:30,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45680933852140077 [2023-08-26 20:08:30,651 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-08-26 20:08:30,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-08-26 20:08:30,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:30,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-08-26 20:08:30,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:30,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:30,653 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:30,653 INFO L175 Difference]: Start difference. First operand has 177 places, 631 transitions, 13987 flow. Second operand 5 states and 587 transitions. [2023-08-26 20:08:30,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 776 transitions, 18478 flow [2023-08-26 20:08:36,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 776 transitions, 17614 flow, removed 88 selfloop flow, removed 6 redundant places. [2023-08-26 20:08:36,521 INFO L231 Difference]: Finished difference. Result has 175 places, 722 transitions, 17238 flow [2023-08-26 20:08:36,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=13288, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=459, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=17238, PETRI_PLACES=175, PETRI_TRANSITIONS=722} [2023-08-26 20:08:36,522 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 121 predicate places. [2023-08-26 20:08:36,522 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 722 transitions, 17238 flow [2023-08-26 20:08:36,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:36,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:36,522 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] [2023-08-26 20:08:36,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-08-26 20:08:36,523 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:36,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash 425248382, now seen corresponding path program 6 times [2023-08-26 20:08:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:36,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147249811] [2023-08-26 20:08:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:36,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:36,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147249811] [2023-08-26 20:08:36,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147249811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:08:36,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:08:36,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:08:36,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395356140] [2023-08-26 20:08:36,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:08:36,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:08:36,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:08:36,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:08:36,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:08:36,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 722 transitions, 17238 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:36,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:36,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:08:36,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:42,898 INFO L124 PetriNetUnfolderBase]: 25219/33992 cut-off events. [2023-08-26 20:08:42,898 INFO L125 PetriNetUnfolderBase]: For 875809/880471 co-relation queries the response was YES. [2023-08-26 20:08:43,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261497 conditions, 33992 events. 25219/33992 cut-off events. For 875809/880471 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 194607 event pairs, 7245 based on Foata normal form. 3309/36816 useless extension candidates. Maximal degree in co-relation 261429. Up to 26538 conditions per place. [2023-08-26 20:08:43,242 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 614 selfloop transitions, 96 changer transitions 95/865 dead transitions. [2023-08-26 20:08:43,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 865 transitions, 21155 flow [2023-08-26 20:08:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:08:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:08:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:08:43,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:08:43,243 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:08:43,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:08:43,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:43,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:08:43,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:43,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:43,246 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:43,246 INFO L175 Difference]: Start difference. First operand has 175 places, 722 transitions, 17238 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:08:43,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 865 transitions, 21155 flow [2023-08-26 20:08:50,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 865 transitions, 20423 flow, removed 366 selfloop flow, removed 0 redundant places. [2023-08-26 20:08:50,134 INFO L231 Difference]: Finished difference. Result has 180 places, 702 transitions, 16428 flow [2023-08-26 20:08:50,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=16588, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16428, PETRI_PLACES=180, PETRI_TRANSITIONS=702} [2023-08-26 20:08:50,135 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 126 predicate places. [2023-08-26 20:08:50,135 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 702 transitions, 16428 flow [2023-08-26 20:08:50,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:50,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:08:50,135 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] [2023-08-26 20:08:50,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-26 20:08:50,135 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:08:50,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:08:50,136 INFO L85 PathProgramCache]: Analyzing trace with hash 902707596, now seen corresponding path program 8 times [2023-08-26 20:08:50,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:08:50,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231880245] [2023-08-26 20:08:50,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:08:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:08:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:08:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:08:50,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231880245] [2023-08-26 20:08:50,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231880245] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:08:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529746196] [2023-08-26 20:08:50,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 20:08:50,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:08:50,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:08:50,196 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:08:50,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 20:08:50,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 20:08:50,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:08:50,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:08:50,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:08:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:50,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:08:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:08:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529746196] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:08:50,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:08:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-26 20:08:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697423637] [2023-08-26 20:08:50,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:08:50,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 20:08:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:08:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 20:08:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-26 20:08:50,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:08:50,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 702 transitions, 16428 flow. Second operand has 10 states, 10 states have (on average 108.7) internal successors, (1087), 10 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:50,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:08:50,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:08:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:08:55,973 INFO L124 PetriNetUnfolderBase]: 22812/30738 cut-off events. [2023-08-26 20:08:55,973 INFO L125 PetriNetUnfolderBase]: For 789238/792979 co-relation queries the response was YES. [2023-08-26 20:08:56,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238065 conditions, 30738 events. 22812/30738 cut-off events. For 789238/792979 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 174450 event pairs, 4870 based on Foata normal form. 3415/33899 useless extension candidates. Maximal degree in co-relation 237995. Up to 14385 conditions per place. [2023-08-26 20:08:56,262 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 218 selfloop transitions, 600 changer transitions 27/855 dead transitions. [2023-08-26 20:08:56,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 855 transitions, 21324 flow [2023-08-26 20:08:56,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 20:08:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 20:08:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-08-26 20:08:56,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591439688715953 [2023-08-26 20:08:56,263 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-08-26 20:08:56,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-08-26 20:08:56,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:08:56,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-08-26 20:08:56,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:56,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:56,266 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:08:56,266 INFO L175 Difference]: Start difference. First operand has 180 places, 702 transitions, 16428 flow. Second operand 6 states and 708 transitions. [2023-08-26 20:08:56,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 855 transitions, 21324 flow [2023-08-26 20:09:01,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 855 transitions, 21072 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-08-26 20:09:01,967 INFO L231 Difference]: Finished difference. Result has 181 places, 762 transitions, 19502 flow [2023-08-26 20:09:01,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=16198, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=521, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=19502, PETRI_PLACES=181, PETRI_TRANSITIONS=762} [2023-08-26 20:09:01,967 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 127 predicate places. [2023-08-26 20:09:01,968 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 762 transitions, 19502 flow [2023-08-26 20:09:01,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.7) internal successors, (1087), 10 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:01,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:01,968 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] [2023-08-26 20:09:01,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 20:09:02,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:02,173 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:02,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:02,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1776977518, now seen corresponding path program 7 times [2023-08-26 20:09:02,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:02,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977794980] [2023-08-26 20:09:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977794980] [2023-08-26 20:09:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977794980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:09:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:09:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:09:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949528762] [2023-08-26 20:09:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:09:02,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:09:02,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:09:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:09:02,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:09:02,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 762 transitions, 19502 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:02,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:02,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:09:02,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:07,255 INFO L124 PetriNetUnfolderBase]: 20239/26910 cut-off events. [2023-08-26 20:09:07,255 INFO L125 PetriNetUnfolderBase]: For 741042/744522 co-relation queries the response was YES. [2023-08-26 20:09:07,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208644 conditions, 26910 events. 20239/26910 cut-off events. For 741042/744522 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 143813 event pairs, 4988 based on Foata normal form. 2595/29096 useless extension candidates. Maximal degree in co-relation 208574. Up to 20428 conditions per place. [2023-08-26 20:09:07,461 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 712 selfloop transitions, 52 changer transitions 84/903 dead transitions. [2023-08-26 20:09:07,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 903 transitions, 23301 flow [2023-08-26 20:09:07,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:09:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:09:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-08-26 20:09:07,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599221789883268 [2023-08-26 20:09:07,462 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-08-26 20:09:07,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-08-26 20:09:07,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:07,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-08-26 20:09:07,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:07,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:07,464 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:07,465 INFO L175 Difference]: Start difference. First operand has 181 places, 762 transitions, 19502 flow. Second operand 5 states and 591 transitions. [2023-08-26 20:09:07,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 903 transitions, 23301 flow [2023-08-26 20:09:11,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 903 transitions, 20468 flow, removed 564 selfloop flow, removed 8 redundant places. [2023-08-26 20:09:11,926 INFO L231 Difference]: Finished difference. Result has 171 places, 737 transitions, 16330 flow [2023-08-26 20:09:11,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=16669, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16330, PETRI_PLACES=171, PETRI_TRANSITIONS=737} [2023-08-26 20:09:11,927 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 117 predicate places. [2023-08-26 20:09:11,927 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 737 transitions, 16330 flow [2023-08-26 20:09:11,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:11,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:11,928 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] [2023-08-26 20:09:11,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-08-26 20:09:11,928 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:11,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash -163778692, now seen corresponding path program 8 times [2023-08-26 20:09:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:11,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597250593] [2023-08-26 20:09:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:11,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:11,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597250593] [2023-08-26 20:09:11,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597250593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:09:11,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:09:11,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:09:11,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720826002] [2023-08-26 20:09:11,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:09:11,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:09:11,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:11,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:09:11,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:09:11,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:09:11,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 737 transitions, 16330 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:11,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:11,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:09:11,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:16,189 INFO L124 PetriNetUnfolderBase]: 18903/25180 cut-off events. [2023-08-26 20:09:16,189 INFO L125 PetriNetUnfolderBase]: For 508606/510783 co-relation queries the response was YES. [2023-08-26 20:09:16,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185587 conditions, 25180 events. 18903/25180 cut-off events. For 508606/510783 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 133729 event pairs, 5082 based on Foata normal form. 1850/26564 useless extension candidates. Maximal degree in co-relation 185522. Up to 19888 conditions per place. [2023-08-26 20:09:16,392 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 659 selfloop transitions, 116 changer transitions 24/817 dead transitions. [2023-08-26 20:09:16,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 817 transitions, 18710 flow [2023-08-26 20:09:16,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:09:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:09:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2023-08-26 20:09:16,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544747081712062 [2023-08-26 20:09:16,393 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2023-08-26 20:09:16,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2023-08-26 20:09:16,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:16,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2023-08-26 20:09:16,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:16,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:16,395 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:16,395 INFO L175 Difference]: Start difference. First operand has 171 places, 737 transitions, 16330 flow. Second operand 5 states and 584 transitions. [2023-08-26 20:09:16,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 817 transitions, 18710 flow [2023-08-26 20:09:19,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 817 transitions, 18572 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-26 20:09:19,918 INFO L231 Difference]: Finished difference. Result has 169 places, 722 transitions, 16019 flow [2023-08-26 20:09:19,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=16198, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16019, PETRI_PLACES=169, PETRI_TRANSITIONS=722} [2023-08-26 20:09:19,919 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 115 predicate places. [2023-08-26 20:09:19,919 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 722 transitions, 16019 flow [2023-08-26 20:09:19,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:19,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:19,919 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] [2023-08-26 20:09:19,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-08-26 20:09:19,919 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:19,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:19,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1512545684, now seen corresponding path program 9 times [2023-08-26 20:09:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:19,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676087534] [2023-08-26 20:09:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676087534] [2023-08-26 20:09:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676087534] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22348160] [2023-08-26 20:09:19,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 20:09:19,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:19,977 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:09:19,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 20:09:20,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 20:09:20,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:09:20,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:09:20,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:20,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:09:20,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22348160] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:20,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-26 20:09:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490579798] [2023-08-26 20:09:20,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:20,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 20:09:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 20:09:20,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-26 20:09:20,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:09:20,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 722 transitions, 16019 flow. Second operand has 10 states, 10 states have (on average 108.7) internal successors, (1087), 10 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:20,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:20,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:09:20,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:24,331 INFO L124 PetriNetUnfolderBase]: 18342/24274 cut-off events. [2023-08-26 20:09:24,331 INFO L125 PetriNetUnfolderBase]: For 465165/467434 co-relation queries the response was YES. [2023-08-26 20:09:24,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177675 conditions, 24274 events. 18342/24274 cut-off events. For 465165/467434 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 127663 event pairs, 2329 based on Foata normal form. 1988/25912 useless extension candidates. Maximal degree in co-relation 177611. Up to 12798 conditions per place. [2023-08-26 20:09:24,499 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 946 selfloop transitions, 97 changer transitions 158/1252 dead transitions. [2023-08-26 20:09:24,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1252 transitions, 27583 flow [2023-08-26 20:09:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 20:09:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 20:09:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1175 transitions. [2023-08-26 20:09:24,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4571984435797665 [2023-08-26 20:09:24,501 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1175 transitions. [2023-08-26 20:09:24,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1175 transitions. [2023-08-26 20:09:24,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:24,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1175 transitions. [2023-08-26 20:09:24,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.5) internal successors, (1175), 10 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:24,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:24,504 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:24,504 INFO L175 Difference]: Start difference. First operand has 169 places, 722 transitions, 16019 flow. Second operand 10 states and 1175 transitions. [2023-08-26 20:09:24,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1252 transitions, 27583 flow [2023-08-26 20:09:27,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 1252 transitions, 27325 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-26 20:09:27,684 INFO L231 Difference]: Finished difference. Result has 176 places, 707 transitions, 15610 flow [2023-08-26 20:09:27,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=15722, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15610, PETRI_PLACES=176, PETRI_TRANSITIONS=707} [2023-08-26 20:09:27,685 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 122 predicate places. [2023-08-26 20:09:27,685 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 707 transitions, 15610 flow [2023-08-26 20:09:27,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.7) internal successors, (1087), 10 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:27,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:27,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:09:27,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 20:09:27,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:27,886 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:27,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1429247709, now seen corresponding path program 1 times [2023-08-26 20:09:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:27,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906893246] [2023-08-26 20:09:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:27,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:27,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:27,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906893246] [2023-08-26 20:09:27,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906893246] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:27,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996231817] [2023-08-26 20:09:27,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:27,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:27,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:27,938 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:09:27,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 20:09:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:28,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:09:28,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:28,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:28,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996231817] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:28,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-26 20:09:28,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070691276] [2023-08-26 20:09:28,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:28,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:09:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:28,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:09:28,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:09:28,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:09:28,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 707 transitions, 15610 flow. Second operand has 8 states, 8 states have (on average 110.375) internal successors, (883), 8 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:28,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:28,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:09:28,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:31,943 INFO L124 PetriNetUnfolderBase]: 17417/22798 cut-off events. [2023-08-26 20:09:31,944 INFO L125 PetriNetUnfolderBase]: For 430592/432208 co-relation queries the response was YES. [2023-08-26 20:09:32,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172586 conditions, 22798 events. 17417/22798 cut-off events. For 430592/432208 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 113322 event pairs, 1054 based on Foata normal form. 1126/23771 useless extension candidates. Maximal degree in co-relation 172520. Up to 13111 conditions per place. [2023-08-26 20:09:32,116 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 740 selfloop transitions, 112 changer transitions 0/906 dead transitions. [2023-08-26 20:09:32,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 906 transitions, 20103 flow [2023-08-26 20:09:32,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 20:09:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 20:09:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2023-08-26 20:09:32,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45969983324068925 [2023-08-26 20:09:32,118 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2023-08-26 20:09:32,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2023-08-26 20:09:32,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:32,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2023-08-26 20:09:32,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:32,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:32,121 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:32,121 INFO L175 Difference]: Start difference. First operand has 176 places, 707 transitions, 15610 flow. Second operand 7 states and 827 transitions. [2023-08-26 20:09:32,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 906 transitions, 20103 flow [2023-08-26 20:09:35,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 906 transitions, 18593 flow, removed 149 selfloop flow, removed 14 redundant places. [2023-08-26 20:09:35,703 INFO L231 Difference]: Finished difference. Result has 159 places, 726 transitions, 14886 flow [2023-08-26 20:09:35,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=14291, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14886, PETRI_PLACES=159, PETRI_TRANSITIONS=726} [2023-08-26 20:09:35,703 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 105 predicate places. [2023-08-26 20:09:35,704 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 726 transitions, 14886 flow [2023-08-26 20:09:35,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.375) internal successors, (883), 8 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:35,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:35,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:09:35,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-26 20:09:35,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-08-26 20:09:35,910 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:35,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash -907478175, now seen corresponding path program 2 times [2023-08-26 20:09:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:35,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574848895] [2023-08-26 20:09:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574848895] [2023-08-26 20:09:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574848895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:09:35,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:09:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:09:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048213421] [2023-08-26 20:09:35,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:09:35,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:09:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:09:35,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:09:35,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:09:35,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 726 transitions, 14886 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:35,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:35,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:09:35,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:39,937 INFO L124 PetriNetUnfolderBase]: 19024/24853 cut-off events. [2023-08-26 20:09:39,937 INFO L125 PetriNetUnfolderBase]: For 469138/471033 co-relation queries the response was YES. [2023-08-26 20:09:40,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186365 conditions, 24853 events. 19024/24853 cut-off events. For 469138/471033 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 123560 event pairs, 3741 based on Foata normal form. 1398/25993 useless extension candidates. Maximal degree in co-relation 186305. Up to 17233 conditions per place. [2023-08-26 20:09:40,135 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 746 selfloop transitions, 137 changer transitions 0/937 dead transitions. [2023-08-26 20:09:40,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 937 transitions, 20173 flow [2023-08-26 20:09:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:09:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:09:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-08-26 20:09:40,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591439688715953 [2023-08-26 20:09:40,137 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-08-26 20:09:40,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-08-26 20:09:40,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:40,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-08-26 20:09:40,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:40,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:40,138 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:40,138 INFO L175 Difference]: Start difference. First operand has 159 places, 726 transitions, 14886 flow. Second operand 5 states and 590 transitions. [2023-08-26 20:09:40,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 937 transitions, 20173 flow [2023-08-26 20:09:43,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 937 transitions, 20036 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:09:43,787 INFO L231 Difference]: Finished difference. Result has 164 places, 775 transitions, 16164 flow [2023-08-26 20:09:43,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=14782, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16164, PETRI_PLACES=164, PETRI_TRANSITIONS=775} [2023-08-26 20:09:43,787 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 110 predicate places. [2023-08-26 20:09:43,788 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 775 transitions, 16164 flow [2023-08-26 20:09:43,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:43,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:43,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:09:43,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-08-26 20:09:43,788 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:43,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash -987226423, now seen corresponding path program 3 times [2023-08-26 20:09:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366771238] [2023-08-26 20:09:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:09:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366771238] [2023-08-26 20:09:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366771238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:09:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:09:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:09:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986567828] [2023-08-26 20:09:43,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:09:43,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:09:43,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:43,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:09:43,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:09:43,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:09:43,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 775 transitions, 16164 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:43,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:43,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:09:43,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:09:48,582 INFO L124 PetriNetUnfolderBase]: 21538/28303 cut-off events. [2023-08-26 20:09:48,582 INFO L125 PetriNetUnfolderBase]: For 522751/523528 co-relation queries the response was YES. [2023-08-26 20:09:48,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218240 conditions, 28303 events. 21538/28303 cut-off events. For 522751/523528 co-relation queries the response was YES. Maximal size of possible extension queue 1230. Compared 145124 event pairs, 1130 based on Foata normal form. 651/28750 useless extension candidates. Maximal degree in co-relation 218177. Up to 17124 conditions per place. [2023-08-26 20:09:48,823 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 962 selfloop transitions, 72 changer transitions 0/1098 dead transitions. [2023-08-26 20:09:48,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 1098 transitions, 23910 flow [2023-08-26 20:09:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:09:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:09:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-08-26 20:09:48,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46381322957198445 [2023-08-26 20:09:48,825 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-08-26 20:09:48,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-08-26 20:09:48,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:09:48,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-08-26 20:09:48,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:48,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:48,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:48,826 INFO L175 Difference]: Start difference. First operand has 164 places, 775 transitions, 16164 flow. Second operand 5 states and 596 transitions. [2023-08-26 20:09:48,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 1098 transitions, 23910 flow [2023-08-26 20:09:54,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 1098 transitions, 23654 flow, removed 128 selfloop flow, removed 0 redundant places. [2023-08-26 20:09:54,345 INFO L231 Difference]: Finished difference. Result has 170 places, 811 transitions, 16946 flow [2023-08-26 20:09:54,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=16046, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16946, PETRI_PLACES=170, PETRI_TRANSITIONS=811} [2023-08-26 20:09:54,346 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 116 predicate places. [2023-08-26 20:09:54,346 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 811 transitions, 16946 flow [2023-08-26 20:09:54,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:54,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:09:54,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:09:54,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-08-26 20:09:54,346 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:09:54,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:09:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1167613251, now seen corresponding path program 4 times [2023-08-26 20:09:54,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:09:54,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312452626] [2023-08-26 20:09:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:09:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:09:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:09:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:54,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:09:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312452626] [2023-08-26 20:09:54,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312452626] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:09:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027028341] [2023-08-26 20:09:54,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 20:09:54,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:09:54,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:09:54,401 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:09:54,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 20:09:54,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 20:09:54,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:09:54,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-26 20:09:54,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:09:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:54,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:09:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:09:54,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027028341] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:09:54,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:09:54,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-26 20:09:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463910277] [2023-08-26 20:09:54,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:09:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 20:09:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:09:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 20:09:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-26 20:09:54,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:09:54,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 811 transitions, 16946 flow. Second operand has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:09:54,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:09:54,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:09:54,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:10:00,196 INFO L124 PetriNetUnfolderBase]: 23894/31309 cut-off events. [2023-08-26 20:10:00,196 INFO L125 PetriNetUnfolderBase]: For 624174/626151 co-relation queries the response was YES. [2023-08-26 20:10:00,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245859 conditions, 31309 events. 23894/31309 cut-off events. For 624174/626151 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 162264 event pairs, 2099 based on Foata normal form. 1338/32549 useless extension candidates. Maximal degree in co-relation 245793. Up to 18549 conditions per place. [2023-08-26 20:10:00,486 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 604 selfloop transitions, 619 changer transitions 0/1245 dead transitions. [2023-08-26 20:10:00,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 1245 transitions, 26601 flow [2023-08-26 20:10:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 20:10:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 20:10:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1179 transitions. [2023-08-26 20:10:00,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45875486381322955 [2023-08-26 20:10:00,488 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1179 transitions. [2023-08-26 20:10:00,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1179 transitions. [2023-08-26 20:10:00,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:10:00,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1179 transitions. [2023-08-26 20:10:00,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.9) internal successors, (1179), 10 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 20:10:00,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:00,491 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:00,491 INFO L175 Difference]: Start difference. First operand has 170 places, 811 transitions, 16946 flow. Second operand 10 states and 1179 transitions. [2023-08-26 20:10:00,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 1245 transitions, 26601 flow [2023-08-26 20:10:06,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 1245 transitions, 26500 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:10:06,632 INFO L231 Difference]: Finished difference. Result has 181 places, 886 transitions, 20175 flow [2023-08-26 20:10:06,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=16904, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=811, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=556, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20175, PETRI_PLACES=181, PETRI_TRANSITIONS=886} [2023-08-26 20:10:06,633 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 127 predicate places. [2023-08-26 20:10:06,633 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 886 transitions, 20175 flow [2023-08-26 20:10:06,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:06,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:10:06,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:10:06,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-26 20:10:06,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-08-26 20:10:06,835 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:10:06,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:10:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1528871333, now seen corresponding path program 5 times [2023-08-26 20:10:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:10:06,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176640408] [2023-08-26 20:10:06,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:10:06,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:10:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:10:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:10:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:10:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176640408] [2023-08-26 20:10:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176640408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:10:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:10:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:10:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318136996] [2023-08-26 20:10:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:10:06,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:10:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:10:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:10:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:10:06,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:10:06,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 886 transitions, 20175 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:06,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:10:06,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:10:06,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:10:14,240 INFO L124 PetriNetUnfolderBase]: 29215/38228 cut-off events. [2023-08-26 20:10:14,241 INFO L125 PetriNetUnfolderBase]: For 927857/929239 co-relation queries the response was YES. [2023-08-26 20:10:14,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315260 conditions, 38228 events. 29215/38228 cut-off events. For 927857/929239 co-relation queries the response was YES. Maximal size of possible extension queue 1692. Compared 201469 event pairs, 5176 based on Foata normal form. 1101/38903 useless extension candidates. Maximal degree in co-relation 315190. Up to 25661 conditions per place. [2023-08-26 20:10:14,656 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 1061 selfloop transitions, 195 changer transitions 0/1320 dead transitions. [2023-08-26 20:10:14,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 1320 transitions, 31008 flow [2023-08-26 20:10:14,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:10:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:10:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-26 20:10:14,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070038910505834 [2023-08-26 20:10:14,657 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-26 20:10:14,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-26 20:10:14,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:10:14,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-26 20:10:14,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:14,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:14,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:14,659 INFO L175 Difference]: Start difference. First operand has 181 places, 886 transitions, 20175 flow. Second operand 5 states and 592 transitions. [2023-08-26 20:10:14,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 1320 transitions, 31008 flow [2023-08-26 20:10:25,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1320 transitions, 30212 flow, removed 133 selfloop flow, removed 1 redundant places. [2023-08-26 20:10:25,494 INFO L231 Difference]: Finished difference. Result has 187 places, 1045 transitions, 23654 flow [2023-08-26 20:10:25,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=19609, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=765, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=23654, PETRI_PLACES=187, PETRI_TRANSITIONS=1045} [2023-08-26 20:10:25,495 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 133 predicate places. [2023-08-26 20:10:25,495 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 1045 transitions, 23654 flow [2023-08-26 20:10:25,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:25,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:10:25,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:10:25,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-08-26 20:10:25,496 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:10:25,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:10:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1238437065, now seen corresponding path program 6 times [2023-08-26 20:10:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:10:25,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396727707] [2023-08-26 20:10:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:10:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:10:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:10:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:10:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:10:25,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396727707] [2023-08-26 20:10:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396727707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:10:25,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:10:25,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:10:25,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587175026] [2023-08-26 20:10:25,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:10:25,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:10:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:10:25,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:10:25,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:10:25,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:10:25,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1045 transitions, 23654 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:25,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:10:25,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:10:25,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:10:33,468 INFO L124 PetriNetUnfolderBase]: 28624/37531 cut-off events. [2023-08-26 20:10:33,468 INFO L125 PetriNetUnfolderBase]: For 948499/950140 co-relation queries the response was YES. [2023-08-26 20:10:33,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318622 conditions, 37531 events. 28624/37531 cut-off events. For 948499/950140 co-relation queries the response was YES. Maximal size of possible extension queue 1655. Compared 197752 event pairs, 4315 based on Foata normal form. 1223/38444 useless extension candidates. Maximal degree in co-relation 318548. Up to 22276 conditions per place. [2023-08-26 20:10:33,892 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 889 selfloop transitions, 435 changer transitions 0/1388 dead transitions. [2023-08-26 20:10:33,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 1388 transitions, 33045 flow [2023-08-26 20:10:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:10:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:10:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-26 20:10:33,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614785992217899 [2023-08-26 20:10:33,893 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-26 20:10:33,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-26 20:10:33,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:10:33,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-26 20:10:33,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:33,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:33,896 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:33,896 INFO L175 Difference]: Start difference. First operand has 187 places, 1045 transitions, 23654 flow. Second operand 5 states and 593 transitions. [2023-08-26 20:10:33,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 1388 transitions, 33045 flow [2023-08-26 20:10:45,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 1388 transitions, 32673 flow, removed 126 selfloop flow, removed 1 redundant places. [2023-08-26 20:10:45,448 INFO L231 Difference]: Finished difference. Result has 192 places, 1190 transitions, 27920 flow [2023-08-26 20:10:45,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=23312, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=290, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=27920, PETRI_PLACES=192, PETRI_TRANSITIONS=1190} [2023-08-26 20:10:45,449 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 138 predicate places. [2023-08-26 20:10:45,449 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 1190 transitions, 27920 flow [2023-08-26 20:10:45,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:45,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:10:45,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:10:45,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-08-26 20:10:45,449 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:10:45,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:10:45,449 INFO L85 PathProgramCache]: Analyzing trace with hash 623601603, now seen corresponding path program 7 times [2023-08-26 20:10:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:10:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688366402] [2023-08-26 20:10:45,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:10:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:10:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:10:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:10:45,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:10:45,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688366402] [2023-08-26 20:10:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688366402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:10:45,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:10:45,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:10:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551059154] [2023-08-26 20:10:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:10:45,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:10:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:10:45,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:10:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:10:45,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:10:45,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 1190 transitions, 27920 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:45,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:10:45,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:10:45,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:10:54,386 INFO L124 PetriNetUnfolderBase]: 28778/37769 cut-off events. [2023-08-26 20:10:54,386 INFO L125 PetriNetUnfolderBase]: For 995444/996932 co-relation queries the response was YES. [2023-08-26 20:10:54,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329809 conditions, 37769 events. 28778/37769 cut-off events. For 995444/996932 co-relation queries the response was YES. Maximal size of possible extension queue 1717. Compared 201205 event pairs, 5603 based on Foata normal form. 940/38203 useless extension candidates. Maximal degree in co-relation 329733. Up to 29345 conditions per place. [2023-08-26 20:10:54,868 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 1033 selfloop transitions, 165 changer transitions 36/1298 dead transitions. [2023-08-26 20:10:54,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1298 transitions, 32061 flow [2023-08-26 20:10:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:10:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:10:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-08-26 20:10:54,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45525291828793774 [2023-08-26 20:10:54,869 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-08-26 20:10:54,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-08-26 20:10:54,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:10:54,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-08-26 20:10:54,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:54,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:54,872 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:10:54,872 INFO L175 Difference]: Start difference. First operand has 192 places, 1190 transitions, 27920 flow. Second operand 5 states and 585 transitions. [2023-08-26 20:10:54,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1298 transitions, 32061 flow [2023-08-26 20:11:08,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1298 transitions, 30986 flow, removed 335 selfloop flow, removed 1 redundant places. [2023-08-26 20:11:08,304 INFO L231 Difference]: Finished difference. Result has 195 places, 1184 transitions, 27037 flow [2023-08-26 20:11:08,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=26845, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=27037, PETRI_PLACES=195, PETRI_TRANSITIONS=1184} [2023-08-26 20:11:08,305 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 141 predicate places. [2023-08-26 20:11:08,305 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 1184 transitions, 27037 flow [2023-08-26 20:11:08,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:08,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:11:08,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:11:08,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-08-26 20:11:08,305 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:11:08,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:11:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1338653433, now seen corresponding path program 8 times [2023-08-26 20:11:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:11:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306328110] [2023-08-26 20:11:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:11:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:11:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:11:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:11:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:11:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306328110] [2023-08-26 20:11:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306328110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:11:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:11:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:11:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260873584] [2023-08-26 20:11:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:11:08,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:11:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:11:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:11:08,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:11:08,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:11:08,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1184 transitions, 27037 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:08,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:11:08,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:11:08,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:11:17,494 INFO L124 PetriNetUnfolderBase]: 27854/36596 cut-off events. [2023-08-26 20:11:17,495 INFO L125 PetriNetUnfolderBase]: For 940393/943161 co-relation queries the response was YES. [2023-08-26 20:11:17,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313093 conditions, 36596 events. 27854/36596 cut-off events. For 940393/943161 co-relation queries the response was YES. Maximal size of possible extension queue 1702. Compared 194286 event pairs, 4433 based on Foata normal form. 1662/37956 useless extension candidates. Maximal degree in co-relation 313017. Up to 22127 conditions per place. [2023-08-26 20:11:17,913 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 745 selfloop transitions, 489 changer transitions 51/1313 dead transitions. [2023-08-26 20:11:17,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 1313 transitions, 31567 flow [2023-08-26 20:11:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:11:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:11:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-08-26 20:11:17,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591439688715953 [2023-08-26 20:11:17,914 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-08-26 20:11:17,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-08-26 20:11:17,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:11:17,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-08-26 20:11:17,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:17,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:17,916 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:17,916 INFO L175 Difference]: Start difference. First operand has 195 places, 1184 transitions, 27037 flow. Second operand 5 states and 590 transitions. [2023-08-26 20:11:17,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 1313 transitions, 31567 flow [2023-08-26 20:11:29,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 1313 transitions, 31358 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 20:11:29,838 INFO L231 Difference]: Finished difference. Result has 197 places, 1178 transitions, 27834 flow [2023-08-26 20:11:29,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=26848, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=27834, PETRI_PLACES=197, PETRI_TRANSITIONS=1178} [2023-08-26 20:11:29,839 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 143 predicate places. [2023-08-26 20:11:29,839 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 1178 transitions, 27834 flow [2023-08-26 20:11:29,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:29,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:11:29,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:11:29,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-08-26 20:11:29,839 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:11:29,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:11:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1248727873, now seen corresponding path program 9 times [2023-08-26 20:11:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:11:29,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032211745] [2023-08-26 20:11:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:11:29,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:11:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:11:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:11:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:11:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032211745] [2023-08-26 20:11:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032211745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 20:11:29,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 20:11:29,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 20:11:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434195149] [2023-08-26 20:11:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 20:11:29,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 20:11:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:11:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 20:11:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 20:11:29,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:11:29,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1178 transitions, 27834 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:29,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:11:29,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:11:29,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:11:38,297 INFO L124 PetriNetUnfolderBase]: 26957/35289 cut-off events. [2023-08-26 20:11:38,297 INFO L125 PetriNetUnfolderBase]: For 946545/949064 co-relation queries the response was YES. [2023-08-26 20:11:38,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307161 conditions, 35289 events. 26957/35289 cut-off events. For 946545/949064 co-relation queries the response was YES. Maximal size of possible extension queue 1598. Compared 184105 event pairs, 4152 based on Foata normal form. 1478/36519 useless extension candidates. Maximal degree in co-relation 307084. Up to 21552 conditions per place. [2023-08-26 20:11:38,734 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 794 selfloop transitions, 513 changer transitions 6/1341 dead transitions. [2023-08-26 20:11:38,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 1341 transitions, 33303 flow [2023-08-26 20:11:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 20:11:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 20:11:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-26 20:11:38,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622568093385214 [2023-08-26 20:11:38,736 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-26 20:11:38,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-26 20:11:38,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:11:38,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-26 20:11:38,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:38,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:38,737 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:38,737 INFO L175 Difference]: Start difference. First operand has 197 places, 1178 transitions, 27834 flow. Second operand 5 states and 594 transitions. [2023-08-26 20:11:38,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 1341 transitions, 33303 flow [2023-08-26 20:11:50,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1341 transitions, 32629 flow, removed 58 selfloop flow, removed 3 redundant places. [2023-08-26 20:11:50,652 INFO L231 Difference]: Finished difference. Result has 197 places, 1202 transitions, 28842 flow [2023-08-26 20:11:50,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=27190, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=483, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28842, PETRI_PLACES=197, PETRI_TRANSITIONS=1202} [2023-08-26 20:11:50,653 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 143 predicate places. [2023-08-26 20:11:50,654 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 1202 transitions, 28842 flow [2023-08-26 20:11:50,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:50,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:11:50,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:11:50,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-08-26 20:11:50,654 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:11:50,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:11:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2026740346, now seen corresponding path program 1 times [2023-08-26 20:11:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:11:50,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448077006] [2023-08-26 20:11:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:11:50,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:11:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:11:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 20:11:50,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:11:50,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448077006] [2023-08-26 20:11:50,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448077006] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:11:50,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214437558] [2023-08-26 20:11:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:11:50,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:11:50,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:11:50,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:11:50,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 20:11:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:11:50,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 20:11:50,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:11:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:11:51,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:11:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:11:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214437558] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:11:51,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:11:51,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-08-26 20:11:51,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175059417] [2023-08-26 20:11:51,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:11:51,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 20:11:51,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:11:51,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 20:11:51,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 20:11:51,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 257 [2023-08-26 20:11:51,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1202 transitions, 28842 flow. Second operand has 8 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:11:51,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:11:51,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 257 [2023-08-26 20:11:51,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:12:05,695 INFO L124 PetriNetUnfolderBase]: 42175/56657 cut-off events. [2023-08-26 20:12:05,695 INFO L125 PetriNetUnfolderBase]: For 1707111/1719914 co-relation queries the response was YES. [2023-08-26 20:12:06,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476904 conditions, 56657 events. 42175/56657 cut-off events. For 1707111/1719914 co-relation queries the response was YES. Maximal size of possible extension queue 2664. Compared 338993 event pairs, 2879 based on Foata normal form. 9040/64668 useless extension candidates. Maximal degree in co-relation 476828. Up to 32894 conditions per place. [2023-08-26 20:12:06,506 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 843 selfloop transitions, 883 changer transitions 8/1834 dead transitions. [2023-08-26 20:12:06,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 1834 transitions, 46101 flow [2023-08-26 20:12:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 20:12:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 20:12:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1107 transitions. [2023-08-26 20:12:06,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5384241245136187 [2023-08-26 20:12:06,508 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1107 transitions. [2023-08-26 20:12:06,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1107 transitions. [2023-08-26 20:12:06,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:12:06,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1107 transitions. [2023-08-26 20:12:06,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.375) internal successors, (1107), 8 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:12:06,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:12:06,511 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:12:06,511 INFO L175 Difference]: Start difference. First operand has 197 places, 1202 transitions, 28842 flow. Second operand 8 states and 1107 transitions. [2023-08-26 20:12:06,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 1834 transitions, 46101 flow [2023-08-26 20:12:27,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1834 transitions, 41182 flow, removed 661 selfloop flow, removed 10 redundant places. [2023-08-26 20:12:27,033 INFO L231 Difference]: Finished difference. Result has 197 places, 1680 transitions, 40446 flow [2023-08-26 20:12:27,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=18360, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=40446, PETRI_PLACES=197, PETRI_TRANSITIONS=1680} [2023-08-26 20:12:27,034 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 143 predicate places. [2023-08-26 20:12:27,034 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 1680 transitions, 40446 flow [2023-08-26 20:12:27,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:12:27,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:12:27,034 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:12:27,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 20:12:27,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2023-08-26 20:12:27,235 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:12:27,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:12:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash -698767359, now seen corresponding path program 2 times [2023-08-26 20:12:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:12:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085439077] [2023-08-26 20:12:27,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:12:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:12:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:12:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:12:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:12:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085439077] [2023-08-26 20:12:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085439077] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:12:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190785730] [2023-08-26 20:12:27,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 20:12:27,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:12:27,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:12:27,313 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:12:27,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 20:12:27,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 20:12:27,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:12:27,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 20:12:27,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:12:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:12:27,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:12:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:12:27,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190785730] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:12:27,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:12:27,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-08-26 20:12:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453668084] [2023-08-26 20:12:27,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:12:27,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 20:12:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:12:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 20:12:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-26 20:12:27,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:12:27,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1680 transitions, 40446 flow. Second operand has 12 states, 12 states have (on average 108.58333333333333) internal successors, (1303), 12 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:12:27,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:12:27,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:12:27,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:12:48,342 INFO L124 PetriNetUnfolderBase]: 56427/74385 cut-off events. [2023-08-26 20:12:48,342 INFO L125 PetriNetUnfolderBase]: For 1846553/1856795 co-relation queries the response was YES. [2023-08-26 20:12:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617518 conditions, 74385 events. 56427/74385 cut-off events. For 1846553/1856795 co-relation queries the response was YES. Maximal size of possible extension queue 3326. Compared 435037 event pairs, 6160 based on Foata normal form. 6413/80123 useless extension candidates. Maximal degree in co-relation 617445. Up to 41391 conditions per place. [2023-08-26 20:12:49,413 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 2712 selfloop transitions, 400 changer transitions 21/3189 dead transitions. [2023-08-26 20:12:49,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 3189 transitions, 78343 flow [2023-08-26 20:12:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 20:12:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 20:12:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1508 transitions. [2023-08-26 20:12:49,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45136186770428016 [2023-08-26 20:12:49,415 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1508 transitions. [2023-08-26 20:12:49,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1508 transitions. [2023-08-26 20:12:49,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:12:49,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1508 transitions. [2023-08-26 20:12:49,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:12:49,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 257.0) internal successors, (3598), 14 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:12:49,420 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 257.0) internal successors, (3598), 14 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:12:49,420 INFO L175 Difference]: Start difference. First operand has 197 places, 1680 transitions, 40446 flow. Second operand 13 states and 1508 transitions. [2023-08-26 20:12:49,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 3189 transitions, 78343 flow [2023-08-26 20:13:18,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 3189 transitions, 74371 flow, removed 1986 selfloop flow, removed 0 redundant places. [2023-08-26 20:13:18,680 INFO L231 Difference]: Finished difference. Result has 215 places, 1794 transitions, 40961 flow [2023-08-26 20:13:18,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=38644, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=40961, PETRI_PLACES=215, PETRI_TRANSITIONS=1794} [2023-08-26 20:13:18,681 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 161 predicate places. [2023-08-26 20:13:18,681 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 1794 transitions, 40961 flow [2023-08-26 20:13:18,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.58333333333333) internal successors, (1303), 12 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:13:18,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:13:18,682 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:13:18,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 20:13:18,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2023-08-26 20:13:18,883 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:13:18,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:13:18,883 INFO L85 PathProgramCache]: Analyzing trace with hash 77298131, now seen corresponding path program 3 times [2023-08-26 20:13:18,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:13:18,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193801660] [2023-08-26 20:13:18,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:13:18,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:13:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:13:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:13:18,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:13:18,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193801660] [2023-08-26 20:13:18,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193801660] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:13:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001009623] [2023-08-26 20:13:18,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 20:13:18,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:13:18,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:13:18,957 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:13:18,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 20:13:19,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 20:13:19,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:13:19,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 20:13:19,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:13:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:13:19,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:13:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 20:13:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001009623] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:13:19,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:13:19,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-08-26 20:13:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650988664] [2023-08-26 20:13:19,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:13:19,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 20:13:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:13:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 20:13:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-08-26 20:13:19,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 257 [2023-08-26 20:13:19,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 1794 transitions, 40961 flow. Second operand has 12 states, 12 states have (on average 104.91666666666667) internal successors, (1259), 12 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:13:19,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:13:19,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 257 [2023-08-26 20:13:19,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 20:13:58,446 INFO L124 PetriNetUnfolderBase]: 99039/130404 cut-off events. [2023-08-26 20:13:58,447 INFO L125 PetriNetUnfolderBase]: For 2938450/2944296 co-relation queries the response was YES. [2023-08-26 20:14:00,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090484 conditions, 130404 events. 99039/130404 cut-off events. For 2938450/2944296 co-relation queries the response was YES. Maximal size of possible extension queue 5513. Compared 802611 event pairs, 6209 based on Foata normal form. 7674/137489 useless extension candidates. Maximal degree in co-relation 1090404. Up to 36897 conditions per place. [2023-08-26 20:14:00,767 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 3791 selfloop transitions, 700 changer transitions 9/4544 dead transitions. [2023-08-26 20:14:00,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 4544 transitions, 105894 flow [2023-08-26 20:14:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 20:14:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-26 20:14:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2505 transitions. [2023-08-26 20:14:00,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4430491687301026 [2023-08-26 20:14:00,770 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2505 transitions. [2023-08-26 20:14:00,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2505 transitions. [2023-08-26 20:14:00,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 20:14:00,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2505 transitions. [2023-08-26 20:14:00,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 113.86363636363636) internal successors, (2505), 22 states have internal predecessors, (2505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:14:00,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 257.0) internal successors, (5911), 23 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:14:00,777 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 257.0) internal successors, (5911), 23 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:14:00,777 INFO L175 Difference]: Start difference. First operand has 215 places, 1794 transitions, 40961 flow. Second operand 22 states and 2505 transitions. [2023-08-26 20:14:00,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 4544 transitions, 105894 flow [2023-08-26 20:15:52,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 4544 transitions, 104196 flow, removed 350 selfloop flow, removed 6 redundant places. [2023-08-26 20:15:52,585 INFO L231 Difference]: Finished difference. Result has 249 places, 2280 transitions, 53999 flow [2023-08-26 20:15:52,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=40099, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=53999, PETRI_PLACES=249, PETRI_TRANSITIONS=2280} [2023-08-26 20:15:52,586 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 195 predicate places. [2023-08-26 20:15:52,586 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 2280 transitions, 53999 flow [2023-08-26 20:15:52,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 104.91666666666667) internal successors, (1259), 12 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:15:52,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 20:15:52,587 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 20:15:52,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-26 20:15:52,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2023-08-26 20:15:52,787 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-08-26 20:15:52,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 20:15:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1974163244, now seen corresponding path program 4 times [2023-08-26 20:15:52,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 20:15:52,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472534469] [2023-08-26 20:15:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 20:15:52,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 20:15:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 20:15:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:15:52,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 20:15:52,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472534469] [2023-08-26 20:15:52,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472534469] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 20:15:52,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710256433] [2023-08-26 20:15:52,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 20:15:52,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 20:15:52,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 20:15:52,865 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 20:15:52,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 20:15:53,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 20:15:53,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 20:15:53,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 20:15:53,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 20:15:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:15:53,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 20:15:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 20:15:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710256433] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 20:15:53,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 20:15:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-08-26 20:15:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879252178] [2023-08-26 20:15:53,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 20:15:53,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 20:15:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 20:15:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 20:15:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-26 20:15:53,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 20:15:53,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 2280 transitions, 53999 flow. Second operand has 11 states, 11 states have (on average 108.18181818181819) internal successors, (1190), 11 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 20:15:53,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 20:15:53,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 20:15:53,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand