/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 -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/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 13:24:48,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 13:24:48,207 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 13:24:48,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 13:24:48,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 13:24:48,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 13:24:48,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 13:24:48,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 13:24:48,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 13:24:48,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 13:24:48,243 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 13:24:48,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 13:24:48,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 13:24:48,244 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 13:24:48,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 13:24:48,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 13:24:48,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 13:24:48,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 13:24:48,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 13:24:48,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 13:24:48,245 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 13:24:48,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 13:24:48,246 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 13:24:48,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 13:24:48,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 13:24:48,246 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 13:24:48,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 13:24:48,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 13:24:48,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 13:24:48,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 13:24:48,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 13:24:48,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 13:24:48,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 13:24:48,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 13:24:48,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 13:24:48,248 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.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 13:24:48,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 13:24:48,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 13:24:48,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 13:24:48,498 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 13:24:48,500 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 13:24:48,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-26 13:24:49,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 13:24:49,769 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 13:24:49,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-26 13:24:49,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e251cd422/d8760201da8d41aaa6af8ffb10203bb0/FLAGe2f9103ab [2023-08-26 13:24:49,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e251cd422/d8760201da8d41aaa6af8ffb10203bb0 [2023-08-26 13:24:49,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 13:24:49,796 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 13:24:49,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 13:24:49,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 13:24:49,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 13:24:49,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:49,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2856b9bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49, skipping insertion in model container [2023-08-26 13:24:49,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:49,829 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 13:24:49,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 13:24:49,954 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 13:24:49,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 13:24:49,979 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 13:24:49,979 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 13:24:49,984 INFO L206 MainTranslator]: Completed translation [2023-08-26 13:24:49,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49 WrapperNode [2023-08-26 13:24:49,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 13:24:49,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 13:24:49,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 13:24:49,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 13:24:49,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:49,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,021 INFO L138 Inliner]: procedures = 25, calls = 101, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 290 [2023-08-26 13:24:50,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 13:24:50,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 13:24:50,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 13:24:50,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 13:24:50,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 13:24:50,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 13:24:50,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 13:24:50,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 13:24:50,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (1/1) ... [2023-08-26 13:24:50,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 13:24:50,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:24:50,065 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 13:24:50,070 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 13:24:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 13:24:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 13:24:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 13:24:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 13:24:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 13:24:50,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 13:24:50,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 13:24:50,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 13:24:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 13:24:50,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 13:24:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 13:24:50,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 13:24:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 13:24:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-26 13:24:50,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-26 13:24:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-26 13:24:50,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-26 13:24:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 13:24:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 13:24:50,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 13:24:50,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 13:24:50,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 13:24:50,089 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 13:24:50,160 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 13:24:50,162 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 13:24:50,464 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 13:24:50,547 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 13:24:50,548 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 13:24:50,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:24:50 BoogieIcfgContainer [2023-08-26 13:24:50,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 13:24:50,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 13:24:50,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 13:24:50,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 13:24:50,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:24:49" (1/3) ... [2023-08-26 13:24:50,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f827150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:24:50, skipping insertion in model container [2023-08-26 13:24:50,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:24:49" (2/3) ... [2023-08-26 13:24:50,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f827150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:24:50, skipping insertion in model container [2023-08-26 13:24:50,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:24:50" (3/3) ... [2023-08-26 13:24:50,560 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-08-26 13:24:50,589 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 13:24:50,589 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-08-26 13:24:50,589 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 13:24:50,659 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-26 13:24:50,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 216 transitions, 480 flow [2023-08-26 13:24:50,747 INFO L124 PetriNetUnfolderBase]: 2/210 cut-off events. [2023-08-26 13:24:50,748 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 13:24:50,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 210 events. 2/210 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-08-26 13:24:50,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 216 transitions, 480 flow [2023-08-26 13:24:50,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 193 transitions, 422 flow [2023-08-26 13:24:50,757 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 13:24:50,772 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 193 transitions, 422 flow [2023-08-26 13:24:50,777 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 193 transitions, 422 flow [2023-08-26 13:24:50,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 193 transitions, 422 flow [2023-08-26 13:24:50,823 INFO L124 PetriNetUnfolderBase]: 2/193 cut-off events. [2023-08-26 13:24:50,823 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 13:24:50,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 193 events. 2/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 160 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-08-26 13:24:50,826 INFO L119 LiptonReduction]: Number of co-enabled transitions 3930 [2023-08-26 13:24:57,995 INFO L134 LiptonReduction]: Checked pairs total: 22343 [2023-08-26 13:24:57,995 INFO L136 LiptonReduction]: Total number of compositions: 165 [2023-08-26 13:24:58,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 13:24:58,010 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;@11b99e23, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 13:24:58,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-26 13:24:58,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 13:24:58,011 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 13:24:58,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 13:24:58,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:24:58,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 13:24:58,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:24:58,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:24:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash 837, now seen corresponding path program 1 times [2023-08-26 13:24:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:24:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352571412] [2023-08-26 13:24:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:24:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:24:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:24:58,082 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 13:24:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:24:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352571412] [2023-08-26 13:24:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352571412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:24:58,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:24:58,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 13:24:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186234510] [2023-08-26 13:24:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:24:58,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 13:24:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:24:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 13:24:58,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 13:24:58,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 381 [2023-08-26 13:24:58,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 74 transitions, 184 flow. Second operand has 2 states, 2 states have (on average 183.5) internal successors, (367), 2 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:24:58,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:24:58,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 381 [2023-08-26 13:24:58,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:05,671 INFO L124 PetriNetUnfolderBase]: 107865/140906 cut-off events. [2023-08-26 13:25:05,671 INFO L125 PetriNetUnfolderBase]: For 3860/3860 co-relation queries the response was YES. [2023-08-26 13:25:06,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280173 conditions, 140906 events. 107865/140906 cut-off events. For 3860/3860 co-relation queries the response was YES. Maximal size of possible extension queue 5193. Compared 894155 event pairs, 107865 based on Foata normal form. 0/126081 useless extension candidates. Maximal degree in co-relation 229646. Up to 135165 conditions per place. [2023-08-26 13:25:06,718 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 65 selfloop transitions, 0 changer transitions 0/72 dead transitions. [2023-08-26 13:25:06,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 310 flow [2023-08-26 13:25:06,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 13:25:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 13:25:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 433 transitions. [2023-08-26 13:25:06,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568241469816273 [2023-08-26 13:25:06,739 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 433 transitions. [2023-08-26 13:25:06,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 433 transitions. [2023-08-26 13:25:06,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:06,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 433 transitions. [2023-08-26 13:25:06,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 216.5) internal successors, (433), 2 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:06,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 381.0) internal successors, (1143), 3 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:06,748 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 381.0) internal successors, (1143), 3 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:06,749 INFO L175 Difference]: Start difference. First operand has 93 places, 74 transitions, 184 flow. Second operand 2 states and 433 transitions. [2023-08-26 13:25:06,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 310 flow [2023-08-26 13:25:06,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 286 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-26 13:25:06,981 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 156 flow [2023-08-26 13:25:06,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2023-08-26 13:25:06,987 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -13 predicate places. [2023-08-26 13:25:06,987 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 156 flow [2023-08-26 13:25:06,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 183.5) internal successors, (367), 2 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:06,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:06,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 13:25:06,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 13:25:06,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:06,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash 823722, now seen corresponding path program 1 times [2023-08-26 13:25:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:06,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675132766] [2023-08-26 13:25:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:06,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:07,483 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 13:25:07,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675132766] [2023-08-26 13:25:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675132766] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:07,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105255386] [2023-08-26 13:25:07,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:07,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:07,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 13:25:07,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:07,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:07,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 13:25:07,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:13,412 INFO L124 PetriNetUnfolderBase]: 104022/136033 cut-off events. [2023-08-26 13:25:13,413 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:25:13,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267694 conditions, 136033 events. 104022/136033 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5139. Compared 863481 event pairs, 104022 based on Foata normal form. 0/122236 useless extension candidates. Maximal degree in co-relation 267691. Up to 130293 conditions per place. [2023-08-26 13:25:14,243 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 62 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2023-08-26 13:25:14,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 278 flow [2023-08-26 13:25:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:25:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:25:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-08-26 13:25:14,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44006999125109364 [2023-08-26 13:25:14,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-08-26 13:25:14,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-08-26 13:25:14,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:14,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-08-26 13:25:14,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:14,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:14,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:14,250 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 156 flow. Second operand 3 states and 503 transitions. [2023-08-26 13:25:14,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 278 flow [2023-08-26 13:25:14,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 70 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 13:25:14,266 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 154 flow [2023-08-26 13:25:14,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2023-08-26 13:25:14,266 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -13 predicate places. [2023-08-26 13:25:14,267 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 154 flow [2023-08-26 13:25:14,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:14,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:14,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 13:25:14,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 13:25:14,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:14,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash 823721, now seen corresponding path program 1 times [2023-08-26 13:25:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:14,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706952541] [2023-08-26 13:25:14,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:14,367 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 13:25:14,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706952541] [2023-08-26 13:25:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706952541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233206679] [2023-08-26 13:25:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:14,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:14,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 13:25:14,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:14,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:14,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 13:25:14,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:19,853 INFO L124 PetriNetUnfolderBase]: 100179/131160 cut-off events. [2023-08-26 13:25:19,854 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:25:20,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257952 conditions, 131160 events. 100179/131160 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 833221 event pairs, 100179 based on Foata normal form. 0/118391 useless extension candidates. Maximal degree in co-relation 257948. Up to 125422 conditions per place. [2023-08-26 13:25:20,694 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 60 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2023-08-26 13:25:20,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 68 transitions, 272 flow [2023-08-26 13:25:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:25:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:25:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-26 13:25:20,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225721784776903 [2023-08-26 13:25:20,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-26 13:25:20,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-26 13:25:20,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:20,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-26 13:25:20,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:20,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:20,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:20,700 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 154 flow. Second operand 3 states and 483 transitions. [2023-08-26 13:25:20,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 68 transitions, 272 flow [2023-08-26 13:25:20,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 68 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:25:20,702 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 151 flow [2023-08-26 13:25:20,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2023-08-26 13:25:20,702 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -14 predicate places. [2023-08-26 13:25:20,702 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 151 flow [2023-08-26 13:25:20,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:20,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:20,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 13:25:20,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 13:25:20,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:20,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 791617946, now seen corresponding path program 1 times [2023-08-26 13:25:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365032098] [2023-08-26 13:25:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:20,777 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 13:25:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:20,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365032098] [2023-08-26 13:25:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365032098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:20,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:20,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:20,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659821661] [2023-08-26 13:25:20,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:20,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:20,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:20,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 13:25:20,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:20,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:20,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 13:25:20,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:26,418 INFO L124 PetriNetUnfolderBase]: 99387/130092 cut-off events. [2023-08-26 13:25:26,419 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:25:26,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255821 conditions, 130092 events. 99387/130092 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 826302 event pairs, 99387 based on Foata normal form. 0/117597 useless extension candidates. Maximal degree in co-relation 255817. Up to 124358 conditions per place. [2023-08-26 13:25:27,094 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 58 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-26 13:25:27,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 265 flow [2023-08-26 13:25:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:25:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:25:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-08-26 13:25:27,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42082239720035 [2023-08-26 13:25:27,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-08-26 13:25:27,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-08-26 13:25:27,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:27,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-08-26 13:25:27,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:27,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:27,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:27,100 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 151 flow. Second operand 3 states and 481 transitions. [2023-08-26 13:25:27,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 265 flow [2023-08-26 13:25:27,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:25:27,101 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 148 flow [2023-08-26 13:25:27,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2023-08-26 13:25:27,102 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -15 predicate places. [2023-08-26 13:25:27,102 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 148 flow [2023-08-26 13:25:27,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:27,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:27,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 13:25:27,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 13:25:27,103 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:27,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 791617945, now seen corresponding path program 1 times [2023-08-26 13:25:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:27,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873366946] [2023-08-26 13:25:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:27,191 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 13:25:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873366946] [2023-08-26 13:25:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873366946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:27,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:27,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:27,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059032967] [2023-08-26 13:25:27,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:27,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:27,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:27,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:27,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:27,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 13:25:27,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:27,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:27,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 13:25:27,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:32,869 INFO L124 PetriNetUnfolderBase]: 98595/129024 cut-off events. [2023-08-26 13:25:32,869 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:25:33,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253690 conditions, 129024 events. 98595/129024 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 819580 event pairs, 98595 based on Foata normal form. 0/116803 useless extension candidates. Maximal degree in co-relation 253686. Up to 123294 conditions per place. [2023-08-26 13:25:33,661 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 56 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-26 13:25:33,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 64 transitions, 258 flow [2023-08-26 13:25:33,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:25:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:25:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-26 13:25:33,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4348206474190726 [2023-08-26 13:25:33,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-26 13:25:33,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-26 13:25:33,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:33,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-26 13:25:33,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:33,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:33,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:33,666 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 148 flow. Second operand 3 states and 497 transitions. [2023-08-26 13:25:33,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 64 transitions, 258 flow [2023-08-26 13:25:33,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 64 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:25:33,668 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 145 flow [2023-08-26 13:25:33,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2023-08-26 13:25:33,668 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2023-08-26 13:25:33,669 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 145 flow [2023-08-26 13:25:33,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:33,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:33,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:25:33,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 13:25:33,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:33,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash 535656059, now seen corresponding path program 1 times [2023-08-26 13:25:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757630038] [2023-08-26 13:25:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:33,747 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 13:25:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757630038] [2023-08-26 13:25:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757630038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122572109] [2023-08-26 13:25:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:33,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:33,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:33,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 13:25:33,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:33,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:33,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 13:25:33,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:39,137 INFO L124 PetriNetUnfolderBase]: 98307/128592 cut-off events. [2023-08-26 13:25:39,137 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:25:39,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252843 conditions, 128592 events. 98307/128592 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 816758 event pairs, 98307 based on Foata normal form. 0/116503 useless extension candidates. Maximal degree in co-relation 252839. Up to 122878 conditions per place. [2023-08-26 13:25:39,762 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 54 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-08-26 13:25:39,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 251 flow [2023-08-26 13:25:39,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:25:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:25:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-08-26 13:25:39,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41732283464566927 [2023-08-26 13:25:39,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-08-26 13:25:39,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-08-26 13:25:39,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:39,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-08-26 13:25:39,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:39,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:39,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:39,767 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 145 flow. Second operand 3 states and 477 transitions. [2023-08-26 13:25:39,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 251 flow [2023-08-26 13:25:39,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 62 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:25:39,769 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 142 flow [2023-08-26 13:25:39,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2023-08-26 13:25:39,770 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -17 predicate places. [2023-08-26 13:25:39,770 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 142 flow [2023-08-26 13:25:39,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:39,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:39,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:25:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 13:25:39,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:39,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash 535656061, now seen corresponding path program 1 times [2023-08-26 13:25:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34358378] [2023-08-26 13:25:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:39,837 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 13:25:39,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:39,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34358378] [2023-08-26 13:25:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34358378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575452105] [2023-08-26 13:25:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:39,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:39,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 13:25:39,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:39,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:39,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 13:25:39,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:45,220 INFO L124 PetriNetUnfolderBase]: 98019/128160 cut-off events. [2023-08-26 13:25:45,220 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:25:45,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251996 conditions, 128160 events. 98019/128160 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 813517 event pairs, 98019 based on Foata normal form. 0/116203 useless extension candidates. Maximal degree in co-relation 251992. Up to 122462 conditions per place. [2023-08-26 13:25:45,874 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 52 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2023-08-26 13:25:45,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 60 transitions, 244 flow [2023-08-26 13:25:45,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:25:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:25:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-08-26 13:25:45,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43132108486439197 [2023-08-26 13:25:45,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-08-26 13:25:45,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-08-26 13:25:45,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:45,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-08-26 13:25:45,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:45,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:45,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:45,879 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 142 flow. Second operand 3 states and 493 transitions. [2023-08-26 13:25:45,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 60 transitions, 244 flow [2023-08-26 13:25:45,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 60 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:25:45,881 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 139 flow [2023-08-26 13:25:45,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2023-08-26 13:25:45,882 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -18 predicate places. [2023-08-26 13:25:45,882 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 139 flow [2023-08-26 13:25:45,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:45,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:45,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:25:45,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 13:25:45,882 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:45,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash -630581640, now seen corresponding path program 1 times [2023-08-26 13:25:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116078803] [2023-08-26 13:25:45,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:45,923 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 13:25:45,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116078803] [2023-08-26 13:25:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116078803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:45,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469107823] [2023-08-26 13:25:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:45,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:45,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 13:25:45,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:45,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:45,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 13:25:45,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:51,466 INFO L124 PetriNetUnfolderBase]: 97227/127032 cut-off events. [2023-08-26 13:25:51,467 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:25:51,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249805 conditions, 127032 events. 97227/127032 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5095. Compared 805732 event pairs, 97227 based on Foata normal form. 0/115363 useless extension candidates. Maximal degree in co-relation 249801. Up to 121398 conditions per place. [2023-08-26 13:25:52,356 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 50 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-08-26 13:25:52,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 58 transitions, 237 flow [2023-08-26 13:25:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:25:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:25:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-08-26 13:25:52,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4138232720909886 [2023-08-26 13:25:52,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-08-26 13:25:52,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-08-26 13:25:52,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:52,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-08-26 13:25:52,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:52,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:52,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:52,360 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 139 flow. Second operand 3 states and 473 transitions. [2023-08-26 13:25:52,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 58 transitions, 237 flow [2023-08-26 13:25:52,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:25:52,361 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 136 flow [2023-08-26 13:25:52,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2023-08-26 13:25:52,362 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -19 predicate places. [2023-08-26 13:25:52,362 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 136 flow [2023-08-26 13:25:52,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:52,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:52,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:25:52,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 13:25:52,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:52,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash -630581639, now seen corresponding path program 1 times [2023-08-26 13:25:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181041373] [2023-08-26 13:25:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:52,416 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 13:25:52,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181041373] [2023-08-26 13:25:52,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181041373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:52,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:52,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:52,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367624651] [2023-08-26 13:25:52,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:52,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:52,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 13:25:52,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:52,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:52,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 13:25:52,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:25:57,728 INFO L124 PetriNetUnfolderBase]: 96435/125904 cut-off events. [2023-08-26 13:25:57,728 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:25:58,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247614 conditions, 125904 events. 96435/125904 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5086. Compared 796846 event pairs, 96435 based on Foata normal form. 0/114523 useless extension candidates. Maximal degree in co-relation 247610. Up to 120334 conditions per place. [2023-08-26 13:25:58,682 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 48 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-08-26 13:25:58,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 56 transitions, 230 flow [2023-08-26 13:25:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:25:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:25:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2023-08-26 13:25:58,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42782152230971127 [2023-08-26 13:25:58,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2023-08-26 13:25:58,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2023-08-26 13:25:58,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:25:58,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2023-08-26 13:25:58,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:58,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:58,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:58,687 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 136 flow. Second operand 3 states and 489 transitions. [2023-08-26 13:25:58,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 56 transitions, 230 flow [2023-08-26 13:25:58,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:25:58,688 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 133 flow [2023-08-26 13:25:58,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-26 13:25:58,688 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -20 predicate places. [2023-08-26 13:25:58,689 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 133 flow [2023-08-26 13:25:58,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:25:58,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:25:58,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:25:58,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 13:25:58,689 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:25:58,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:25:58,689 INFO L85 PathProgramCache]: Analyzing trace with hash -398547804, now seen corresponding path program 1 times [2023-08-26 13:25:58,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:25:58,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669463577] [2023-08-26 13:25:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:25:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:25:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:25:58,742 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 13:25:58,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:25:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669463577] [2023-08-26 13:25:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669463577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:25:58,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:25:58,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:25:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956555912] [2023-08-26 13:25:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:25:58,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:25:58,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:25:58,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:25:58,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:25:58,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 13:25:58,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 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 13:25:58,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:25:58,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 13:25:58,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:26:04,148 INFO L124 PetriNetUnfolderBase]: 92592/120777 cut-off events. [2023-08-26 13:26:04,148 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:26:04,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237617 conditions, 120777 events. 92592/120777 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 4899. Compared 759595 event pairs, 92592 based on Foata normal form. 0/110424 useless extension candidates. Maximal degree in co-relation 237613. Up to 115463 conditions per place. [2023-08-26 13:26:05,083 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 46 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-08-26 13:26:05,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 54 transitions, 223 flow [2023-08-26 13:26:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:26:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:26:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-08-26 13:26:05,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42607174103237094 [2023-08-26 13:26:05,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-08-26 13:26:05,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-08-26 13:26:05,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:26:05,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-08-26 13:26:05,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:05,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:05,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:05,087 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 133 flow. Second operand 3 states and 487 transitions. [2023-08-26 13:26:05,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 54 transitions, 223 flow [2023-08-26 13:26:05,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:26:05,089 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 130 flow [2023-08-26 13:26:05,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-08-26 13:26:05,091 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -21 predicate places. [2023-08-26 13:26:05,091 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 130 flow [2023-08-26 13:26:05,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 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 13:26:05,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:26:05,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:26:05,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 13:26:05,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:26:05,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:26:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash -398547803, now seen corresponding path program 1 times [2023-08-26 13:26:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:26:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443704529] [2023-08-26 13:26:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:26:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:26:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:26:05,130 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 13:26:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:26:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443704529] [2023-08-26 13:26:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443704529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:26:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:26:05,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:26:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860696630] [2023-08-26 13:26:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:26:05,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:26:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:26:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:26:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:26:05,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 13:26:05,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:05,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:26:05,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 13:26:05,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:26:10,159 INFO L124 PetriNetUnfolderBase]: 88749/115650 cut-off events. [2023-08-26 13:26:10,160 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:26:10,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227620 conditions, 115650 events. 88749/115650 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 4735. Compared 722087 event pairs, 88749 based on Foata normal form. 0/106325 useless extension candidates. Maximal degree in co-relation 227616. Up to 110592 conditions per place. [2023-08-26 13:26:10,910 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 44 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-08-26 13:26:10,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 52 transitions, 216 flow [2023-08-26 13:26:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:26:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:26:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-26 13:26:10,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40857392825896766 [2023-08-26 13:26:10,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-26 13:26:10,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-26 13:26:10,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:26:10,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-26 13:26:10,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:10,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:10,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:10,915 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 130 flow. Second operand 3 states and 467 transitions. [2023-08-26 13:26:10,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 52 transitions, 216 flow [2023-08-26 13:26:10,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 52 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:26:10,917 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 127 flow [2023-08-26 13:26:10,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2023-08-26 13:26:10,917 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -22 predicate places. [2023-08-26 13:26:10,917 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 127 flow [2023-08-26 13:26:10,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:10,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:26:10,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:26:10,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 13:26:10,918 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:26:10,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:26:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash -752328124, now seen corresponding path program 1 times [2023-08-26 13:26:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:26:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168868783] [2023-08-26 13:26:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:26:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:26:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:26:11,365 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 13:26:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:26:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168868783] [2023-08-26 13:26:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168868783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:26:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:26:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 13:26:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162902531] [2023-08-26 13:26:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:26:11,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 13:26:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:26:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 13:26:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 13:26:11,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 381 [2023-08-26 13:26:11,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:11,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:26:11,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 381 [2023-08-26 13:26:11,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:26:15,446 INFO L124 PetriNetUnfolderBase]: 70317/92098 cut-off events. [2023-08-26 13:26:15,446 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:26:15,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181541 conditions, 92098 events. 70317/92098 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 3664. Compared 566417 event pairs, 70317 based on Foata normal form. 0/87125 useless extension candidates. Maximal degree in co-relation 181537. Up to 88064 conditions per place. [2023-08-26 13:26:15,953 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 43 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-26 13:26:15,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 51 transitions, 213 flow [2023-08-26 13:26:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:26:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:26:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-26 13:26:15,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3805774278215223 [2023-08-26 13:26:15,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-26 13:26:15,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-26 13:26:15,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:26:15,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-26 13:26:15,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:15,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:15,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:15,957 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 127 flow. Second operand 3 states and 435 transitions. [2023-08-26 13:26:15,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 51 transitions, 213 flow [2023-08-26 13:26:15,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:26:15,959 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 126 flow [2023-08-26 13:26:15,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-26 13:26:15,959 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -22 predicate places. [2023-08-26 13:26:15,959 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 126 flow [2023-08-26 13:26:15,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:15,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:26:15,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:26:15,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 13:26:15,960 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:26:15,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:26:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash -752328125, now seen corresponding path program 1 times [2023-08-26 13:26:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:26:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596890614] [2023-08-26 13:26:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:26:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:26:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:26:16,088 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 13:26:16,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:26:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596890614] [2023-08-26 13:26:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596890614] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:26:16,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:26:16,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 13:26:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484326167] [2023-08-26 13:26:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:26:16,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 13:26:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:26:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 13:26:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-08-26 13:26:16,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 381 [2023-08-26 13:26:16,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 126.625) internal successors, (1013), 8 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:16,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:26:16,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 381 [2023-08-26 13:26:16,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:26:19,343 INFO L124 PetriNetUnfolderBase]: 51885/68546 cut-off events. [2023-08-26 13:26:19,344 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 13:26:19,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135462 conditions, 68546 events. 51885/68546 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 2614. Compared 415083 event pairs, 51885 based on Foata normal form. 0/67925 useless extension candidates. Maximal degree in co-relation 135458. Up to 65536 conditions per place. [2023-08-26 13:26:19,715 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-08-26 13:26:19,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 50 transitions, 210 flow [2023-08-26 13:26:19,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:26:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:26:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 13:26:19,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3665791776027997 [2023-08-26 13:26:19,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 13:26:19,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 13:26:19,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:26:19,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 13:26:19,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:19,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:19,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:19,718 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 126 flow. Second operand 3 states and 419 transitions. [2023-08-26 13:26:19,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 50 transitions, 210 flow [2023-08-26 13:26:19,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 50 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:26:19,719 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 125 flow [2023-08-26 13:26:19,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2023-08-26 13:26:19,720 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -22 predicate places. [2023-08-26 13:26:19,720 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 125 flow [2023-08-26 13:26:19,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.625) internal successors, (1013), 8 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:19,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:26:19,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:26:19,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 13:26:19,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:26:19,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:26:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1435640807, now seen corresponding path program 1 times [2023-08-26 13:26:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:26:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262887028] [2023-08-26 13:26:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:26:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:26:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:26:20,538 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 13:26:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:26:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262887028] [2023-08-26 13:26:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262887028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:26:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:26:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 13:26:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424061538] [2023-08-26 13:26:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:26:20,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 13:26:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:26:20,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 13:26:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 13:26:20,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 381 [2023-08-26 13:26:20,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:20,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:26:20,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 381 [2023-08-26 13:26:20,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:26:43,728 INFO L124 PetriNetUnfolderBase]: 421515/526270 cut-off events. [2023-08-26 13:26:43,728 INFO L125 PetriNetUnfolderBase]: For 6447/6447 co-relation queries the response was YES. [2023-08-26 13:26:45,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060543 conditions, 526270 events. 421515/526270 cut-off events. For 6447/6447 co-relation queries the response was YES. Maximal size of possible extension queue 9974. Compared 3009141 event pairs, 134644 based on Foata normal form. 2/526272 useless extension candidates. Maximal degree in co-relation 1060539. Up to 234423 conditions per place. [2023-08-26 13:26:46,428 INFO L140 encePairwiseOnDemand]: 372/381 looper letters, 124 selfloop transitions, 13 changer transitions 30/167 dead transitions. [2023-08-26 13:26:46,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 167 transitions, 718 flow [2023-08-26 13:26:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 13:26:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 13:26:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1019 transitions. [2023-08-26 13:26:46,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5349081364829397 [2023-08-26 13:26:46,446 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1019 transitions. [2023-08-26 13:26:46,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1019 transitions. [2023-08-26 13:26:46,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:26:46,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1019 transitions. [2023-08-26 13:26:46,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 203.8) internal successors, (1019), 5 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:46,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 381.0) internal successors, (2286), 6 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:46,450 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 381.0) internal successors, (2286), 6 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:46,450 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 125 flow. Second operand 5 states and 1019 transitions. [2023-08-26 13:26:46,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 167 transitions, 718 flow [2023-08-26 13:26:46,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 167 transitions, 717 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:26:46,452 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 218 flow [2023-08-26 13:26:46,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2023-08-26 13:26:46,453 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2023-08-26 13:26:46,453 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 218 flow [2023-08-26 13:26:46,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:46,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:26:46,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:26:46,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 13:26:46,453 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:26:46,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:26:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 420462633, now seen corresponding path program 2 times [2023-08-26 13:26:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:26:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001332106] [2023-08-26 13:26:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:26:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:26:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:26:46,694 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 13:26:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:26:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001332106] [2023-08-26 13:26:46,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001332106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:26:46,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:26:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 13:26:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676528924] [2023-08-26 13:26:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:26:46,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 13:26:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:26:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 13:26:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-26 13:26:46,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 13:26:46,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 218 flow. Second operand has 10 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:26:46,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:26:46,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 13:26:46,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:27:07,028 INFO L124 PetriNetUnfolderBase]: 223021/310037 cut-off events. [2023-08-26 13:27:07,028 INFO L125 PetriNetUnfolderBase]: For 49744/88028 co-relation queries the response was YES. [2023-08-26 13:27:08,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694014 conditions, 310037 events. 223021/310037 cut-off events. For 49744/88028 co-relation queries the response was YES. Maximal size of possible extension queue 13329. Compared 2504869 event pairs, 44782 based on Foata normal form. 326/283934 useless extension candidates. Maximal degree in co-relation 694007. Up to 73527 conditions per place. [2023-08-26 13:27:09,971 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 225 selfloop transitions, 117 changer transitions 0/360 dead transitions. [2023-08-26 13:27:09,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 360 transitions, 1548 flow [2023-08-26 13:27:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 13:27:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 13:27:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2954 transitions. [2023-08-26 13:27:09,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168853893263342 [2023-08-26 13:27:09,976 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2954 transitions. [2023-08-26 13:27:09,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2954 transitions. [2023-08-26 13:27:09,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:27:09,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2954 transitions. [2023-08-26 13:27:09,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 196.93333333333334) internal successors, (2954), 15 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:09,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 381.0) internal successors, (6096), 16 states have internal predecessors, (6096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:09,986 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 381.0) internal successors, (6096), 16 states have internal predecessors, (6096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:09,986 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 218 flow. Second operand 15 states and 2954 transitions. [2023-08-26 13:27:09,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 360 transitions, 1548 flow [2023-08-26 13:27:10,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 360 transitions, 1532 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 13:27:10,013 INFO L231 Difference]: Finished difference. Result has 91 places, 186 transitions, 744 flow [2023-08-26 13:27:10,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=744, PETRI_PLACES=91, PETRI_TRANSITIONS=186} [2023-08-26 13:27:10,014 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -2 predicate places. [2023-08-26 13:27:10,014 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 186 transitions, 744 flow [2023-08-26 13:27:10,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:10,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:27:10,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:27:10,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 13:27:10,015 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:27:10,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:27:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash 305099423, now seen corresponding path program 3 times [2023-08-26 13:27:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:27:10,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229458498] [2023-08-26 13:27:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:27:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:27:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:27:10,214 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 13:27:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:27:10,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229458498] [2023-08-26 13:27:10,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229458498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:27:10,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:27:10,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 13:27:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553943283] [2023-08-26 13:27:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:27:10,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 13:27:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:27:10,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 13:27:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 13:27:10,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 13:27:10,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 186 transitions, 744 flow. Second operand has 7 states, 7 states have (on average 180.14285714285714) internal successors, (1261), 7 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:10,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:27:10,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 13:27:10,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:27:29,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][249], [Black: 325#(and (= ~s~0 ~m1~0) (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 84#L150true, Black: 327#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 8#thread5EXITtrue, 205#L112true, 122#thread3EXITtrue, 70#L181-4true, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 306#true, Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 198#thread1EXITtrue]) [2023-08-26 13:27:29,388 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 13:27:29,388 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:27:29,388 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:27:29,388 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:27:29,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][249], [Black: 325#(and (= ~s~0 ~m1~0) (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 102#L182-1true, 84#L150true, Black: 327#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 8#thread5EXITtrue, 205#L112true, 122#thread3EXITtrue, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 306#true, Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 198#thread1EXITtrue]) [2023-08-26 13:27:29,685 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-26 13:27:29,685 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:27:29,685 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:27:29,685 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:27:30,442 INFO L124 PetriNetUnfolderBase]: 233473/321767 cut-off events. [2023-08-26 13:27:30,443 INFO L125 PetriNetUnfolderBase]: For 151896/199583 co-relation queries the response was YES. [2023-08-26 13:27:32,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869036 conditions, 321767 events. 233473/321767 cut-off events. For 151896/199583 co-relation queries the response was YES. Maximal size of possible extension queue 13460. Compared 2523286 event pairs, 59884 based on Foata normal form. 4528/303148 useless extension candidates. Maximal degree in co-relation 869028. Up to 240308 conditions per place. [2023-08-26 13:27:33,436 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 236 selfloop transitions, 119 changer transitions 0/373 dead transitions. [2023-08-26 13:27:33,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 373 transitions, 2081 flow [2023-08-26 13:27:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 13:27:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 13:27:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1752 transitions. [2023-08-26 13:27:33,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510936132983377 [2023-08-26 13:27:33,439 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1752 transitions. [2023-08-26 13:27:33,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1752 transitions. [2023-08-26 13:27:33,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:27:33,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1752 transitions. [2023-08-26 13:27:33,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.66666666666666) internal successors, (1752), 9 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:33,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 381.0) internal successors, (3810), 10 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:33,445 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 381.0) internal successors, (3810), 10 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:33,445 INFO L175 Difference]: Start difference. First operand has 91 places, 186 transitions, 744 flow. Second operand 9 states and 1752 transitions. [2023-08-26 13:27:33,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 373 transitions, 2081 flow [2023-08-26 13:27:34,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 373 transitions, 2081 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 13:27:34,055 INFO L231 Difference]: Finished difference. Result has 103 places, 254 transitions, 1432 flow [2023-08-26 13:27:34,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1432, PETRI_PLACES=103, PETRI_TRANSITIONS=254} [2023-08-26 13:27:34,056 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 10 predicate places. [2023-08-26 13:27:34,056 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 254 transitions, 1432 flow [2023-08-26 13:27:34,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 180.14285714285714) internal successors, (1261), 7 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:27:34,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:27:34,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:27:34,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 13:27:34,056 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:27:34,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:27:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash -54328669, now seen corresponding path program 4 times [2023-08-26 13:27:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:27:34,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170015613] [2023-08-26 13:27:34,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:27:34,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:27:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:27:34,266 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 13:27:34,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:27:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170015613] [2023-08-26 13:27:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170015613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:27:34,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:27:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 13:27:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117230284] [2023-08-26 13:27:34,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:27:34,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 13:27:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:27:34,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 13:27:34,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 13:27:34,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 13:27:34,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 254 transitions, 1432 flow. Second operand has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 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 13:27:34,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:27:34,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 13:27:34,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:27:56,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L112-->thread4EXIT: Formula: (and (= (+ v_~s~0_131 1) v_~s~0_130) (= |v_thread4Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread4Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_131} OutVars{thread4Thread1of1ForFork1_#res#1.base=|v_thread4Thread1of1ForFork1_#res#1.base_7|, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_#res#1.offset=|v_thread4Thread1of1ForFork1_#res#1.offset_7|, ~s~0=v_~s~0_130} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_#res#1.base, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_#res#1.offset, ~s~0][224], [Black: 325#(and (= ~s~0 ~m1~0) (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 349#true, 84#L150true, Black: 327#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 174#L74true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 8#thread5EXITtrue, 122#thread3EXITtrue, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 17#L182-2true, 310#(<= (+ ~s~0 1) ~t~0), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)]) [2023-08-26 13:27:56,926 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-26 13:27:56,926 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 13:27:56,926 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 13:27:56,926 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 13:27:57,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L112-->thread4EXIT: Formula: (and (= (+ v_~s~0_131 1) v_~s~0_130) (= |v_thread4Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread4Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_131} OutVars{thread4Thread1of1ForFork1_#res#1.base=|v_thread4Thread1of1ForFork1_#res#1.base_7|, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_#res#1.offset=|v_thread4Thread1of1ForFork1_#res#1.offset_7|, ~s~0=v_~s~0_130} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_#res#1.base, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_#res#1.offset, ~s~0][224], [Black: 325#(and (= ~s~0 ~m1~0) (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 349#true, 84#L150true, Black: 327#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 8#thread5EXITtrue, 122#thread3EXITtrue, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 310#(<= (+ ~s~0 1) ~t~0), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 184#L183-1true]) [2023-08-26 13:27:57,058 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-26 13:27:57,058 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 13:27:57,058 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 13:27:57,058 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 13:27:57,257 INFO L124 PetriNetUnfolderBase]: 226775/313768 cut-off events. [2023-08-26 13:27:57,257 INFO L125 PetriNetUnfolderBase]: For 338389/400270 co-relation queries the response was YES. [2023-08-26 13:27:59,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964261 conditions, 313768 events. 226775/313768 cut-off events. For 338389/400270 co-relation queries the response was YES. Maximal size of possible extension queue 12949. Compared 2477996 event pairs, 62659 based on Foata normal form. 6254/297802 useless extension candidates. Maximal degree in co-relation 964248. Up to 232608 conditions per place. [2023-08-26 13:28:00,987 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 239 selfloop transitions, 159 changer transitions 0/416 dead transitions. [2023-08-26 13:28:00,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 416 transitions, 2961 flow [2023-08-26 13:28:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 13:28:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 13:28:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1376 transitions. [2023-08-26 13:28:00,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159355080614924 [2023-08-26 13:28:00,989 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1376 transitions. [2023-08-26 13:28:00,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1376 transitions. [2023-08-26 13:28:00,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:28:00,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1376 transitions. [2023-08-26 13:28:00,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.57142857142858) internal successors, (1376), 7 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:01,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 381.0) internal successors, (3048), 8 states have internal predecessors, (3048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:01,010 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 381.0) internal successors, (3048), 8 states have internal predecessors, (3048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:01,010 INFO L175 Difference]: Start difference. First operand has 103 places, 254 transitions, 1432 flow. Second operand 7 states and 1376 transitions. [2023-08-26 13:28:01,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 416 transitions, 2961 flow [2023-08-26 13:28:06,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 416 transitions, 2912 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-26 13:28:06,171 INFO L231 Difference]: Finished difference. Result has 108 places, 306 transitions, 2205 flow [2023-08-26 13:28:06,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2205, PETRI_PLACES=108, PETRI_TRANSITIONS=306} [2023-08-26 13:28:06,185 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 15 predicate places. [2023-08-26 13:28:06,185 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 306 transitions, 2205 flow [2023-08-26 13:28:06,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 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 13:28:06,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:28:06,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:28:06,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 13:28:06,185 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:28:06,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:28:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1726680565, now seen corresponding path program 5 times [2023-08-26 13:28:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:28:06,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424121404] [2023-08-26 13:28:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:28:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:28:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:28:06,516 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 13:28:06,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:28:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424121404] [2023-08-26 13:28:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424121404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:28:06,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:28:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 13:28:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440513206] [2023-08-26 13:28:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:28:06,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 13:28:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:28:06,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 13:28:06,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 13:28:06,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 13:28:06,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 306 transitions, 2205 flow. Second operand has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:06,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:28:06,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 13:28:06,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:28:38,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][304], [349#true, 47#L128true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 368#(<= (+ 2 ~s~0) ~t~0), 122#thread3EXITtrue, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 70#L181-4true, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 115#L55true, 85#thread4EXITtrue, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 313#(<= (+ ~s~0 4) ~t~0)]) [2023-08-26 13:28:38,395 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-26 13:28:38,395 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 13:28:38,395 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 13:28:38,395 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 13:28:39,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][304], [47#L128true, 349#true, 102#L182-1true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 368#(<= (+ 2 ~s~0) ~t~0), 122#thread3EXITtrue, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 115#L55true, Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 85#thread4EXITtrue, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 313#(<= (+ ~s~0 4) ~t~0)]) [2023-08-26 13:28:39,952 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 13:28:39,952 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:28:39,952 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:28:39,952 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:28:39,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][304], [349#true, 84#L150true, 174#L74true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 368#(<= (+ 2 ~s~0) ~t~0), 8#thread5EXITtrue, 205#L112true, 122#thread3EXITtrue, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 70#L181-4true, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 115#L55true, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 313#(<= (+ ~s~0 4) ~t~0)]) [2023-08-26 13:28:39,961 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 13:28:39,961 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:28:39,961 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:28:39,967 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:28:41,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][304], [349#true, 102#L182-1true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 174#L74true, 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 368#(<= (+ 2 ~s~0) ~t~0), 8#thread5EXITtrue, 205#L112true, 122#thread3EXITtrue, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 115#L55true, Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 313#(<= (+ ~s~0 4) ~t~0)]) [2023-08-26 13:28:41,169 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 13:28:41,169 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:28:41,169 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:28:41,169 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:28:41,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][490], [130#L93true, 349#true, 312#(<= (+ 3 ~s~0) ~t~0), 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 45#thread2EXITtrue, Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 135#L124true, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 367#(<= (+ ~s~0 1) ~t~0), 184#L183-1true]) [2023-08-26 13:28:41,911 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-26 13:28:41,911 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:28:41,911 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:28:41,911 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:28:42,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][490], [130#L93true, 88#L147true, 349#true, 312#(<= (+ 3 ~s~0) ~t~0), 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 45#thread2EXITtrue, Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 17#L182-2true, Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 140#L131true, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 367#(<= (+ ~s~0 1) ~t~0)]) [2023-08-26 13:28:42,015 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-26 13:28:42,015 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:28:42,015 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:28:42,015 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 13:28:42,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][490], [130#L93true, 88#L147true, 312#(<= (+ 3 ~s~0) ~t~0), 349#true, 331#true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 45#thread2EXITtrue, 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 140#L131true, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 367#(<= (+ ~s~0 1) ~t~0), 184#L183-1true]) [2023-08-26 13:28:42,408 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-26 13:28:42,408 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 13:28:42,408 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 13:28:42,408 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 13:28:42,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][543], [130#L93true, 349#true, 47#L128true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 45#thread2EXITtrue, Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 363#true, 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 311#(<= (+ 2 ~s~0) ~t~0), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 184#L183-1true]) [2023-08-26 13:28:42,508 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-26 13:28:42,508 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-26 13:28:42,508 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-26 13:28:42,508 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-26 13:28:43,383 INFO L124 PetriNetUnfolderBase]: 337853/471748 cut-off events. [2023-08-26 13:28:43,384 INFO L125 PetriNetUnfolderBase]: For 589570/693846 co-relation queries the response was YES. [2023-08-26 13:28:46,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511605 conditions, 471748 events. 337853/471748 cut-off events. For 589570/693846 co-relation queries the response was YES. Maximal size of possible extension queue 20392. Compared 3985861 event pairs, 68130 based on Foata normal form. 13984/449308 useless extension candidates. Maximal degree in co-relation 1511590. Up to 113102 conditions per place. [2023-08-26 13:28:48,865 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 260 selfloop transitions, 339 changer transitions 0/617 dead transitions. [2023-08-26 13:28:48,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 617 transitions, 4994 flow [2023-08-26 13:28:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 13:28:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 13:28:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2181 transitions. [2023-08-26 13:28:48,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204008589835362 [2023-08-26 13:28:48,869 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2181 transitions. [2023-08-26 13:28:48,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2181 transitions. [2023-08-26 13:28:48,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:28:48,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2181 transitions. [2023-08-26 13:28:48,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 198.27272727272728) internal successors, (2181), 11 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:48,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 381.0) internal successors, (4572), 12 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:48,875 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 381.0) internal successors, (4572), 12 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:48,875 INFO L175 Difference]: Start difference. First operand has 108 places, 306 transitions, 2205 flow. Second operand 11 states and 2181 transitions. [2023-08-26 13:28:48,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 617 transitions, 4994 flow [2023-08-26 13:28:54,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 617 transitions, 4778 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 13:28:54,373 INFO L231 Difference]: Finished difference. Result has 120 places, 460 transitions, 4322 flow [2023-08-26 13:28:54,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4322, PETRI_PLACES=120, PETRI_TRANSITIONS=460} [2023-08-26 13:28:54,373 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 27 predicate places. [2023-08-26 13:28:54,373 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 460 transitions, 4322 flow [2023-08-26 13:28:54,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:54,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:28:54,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:28:54,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 13:28:54,374 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:28:54,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:28:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -750154679, now seen corresponding path program 6 times [2023-08-26 13:28:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:28:54,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418144525] [2023-08-26 13:28:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:28:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:28:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:28:54,735 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 13:28:54,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:28:54,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418144525] [2023-08-26 13:28:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418144525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:28:54,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:28:54,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-26 13:28:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248146836] [2023-08-26 13:28:54,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:28:54,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 13:28:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:28:54,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 13:28:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-08-26 13:28:54,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 13:28:54,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 460 transitions, 4322 flow. Second operand has 12 states, 12 states have (on average 177.58333333333334) internal successors, (2131), 12 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:28:54,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:28:54,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 13:28:54,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:29:38,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][334], [130#L93true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 174#L74true, 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 369#(<= (+ 3 ~s~0) ~t~0), 8#thread5EXITtrue, 205#L112true, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 70#L181-4true, Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 198#thread1EXITtrue, 384#true, Black: 368#(<= (+ 2 ~s~0) ~t~0), 313#(<= (+ ~s~0 4) ~t~0), Black: 378#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 376#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 367#(<= (+ ~s~0 1) ~t~0)]) [2023-08-26 13:29:38,531 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 13:29:38,531 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:29:38,531 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:29:38,531 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 13:29:40,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][334], [130#L93true, 102#L182-1true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 369#(<= (+ 3 ~s~0) ~t~0), 8#thread5EXITtrue, 205#L112true, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 384#true, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 198#thread1EXITtrue, Black: 368#(<= (+ 2 ~s~0) ~t~0), 313#(<= (+ ~s~0 4) ~t~0), Black: 378#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 376#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 367#(<= (+ ~s~0 1) ~t~0)]) [2023-08-26 13:29:40,115 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 13:29:40,116 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:29:40,116 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:29:40,116 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 13:29:43,472 INFO L124 PetriNetUnfolderBase]: 364493/507098 cut-off events. [2023-08-26 13:29:43,473 INFO L125 PetriNetUnfolderBase]: For 1457034/1600101 co-relation queries the response was YES. [2023-08-26 13:29:47,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942099 conditions, 507098 events. 364493/507098 cut-off events. For 1457034/1600101 co-relation queries the response was YES. Maximal size of possible extension queue 21200. Compared 4238331 event pairs, 98861 based on Foata normal form. 25127/498106 useless extension candidates. Maximal degree in co-relation 1942080. Up to 369432 conditions per place. [2023-08-26 13:29:49,594 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 405 selfloop transitions, 367 changer transitions 0/790 dead transitions. [2023-08-26 13:29:49,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 790 transitions, 7826 flow [2023-08-26 13:29:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-26 13:29:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-26 13:29:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4424 transitions. [2023-08-26 13:29:49,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048499372361064 [2023-08-26 13:29:49,600 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4424 transitions. [2023-08-26 13:29:49,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4424 transitions. [2023-08-26 13:29:49,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:29:49,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4424 transitions. [2023-08-26 13:29:49,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 192.34782608695653) internal successors, (4424), 23 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:29:49,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 381.0) internal successors, (9144), 24 states have internal predecessors, (9144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:29:49,613 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 381.0) internal successors, (9144), 24 states have internal predecessors, (9144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:29:49,613 INFO L175 Difference]: Start difference. First operand has 120 places, 460 transitions, 4322 flow. Second operand 23 states and 4424 transitions. [2023-08-26 13:29:49,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 790 transitions, 7826 flow [2023-08-26 13:31:19,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 790 transitions, 7730 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-26 13:31:19,957 INFO L231 Difference]: Finished difference. Result has 143 places, 578 transitions, 6404 flow [2023-08-26 13:31:19,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=4226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6404, PETRI_PLACES=143, PETRI_TRANSITIONS=578} [2023-08-26 13:31:19,957 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 50 predicate places. [2023-08-26 13:31:19,957 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 578 transitions, 6404 flow [2023-08-26 13:31:19,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 177.58333333333334) internal successors, (2131), 12 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:31:19,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:31:19,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:31:19,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 13:31:19,958 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 13:31:19,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:31:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash -515409959, now seen corresponding path program 7 times [2023-08-26 13:31:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:31:19,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522394903] [2023-08-26 13:31:19,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:31:19,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:31:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:31:20,103 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 13:31:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:31:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522394903] [2023-08-26 13:31:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522394903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:31:20,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:31:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 13:31:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552770937] [2023-08-26 13:31:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:31:20,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 13:31:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:31:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 13:31:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 13:31:20,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 13:31:20,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 578 transitions, 6404 flow. Second operand has 7 states, 7 states have (on average 180.14285714285714) internal successors, (1261), 7 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:31:20,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:31:20,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 13:31:20,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand