/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/pthread-wmm/safe027_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:17:34,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:17:34,977 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 12:17:34,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:17:34,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:17:35,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:17:35,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:17:35,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:17:35,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:17:35,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:17:35,022 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:17:35,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:17:35,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:17:35,023 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:17:35,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:17:35,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:17:35,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:17:35,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:17:35,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:17:35,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:17:35,024 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:17:35,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:17:35,025 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:17:35,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:17:35,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:17:35,026 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:17:35,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:17:35,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:17:35,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:17:35,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:17:35,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:17:35,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:17:35,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:17:35,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:17:35,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:17:35,029 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 12:17:35,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:17:35,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:17:35,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:17:35,362 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:17:35,363 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:17:35,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_rmo.i [2023-08-26 12:17:36,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:17:36,988 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:17:36,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_rmo.i [2023-08-26 12:17:37,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/986b74b39/1f591a04cc77453a95b6c17709169502/FLAGc159e2f9d [2023-08-26 12:17:37,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/986b74b39/1f591a04cc77453a95b6c17709169502 [2023-08-26 12:17:37,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:17:37,034 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:17:37,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:17:37,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:17:37,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:17:37,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3288fd8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37, skipping insertion in model container [2023-08-26 12:17:37,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,094 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:17:37,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:17:37,454 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:17:37,486 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:17:37,488 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:17:37,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:17:37,589 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:17:37,589 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:17:37,595 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:17:37,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37 WrapperNode [2023-08-26 12:17:37,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:17:37,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:17:37,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:17:37,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:17:37,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,657 INFO L138 Inliner]: procedures = 177, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2023-08-26 12:17:37,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:17:37,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:17:37,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:17:37,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:17:37,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:17:37,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:17:37,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:17:37,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:17:37,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (1/1) ... [2023-08-26 12:17:37,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:17:37,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:17:37,761 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 12:17:37,772 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 12:17:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:17:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:17:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:17:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:17:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:17:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:17:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:17:37,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:17:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:17:37,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:17:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:17:37,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:17:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:17:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:17:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:17:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:17:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:17:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:17:37,792 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 12:17:37,977 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:17:37,978 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:17:38,389 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:17:38,706 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:17:38,707 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:17:38,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:17:38 BoogieIcfgContainer [2023-08-26 12:17:38,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:17:38,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:17:38,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:17:38,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:17:38,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:17:37" (1/3) ... [2023-08-26 12:17:38,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24014978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:17:38, skipping insertion in model container [2023-08-26 12:17:38,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:17:37" (2/3) ... [2023-08-26 12:17:38,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24014978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:17:38, skipping insertion in model container [2023-08-26 12:17:38,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:17:38" (3/3) ... [2023-08-26 12:17:38,718 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_rmo.i [2023-08-26 12:17:38,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:17:38,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2023-08-26 12:17:38,737 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:17:38,867 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:17:38,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 191 transitions, 402 flow [2023-08-26 12:17:39,013 INFO L124 PetriNetUnfolderBase]: 3/187 cut-off events. [2023-08-26 12:17:39,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:39,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 3/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 271 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-08-26 12:17:39,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 191 transitions, 402 flow [2023-08-26 12:17:39,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 187 transitions, 386 flow [2023-08-26 12:17:39,033 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:17:39,045 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 187 transitions, 386 flow [2023-08-26 12:17:39,048 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 187 transitions, 386 flow [2023-08-26 12:17:39,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 187 transitions, 386 flow [2023-08-26 12:17:39,115 INFO L124 PetriNetUnfolderBase]: 3/187 cut-off events. [2023-08-26 12:17:39,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:39,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 3/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 270 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-08-26 12:17:39,122 INFO L119 LiptonReduction]: Number of co-enabled transitions 7814 [2023-08-26 12:17:48,320 INFO L134 LiptonReduction]: Checked pairs total: 35265 [2023-08-26 12:17:48,321 INFO L136 LiptonReduction]: Total number of compositions: 153 [2023-08-26 12:17:48,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:17:48,338 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;@141d09ee, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:17:48,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2023-08-26 12:17:48,340 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:17:48,340 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:17:48,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:48,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:48,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:17:48,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:17:48,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1008, now seen corresponding path program 1 times [2023-08-26 12:17:48,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:48,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668692419] [2023-08-26 12:17:48,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:48,470 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 12:17:48,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:48,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668692419] [2023-08-26 12:17:48,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668692419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:48,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:48,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:17:48,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728055287] [2023-08-26 12:17:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:48,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:17:48,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:48,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:17:48,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:17:48,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 344 [2023-08-26 12:17:48,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 164 flow. Second operand has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:48,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:48,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 344 [2023-08-26 12:17:48,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:54,820 INFO L124 PetriNetUnfolderBase]: 45858/60580 cut-off events. [2023-08-26 12:17:54,821 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-26 12:17:54,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121382 conditions, 60580 events. 45858/60580 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 3079. Compared 351494 event pairs, 45858 based on Foata normal form. 900/34858 useless extension candidates. Maximal degree in co-relation 121370. Up to 60575 conditions per place. [2023-08-26 12:17:55,219 INFO L140 encePairwiseOnDemand]: 315/344 looper letters, 45 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-26 12:17:55,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 196 flow [2023-08-26 12:17:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:17:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:17:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 362 transitions. [2023-08-26 12:17:55,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261627906976745 [2023-08-26 12:17:55,236 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 362 transitions. [2023-08-26 12:17:55,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 362 transitions. [2023-08-26 12:17:55,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:55,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 362 transitions. [2023-08-26 12:17:55,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 181.0) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:55,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:55,250 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:55,252 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 164 flow. Second operand 2 states and 362 transitions. [2023-08-26 12:17:55,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 196 flow [2023-08-26 12:17:55,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:17:55,261 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 102 flow [2023-08-26 12:17:55,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-26 12:17:55,266 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -31 predicate places. [2023-08-26 12:17:55,266 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 102 flow [2023-08-26 12:17:55,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:55,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:55,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:17:55,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:17:55,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:17:55,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash 994099, now seen corresponding path program 1 times [2023-08-26 12:17:55,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:55,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531052201] [2023-08-26 12:17:55,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:55,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:55,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531052201] [2023-08-26 12:17:55,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531052201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:55,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:55,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:17:55,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504583420] [2023-08-26 12:17:55,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:55,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:17:55,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:55,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:17:55,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:17:55,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 344 [2023-08-26 12:17:55,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:55,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:55,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 344 [2023-08-26 12:17:55,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:57,997 INFO L124 PetriNetUnfolderBase]: 18114/24224 cut-off events. [2023-08-26 12:17:57,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:58,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48604 conditions, 24224 events. 18114/24224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 128503 event pairs, 18114 based on Foata normal form. 0/16444 useless extension candidates. Maximal degree in co-relation 48601. Up to 24223 conditions per place. [2023-08-26 12:17:58,108 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 38 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-26 12:17:58,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 166 flow [2023-08-26 12:17:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:17:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:17:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-26 12:17:58,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050387596899225 [2023-08-26 12:17:58,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-26 12:17:58,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-26 12:17:58,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:58,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-26 12:17:58,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:58,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:17:58,115 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:17:58,115 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 102 flow. Second operand 3 states and 418 transitions. [2023-08-26 12:17:58,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 166 flow [2023-08-26 12:17:58,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 40 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:17:58,117 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 90 flow [2023-08-26 12:17:58,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-26 12:17:58,117 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -36 predicate places. [2023-08-26 12:17:58,118 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 90 flow [2023-08-26 12:17:58,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:58,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:58,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:17:58,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:17:58,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:17:58,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:58,119 INFO L85 PathProgramCache]: Analyzing trace with hash 994098, now seen corresponding path program 1 times [2023-08-26 12:17:58,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:58,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871413021] [2023-08-26 12:17:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:58,178 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 12:17:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:58,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871413021] [2023-08-26 12:17:58,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871413021] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:58,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:58,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:17:58,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014328750] [2023-08-26 12:17:58,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:58,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:17:58,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:58,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:17:58,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:17:58,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 344 [2023-08-26 12:17:58,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:58,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:58,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 344 [2023-08-26 12:17:58,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:59,609 INFO L124 PetriNetUnfolderBase]: 11016/15530 cut-off events. [2023-08-26 12:17:59,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:59,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31018 conditions, 15530 events. 11016/15530 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 88574 event pairs, 6596 based on Foata normal form. 0/13477 useless extension candidates. Maximal degree in co-relation 31014. Up to 9009 conditions per place. [2023-08-26 12:17:59,666 INFO L140 encePairwiseOnDemand]: 328/344 looper letters, 40 selfloop transitions, 9 changer transitions 1/51 dead transitions. [2023-08-26 12:17:59,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 212 flow [2023-08-26 12:17:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:17:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:17:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-26 12:17:59,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2023-08-26 12:17:59,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-26 12:17:59,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-26 12:17:59,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:59,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-26 12:17:59,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:59,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:17:59,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:17:59,677 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 90 flow. Second operand 3 states and 414 transitions. [2023-08-26 12:17:59,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 212 flow [2023-08-26 12:17:59,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:17:59,679 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 157 flow [2023-08-26 12:17:59,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-26 12:17:59,680 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -35 predicate places. [2023-08-26 12:17:59,680 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 157 flow [2023-08-26 12:17:59,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:59,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:59,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:59,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:17:59,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:17:59,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:59,685 INFO L85 PathProgramCache]: Analyzing trace with hash -989894503, now seen corresponding path program 1 times [2023-08-26 12:17:59,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:59,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999765489] [2023-08-26 12:17:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:59,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:00,084 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 12:18:00,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:00,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999765489] [2023-08-26 12:18:00,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999765489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:00,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:00,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:18:00,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003180399] [2023-08-26 12:18:00,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:00,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:18:00,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:00,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:18:00,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:18:00,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 344 [2023-08-26 12:18:00,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:00,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:00,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 344 [2023-08-26 12:18:00,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:01,666 INFO L124 PetriNetUnfolderBase]: 10485/14765 cut-off events. [2023-08-26 12:18:01,666 INFO L125 PetriNetUnfolderBase]: For 5075/5075 co-relation queries the response was YES. [2023-08-26 12:18:01,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39178 conditions, 14765 events. 10485/14765 cut-off events. For 5075/5075 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 87328 event pairs, 2017 based on Foata normal form. 0/14125 useless extension candidates. Maximal degree in co-relation 39173. Up to 12282 conditions per place. [2023-08-26 12:18:01,751 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 69 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-26 12:18:01,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 407 flow [2023-08-26 12:18:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:18:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:18:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-08-26 12:18:01,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4699612403100775 [2023-08-26 12:18:01,755 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-08-26 12:18:01,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-08-26 12:18:01,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:01,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-08-26 12:18:01,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:01,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:01,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:01,760 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 157 flow. Second operand 3 states and 485 transitions. [2023-08-26 12:18:01,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 407 flow [2023-08-26 12:18:01,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:01,799 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 147 flow [2023-08-26 12:18:01,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-26 12:18:01,800 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -35 predicate places. [2023-08-26 12:18:01,800 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 147 flow [2023-08-26 12:18:01,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:01,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:01,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:01,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:18:01,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:01,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:01,802 INFO L85 PathProgramCache]: Analyzing trace with hash -989894750, now seen corresponding path program 1 times [2023-08-26 12:18:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:01,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654978563] [2023-08-26 12:18:01,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:01,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:01,945 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 12:18:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654978563] [2023-08-26 12:18:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654978563] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:01,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:01,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:18:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410582801] [2023-08-26 12:18:01,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:01,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:18:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:01,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:18:01,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:18:01,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 344 [2023-08-26 12:18:01,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:01,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:01,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 344 [2023-08-26 12:18:01,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:03,528 INFO L124 PetriNetUnfolderBase]: 10181/14959 cut-off events. [2023-08-26 12:18:03,528 INFO L125 PetriNetUnfolderBase]: For 2443/2443 co-relation queries the response was YES. [2023-08-26 12:18:03,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38079 conditions, 14959 events. 10181/14959 cut-off events. For 2443/2443 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 92499 event pairs, 3815 based on Foata normal form. 0/13290 useless extension candidates. Maximal degree in co-relation 38073. Up to 9061 conditions per place. [2023-08-26 12:18:03,620 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 73 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-26 12:18:03,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 412 flow [2023-08-26 12:18:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:18:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:18:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-08-26 12:18:03,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786821705426357 [2023-08-26 12:18:03,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-08-26 12:18:03,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-08-26 12:18:03,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:03,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-08-26 12:18:03,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:03,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:03,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:03,631 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 147 flow. Second operand 3 states and 494 transitions. [2023-08-26 12:18:03,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 412 flow [2023-08-26 12:18:03,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:03,636 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 156 flow [2023-08-26 12:18:03,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-08-26 12:18:03,638 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -34 predicate places. [2023-08-26 12:18:03,639 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 156 flow [2023-08-26 12:18:03,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:03,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:03,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:03,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:18:03,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:03,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:03,640 INFO L85 PathProgramCache]: Analyzing trace with hash -621960808, now seen corresponding path program 1 times [2023-08-26 12:18:03,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:03,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827256238] [2023-08-26 12:18:03,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:03,801 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 12:18:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827256238] [2023-08-26 12:18:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827256238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:03,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:18:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441451286] [2023-08-26 12:18:03,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:03,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:18:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:03,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:18:03,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:18:03,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 344 [2023-08-26 12:18:03,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:03,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:03,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 344 [2023-08-26 12:18:03,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:05,425 INFO L124 PetriNetUnfolderBase]: 11043/16288 cut-off events. [2023-08-26 12:18:05,425 INFO L125 PetriNetUnfolderBase]: For 3157/3157 co-relation queries the response was YES. [2023-08-26 12:18:05,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42614 conditions, 16288 events. 11043/16288 cut-off events. For 3157/3157 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 103334 event pairs, 4949 based on Foata normal form. 0/15232 useless extension candidates. Maximal degree in co-relation 42607. Up to 10597 conditions per place. [2023-08-26 12:18:05,528 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 62 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2023-08-26 12:18:05,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 363 flow [2023-08-26 12:18:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:18:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:18:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-26 12:18:05,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4118217054263566 [2023-08-26 12:18:05,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-26 12:18:05,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-26 12:18:05,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:05,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-26 12:18:05,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 12:18:05,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:05,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:05,536 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 156 flow. Second operand 3 states and 425 transitions. [2023-08-26 12:18:05,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 363 flow [2023-08-26 12:18:05,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:05,539 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 188 flow [2023-08-26 12:18:05,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-26 12:18:05,542 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -34 predicate places. [2023-08-26 12:18:05,542 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 188 flow [2023-08-26 12:18:05,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:05,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:05,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:05,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:18:05,543 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:05,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash -621960807, now seen corresponding path program 1 times [2023-08-26 12:18:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:05,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884706902] [2023-08-26 12:18:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:06,163 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 12:18:06,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884706902] [2023-08-26 12:18:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884706902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:18:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194603204] [2023-08-26 12:18:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:06,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:18:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:18:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:18:06,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 344 [2023-08-26 12:18:06,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:06,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:06,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 344 [2023-08-26 12:18:06,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:07,491 INFO L124 PetriNetUnfolderBase]: 10787/15936 cut-off events. [2023-08-26 12:18:07,491 INFO L125 PetriNetUnfolderBase]: For 7158/7158 co-relation queries the response was YES. [2023-08-26 12:18:07,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44046 conditions, 15936 events. 10787/15936 cut-off events. For 7158/7158 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 100973 event pairs, 3997 based on Foata normal form. 96/14976 useless extension candidates. Maximal degree in co-relation 44038. Up to 10030 conditions per place. [2023-08-26 12:18:07,566 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 76 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2023-08-26 12:18:07,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 457 flow [2023-08-26 12:18:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:18:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:18:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-26 12:18:07,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40406976744186046 [2023-08-26 12:18:07,568 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-26 12:18:07,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-26 12:18:07,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:07,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-26 12:18:07,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:07,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:07,572 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:07,573 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 188 flow. Second operand 4 states and 556 transitions. [2023-08-26 12:18:07,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 457 flow [2023-08-26 12:18:07,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:07,765 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 181 flow [2023-08-26 12:18:07,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-26 12:18:07,766 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -34 predicate places. [2023-08-26 12:18:07,766 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 181 flow [2023-08-26 12:18:07,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:07,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:07,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:07,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:18:07,767 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:07,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:07,767 INFO L85 PathProgramCache]: Analyzing trace with hash -112373601, now seen corresponding path program 1 times [2023-08-26 12:18:07,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:07,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649781801] [2023-08-26 12:18:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:07,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:08,056 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 12:18:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649781801] [2023-08-26 12:18:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649781801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:08,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:08,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:18:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964752091] [2023-08-26 12:18:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:08,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:18:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:08,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:18:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:18:08,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 344 [2023-08-26 12:18:08,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:08,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:08,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 344 [2023-08-26 12:18:08,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:09,923 INFO L124 PetriNetUnfolderBase]: 16738/23453 cut-off events. [2023-08-26 12:18:09,924 INFO L125 PetriNetUnfolderBase]: For 15509/15509 co-relation queries the response was YES. [2023-08-26 12:18:10,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65119 conditions, 23453 events. 16738/23453 cut-off events. For 15509/15509 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 139769 event pairs, 5105 based on Foata normal form. 36/21865 useless extension candidates. Maximal degree in co-relation 65112. Up to 18553 conditions per place. [2023-08-26 12:18:10,075 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 108 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-08-26 12:18:10,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 115 transitions, 673 flow [2023-08-26 12:18:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:18:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:18:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-26 12:18:10,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40406976744186046 [2023-08-26 12:18:10,078 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-26 12:18:10,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-26 12:18:10,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:10,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-26 12:18:10,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:10,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:10,082 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:10,082 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 181 flow. Second operand 4 states and 556 transitions. [2023-08-26 12:18:10,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 115 transitions, 673 flow [2023-08-26 12:18:10,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 115 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:10,122 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 244 flow [2023-08-26 12:18:10,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-26 12:18:10,123 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -31 predicate places. [2023-08-26 12:18:10,123 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 244 flow [2023-08-26 12:18:10,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:10,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:10,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:10,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:18:10,124 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:10,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 811383625, now seen corresponding path program 1 times [2023-08-26 12:18:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:10,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859729478] [2023-08-26 12:18:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:10,303 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 12:18:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:10,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859729478] [2023-08-26 12:18:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859729478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:10,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:10,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:18:10,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671197748] [2023-08-26 12:18:10,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:10,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:18:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:18:10,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:18:10,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 344 [2023-08-26 12:18:10,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:10,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:10,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 344 [2023-08-26 12:18:10,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:12,568 INFO L124 PetriNetUnfolderBase]: 21309/30146 cut-off events. [2023-08-26 12:18:12,568 INFO L125 PetriNetUnfolderBase]: For 22421/22421 co-relation queries the response was YES. [2023-08-26 12:18:12,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88782 conditions, 30146 events. 21309/30146 cut-off events. For 22421/22421 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 191426 event pairs, 3599 based on Foata normal form. 108/28174 useless extension candidates. Maximal degree in co-relation 88773. Up to 13782 conditions per place. [2023-08-26 12:18:12,807 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 114 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2023-08-26 12:18:12,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 120 transitions, 747 flow [2023-08-26 12:18:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:18:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:18:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2023-08-26 12:18:12,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46656976744186046 [2023-08-26 12:18:12,809 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2023-08-26 12:18:12,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2023-08-26 12:18:12,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:12,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2023-08-26 12:18:12,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:12,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:12,814 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:12,814 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 244 flow. Second operand 4 states and 642 transitions. [2023-08-26 12:18:12,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 120 transitions, 747 flow [2023-08-26 12:18:12,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 120 transitions, 747 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:18:12,858 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 272 flow [2023-08-26 12:18:12,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-08-26 12:18:12,858 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -26 predicate places. [2023-08-26 12:18:12,859 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 272 flow [2023-08-26 12:18:12,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:12,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:12,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:12,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:18:12,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:12,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1018335697, now seen corresponding path program 1 times [2023-08-26 12:18:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:12,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985939136] [2023-08-26 12:18:12,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:13,164 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 12:18:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985939136] [2023-08-26 12:18:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985939136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:13,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:13,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:18:13,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601976494] [2023-08-26 12:18:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:13,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:18:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:13,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:18:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:18:13,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 344 [2023-08-26 12:18:13,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:13,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:13,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 344 [2023-08-26 12:18:13,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:15,216 INFO L124 PetriNetUnfolderBase]: 15657/22846 cut-off events. [2023-08-26 12:18:15,216 INFO L125 PetriNetUnfolderBase]: For 24471/24471 co-relation queries the response was YES. [2023-08-26 12:18:15,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73052 conditions, 22846 events. 15657/22846 cut-off events. For 24471/24471 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 150765 event pairs, 8297 based on Foata normal form. 24/21206 useless extension candidates. Maximal degree in co-relation 73040. Up to 14735 conditions per place. [2023-08-26 12:18:15,328 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 77 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2023-08-26 12:18:15,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 553 flow [2023-08-26 12:18:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:18:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:18:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-26 12:18:15,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40988372093023256 [2023-08-26 12:18:15,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-26 12:18:15,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-26 12:18:15,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:15,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-26 12:18:15,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 12:18:15,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:15,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:15,333 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 272 flow. Second operand 3 states and 423 transitions. [2023-08-26 12:18:15,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 553 flow [2023-08-26 12:18:15,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 539 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:15,368 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 283 flow [2023-08-26 12:18:15,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-08-26 12:18:15,369 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -25 predicate places. [2023-08-26 12:18:15,369 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 283 flow [2023-08-26 12:18:15,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:15,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:15,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:15,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:18:15,370 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:15,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2100896127, now seen corresponding path program 1 times [2023-08-26 12:18:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:15,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129373320] [2023-08-26 12:18:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:15,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:15,537 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 12:18:15,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129373320] [2023-08-26 12:18:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129373320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:15,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:15,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:18:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632282911] [2023-08-26 12:18:15,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:15,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:18:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:15,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:18:15,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:18:15,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 344 [2023-08-26 12:18:15,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:15,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:15,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 344 [2023-08-26 12:18:15,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:17,345 INFO L124 PetriNetUnfolderBase]: 13588/19963 cut-off events. [2023-08-26 12:18:17,345 INFO L125 PetriNetUnfolderBase]: For 20589/20589 co-relation queries the response was YES. [2023-08-26 12:18:17,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65394 conditions, 19963 events. 13588/19963 cut-off events. For 20589/20589 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 128384 event pairs, 4495 based on Foata normal form. 72/18786 useless extension candidates. Maximal degree in co-relation 65381. Up to 7695 conditions per place. [2023-08-26 12:18:17,462 INFO L140 encePairwiseOnDemand]: 331/344 looper letters, 68 selfloop transitions, 14 changer transitions 0/83 dead transitions. [2023-08-26 12:18:17,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 635 flow [2023-08-26 12:18:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:18:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:18:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-08-26 12:18:17,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3815406976744186 [2023-08-26 12:18:17,464 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-08-26 12:18:17,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-08-26 12:18:17,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:17,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-08-26 12:18:17,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:17,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:17,467 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:17,468 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 283 flow. Second operand 4 states and 525 transitions. [2023-08-26 12:18:17,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 635 flow [2023-08-26 12:18:17,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:17,505 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 381 flow [2023-08-26 12:18:17,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-08-26 12:18:17,505 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -22 predicate places. [2023-08-26 12:18:17,506 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 381 flow [2023-08-26 12:18:17,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:17,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:17,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:17,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:18:17,506 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:17,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 288447603, now seen corresponding path program 1 times [2023-08-26 12:18:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:17,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842533712] [2023-08-26 12:18:17,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:18,854 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 12:18:18,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:18,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842533712] [2023-08-26 12:18:18,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842533712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:18,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:18,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:18:18,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267389685] [2023-08-26 12:18:18,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:18,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:18:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:18,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:18:18,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:18:18,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 344 [2023-08-26 12:18:18,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 381 flow. Second operand has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:18,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:18,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 344 [2023-08-26 12:18:18,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:21,188 INFO L124 PetriNetUnfolderBase]: 15204/22029 cut-off events. [2023-08-26 12:18:21,188 INFO L125 PetriNetUnfolderBase]: For 29148/29148 co-relation queries the response was YES. [2023-08-26 12:18:21,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78655 conditions, 22029 events. 15204/22029 cut-off events. For 29148/29148 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 141363 event pairs, 6736 based on Foata normal form. 32/21785 useless extension candidates. Maximal degree in co-relation 78641. Up to 19826 conditions per place. [2023-08-26 12:18:21,341 INFO L140 encePairwiseOnDemand]: 331/344 looper letters, 114 selfloop transitions, 26 changer transitions 0/141 dead transitions. [2023-08-26 12:18:21,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 141 transitions, 1046 flow [2023-08-26 12:18:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 12:18:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 12:18:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1356 transitions. [2023-08-26 12:18:21,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32848837209302323 [2023-08-26 12:18:21,345 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1356 transitions. [2023-08-26 12:18:21,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1356 transitions. [2023-08-26 12:18:21,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:21,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1356 transitions. [2023-08-26 12:18:21,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:21,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 344.0) internal successors, (4472), 13 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:21,353 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 344.0) internal successors, (4472), 13 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:21,353 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 381 flow. Second operand 12 states and 1356 transitions. [2023-08-26 12:18:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 141 transitions, 1046 flow [2023-08-26 12:18:21,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 141 transitions, 1040 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:18:21,439 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 632 flow [2023-08-26 12:18:21,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=632, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2023-08-26 12:18:21,440 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -5 predicate places. [2023-08-26 12:18:21,440 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 632 flow [2023-08-26 12:18:21,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:21,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:21,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:21,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:18:21,441 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:21,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -883450059, now seen corresponding path program 2 times [2023-08-26 12:18:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075911782] [2023-08-26 12:18:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:22,510 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 12:18:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075911782] [2023-08-26 12:18:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075911782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:22,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:22,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:18:22,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700970120] [2023-08-26 12:18:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:22,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:18:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:22,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:18:22,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:18:22,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 344 [2023-08-26 12:18:22,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:22,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:22,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 344 [2023-08-26 12:18:22,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:25,185 INFO L124 PetriNetUnfolderBase]: 15956/23223 cut-off events. [2023-08-26 12:18:25,185 INFO L125 PetriNetUnfolderBase]: For 36927/36927 co-relation queries the response was YES. [2023-08-26 12:18:25,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88532 conditions, 23223 events. 15956/23223 cut-off events. For 36927/36927 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 151273 event pairs, 4101 based on Foata normal form. 4/22951 useless extension candidates. Maximal degree in co-relation 88510. Up to 21036 conditions per place. [2023-08-26 12:18:25,317 INFO L140 encePairwiseOnDemand]: 333/344 looper letters, 115 selfloop transitions, 40 changer transitions 1/157 dead transitions. [2023-08-26 12:18:25,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 157 transitions, 1385 flow [2023-08-26 12:18:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 12:18:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 12:18:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1238 transitions. [2023-08-26 12:18:25,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32716701902748413 [2023-08-26 12:18:25,321 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1238 transitions. [2023-08-26 12:18:25,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1238 transitions. [2023-08-26 12:18:25,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:25,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1238 transitions. [2023-08-26 12:18:25,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:25,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 344.0) internal successors, (4128), 12 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:25,328 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 344.0) internal successors, (4128), 12 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:25,328 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 632 flow. Second operand 11 states and 1238 transitions. [2023-08-26 12:18:25,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 157 transitions, 1385 flow [2023-08-26 12:18:25,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 157 transitions, 1375 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-26 12:18:25,509 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 1002 flow [2023-08-26 12:18:25,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1002, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2023-08-26 12:18:25,509 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2023-08-26 12:18:25,509 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 1002 flow [2023-08-26 12:18:25,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:25,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:25,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:25,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:18:25,510 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:25,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1903324849, now seen corresponding path program 3 times [2023-08-26 12:18:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:25,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484976990] [2023-08-26 12:18:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:26,591 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 12:18:26,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484976990] [2023-08-26 12:18:26,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484976990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:26,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:26,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:18:26,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326259801] [2023-08-26 12:18:26,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:26,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:18:26,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:26,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:18:26,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:18:26,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 344 [2023-08-26 12:18:26,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 1002 flow. Second operand has 10 states, 10 states have (on average 104.7) internal successors, (1047), 10 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:26,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:26,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 344 [2023-08-26 12:18:26,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:29,322 INFO L124 PetriNetUnfolderBase]: 15924/23189 cut-off events. [2023-08-26 12:18:29,322 INFO L125 PetriNetUnfolderBase]: For 47160/47160 co-relation queries the response was YES. [2023-08-26 12:18:29,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94004 conditions, 23189 events. 15924/23189 cut-off events. For 47160/47160 co-relation queries the response was YES. Maximal size of possible extension queue 1395. Compared 151766 event pairs, 3152 based on Foata normal form. 4/22917 useless extension candidates. Maximal degree in co-relation 93977. Up to 19520 conditions per place. [2023-08-26 12:18:29,569 INFO L140 encePairwiseOnDemand]: 334/344 looper letters, 135 selfloop transitions, 74 changer transitions 0/210 dead transitions. [2023-08-26 12:18:29,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 210 transitions, 2122 flow [2023-08-26 12:18:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 12:18:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 12:18:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1455 transitions. [2023-08-26 12:18:29,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32535778175313057 [2023-08-26 12:18:29,573 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1455 transitions. [2023-08-26 12:18:29,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1455 transitions. [2023-08-26 12:18:29,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:29,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1455 transitions. [2023-08-26 12:18:29,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.92307692307692) internal successors, (1455), 13 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:29,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 344.0) internal successors, (4816), 14 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:29,582 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 344.0) internal successors, (4816), 14 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:29,582 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 1002 flow. Second operand 13 states and 1455 transitions. [2023-08-26 12:18:29,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 210 transitions, 2122 flow [2023-08-26 12:18:29,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 210 transitions, 2082 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-26 12:18:29,881 INFO L231 Difference]: Finished difference. Result has 111 places, 146 transitions, 1607 flow [2023-08-26 12:18:29,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1607, PETRI_PLACES=111, PETRI_TRANSITIONS=146} [2023-08-26 12:18:29,881 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 23 predicate places. [2023-08-26 12:18:29,881 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 146 transitions, 1607 flow [2023-08-26 12:18:29,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.7) internal successors, (1047), 10 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:29,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:29,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:29,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:18:29,882 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:29,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash -703270244, now seen corresponding path program 1 times [2023-08-26 12:18:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:29,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779448186] [2023-08-26 12:18:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:30,091 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 12:18:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779448186] [2023-08-26 12:18:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779448186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:18:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063033475] [2023-08-26 12:18:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:30,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:18:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:18:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:18:30,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 344 [2023-08-26 12:18:30,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 146 transitions, 1607 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:30,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:30,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 344 [2023-08-26 12:18:30,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:32,616 INFO L124 PetriNetUnfolderBase]: 13547/19846 cut-off events. [2023-08-26 12:18:32,616 INFO L125 PetriNetUnfolderBase]: For 55973/55973 co-relation queries the response was YES. [2023-08-26 12:18:32,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86068 conditions, 19846 events. 13547/19846 cut-off events. For 55973/55973 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 125794 event pairs, 3710 based on Foata normal form. 312/19974 useless extension candidates. Maximal degree in co-relation 86036. Up to 6883 conditions per place. [2023-08-26 12:18:32,780 INFO L140 encePairwiseOnDemand]: 330/344 looper letters, 166 selfloop transitions, 39 changer transitions 0/206 dead transitions. [2023-08-26 12:18:32,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 206 transitions, 2557 flow [2023-08-26 12:18:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:18:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:18:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-08-26 12:18:32,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633720930232558 [2023-08-26 12:18:32,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-08-26 12:18:32,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-08-26 12:18:32,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:32,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-08-26 12:18:32,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:32,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:32,788 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:32,788 INFO L175 Difference]: Start difference. First operand has 111 places, 146 transitions, 1607 flow. Second operand 6 states and 750 transitions. [2023-08-26 12:18:32,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 206 transitions, 2557 flow [2023-08-26 12:18:33,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 206 transitions, 2470 flow, removed 37 selfloop flow, removed 4 redundant places. [2023-08-26 12:18:33,146 INFO L231 Difference]: Finished difference. Result has 114 places, 161 transitions, 1908 flow [2023-08-26 12:18:33,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1908, PETRI_PLACES=114, PETRI_TRANSITIONS=161} [2023-08-26 12:18:33,147 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 26 predicate places. [2023-08-26 12:18:33,147 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 161 transitions, 1908 flow [2023-08-26 12:18:33,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:33,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:33,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:33,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:18:33,148 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:33,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -189273228, now seen corresponding path program 1 times [2023-08-26 12:18:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:33,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855752776] [2023-08-26 12:18:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:33,290 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 12:18:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:33,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855752776] [2023-08-26 12:18:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855752776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:33,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:18:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901122286] [2023-08-26 12:18:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:33,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:18:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:18:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:18:33,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 344 [2023-08-26 12:18:33,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 161 transitions, 1908 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 12:18:33,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:33,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 344 [2023-08-26 12:18:33,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:34,827 INFO L124 PetriNetUnfolderBase]: 8453/12945 cut-off events. [2023-08-26 12:18:34,828 INFO L125 PetriNetUnfolderBase]: For 45800/45800 co-relation queries the response was YES. [2023-08-26 12:18:34,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60120 conditions, 12945 events. 8453/12945 cut-off events. For 45800/45800 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 83870 event pairs, 2211 based on Foata normal form. 61/12887 useless extension candidates. Maximal degree in co-relation 60086. Up to 12321 conditions per place. [2023-08-26 12:18:34,925 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 199 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2023-08-26 12:18:34,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 208 transitions, 2692 flow [2023-08-26 12:18:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:18:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:18:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2023-08-26 12:18:34,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45155038759689925 [2023-08-26 12:18:34,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2023-08-26 12:18:34,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2023-08-26 12:18:34,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:34,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2023-08-26 12:18:34,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:34,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:34,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 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 12:18:34,932 INFO L175 Difference]: Start difference. First operand has 114 places, 161 transitions, 1908 flow. Second operand 3 states and 466 transitions. [2023-08-26 12:18:34,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 208 transitions, 2692 flow [2023-08-26 12:18:35,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 208 transitions, 2667 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 12:18:35,133 INFO L231 Difference]: Finished difference. Result has 114 places, 162 transitions, 1860 flow [2023-08-26 12:18:35,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1827, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1860, PETRI_PLACES=114, PETRI_TRANSITIONS=162} [2023-08-26 12:18:35,133 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 26 predicate places. [2023-08-26 12:18:35,134 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 162 transitions, 1860 flow [2023-08-26 12:18:35,134 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 12:18:35,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:35,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:35,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:18:35,134 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:35,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1632440975, now seen corresponding path program 1 times [2023-08-26 12:18:35,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173401391] [2023-08-26 12:18:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:35,302 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 12:18:35,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173401391] [2023-08-26 12:18:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173401391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:35,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:18:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389920240] [2023-08-26 12:18:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:35,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:18:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:35,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:18:35,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:18:35,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 344 [2023-08-26 12:18:35,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 162 transitions, 1860 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:35,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:35,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 344 [2023-08-26 12:18:35,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:36,102 INFO L124 PetriNetUnfolderBase]: 3061/5119 cut-off events. [2023-08-26 12:18:36,102 INFO L125 PetriNetUnfolderBase]: For 17311/17311 co-relation queries the response was YES. [2023-08-26 12:18:36,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25157 conditions, 5119 events. 3061/5119 cut-off events. For 17311/17311 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 31240 event pairs, 475 based on Foata normal form. 112/5194 useless extension candidates. Maximal degree in co-relation 25121. Up to 3918 conditions per place. [2023-08-26 12:18:36,124 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 206 selfloop transitions, 9 changer transitions 4/223 dead transitions. [2023-08-26 12:18:36,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 223 transitions, 2740 flow [2023-08-26 12:18:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:18:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:18:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 619 transitions. [2023-08-26 12:18:36,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4498546511627907 [2023-08-26 12:18:36,126 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 619 transitions. [2023-08-26 12:18:36,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 619 transitions. [2023-08-26 12:18:36,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:36,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 619 transitions. [2023-08-26 12:18:36,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:36,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:36,129 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:36,129 INFO L175 Difference]: Start difference. First operand has 114 places, 162 transitions, 1860 flow. Second operand 4 states and 619 transitions. [2023-08-26 12:18:36,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 223 transitions, 2740 flow [2023-08-26 12:18:36,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 223 transitions, 2697 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-26 12:18:36,187 INFO L231 Difference]: Finished difference. Result has 114 places, 146 transitions, 1586 flow [2023-08-26 12:18:36,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1586, PETRI_PLACES=114, PETRI_TRANSITIONS=146} [2023-08-26 12:18:36,188 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 26 predicate places. [2023-08-26 12:18:36,188 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 146 transitions, 1586 flow [2023-08-26 12:18:36,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:36,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:36,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:36,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:18:36,189 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:36,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 90534225, now seen corresponding path program 1 times [2023-08-26 12:18:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:36,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595993892] [2023-08-26 12:18:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:36,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:37,326 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 12:18:37,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:37,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595993892] [2023-08-26 12:18:37,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595993892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:37,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:37,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:18:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228184270] [2023-08-26 12:18:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:37,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:18:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:37,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:18:37,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:18:37,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 344 [2023-08-26 12:18:37,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 146 transitions, 1586 flow. Second operand has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:37,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:37,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 344 [2023-08-26 12:18:37,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:38,924 INFO L124 PetriNetUnfolderBase]: 5999/10127 cut-off events. [2023-08-26 12:18:38,924 INFO L125 PetriNetUnfolderBase]: For 36683/36683 co-relation queries the response was YES. [2023-08-26 12:18:38,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50313 conditions, 10127 events. 5999/10127 cut-off events. For 36683/36683 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 71082 event pairs, 1251 based on Foata normal form. 27/10071 useless extension candidates. Maximal degree in co-relation 50278. Up to 5227 conditions per place. [2023-08-26 12:18:38,992 INFO L140 encePairwiseOnDemand]: 329/344 looper letters, 230 selfloop transitions, 98 changer transitions 10/339 dead transitions. [2023-08-26 12:18:38,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 339 transitions, 3916 flow [2023-08-26 12:18:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 12:18:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 12:18:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1324 transitions. [2023-08-26 12:18:38,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3498942917547569 [2023-08-26 12:18:38,994 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1324 transitions. [2023-08-26 12:18:38,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1324 transitions. [2023-08-26 12:18:38,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:38,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1324 transitions. [2023-08-26 12:18:38,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.36363636363636) internal successors, (1324), 11 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:39,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 344.0) internal successors, (4128), 12 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:39,001 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 344.0) internal successors, (4128), 12 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:39,001 INFO L175 Difference]: Start difference. First operand has 114 places, 146 transitions, 1586 flow. Second operand 11 states and 1324 transitions. [2023-08-26 12:18:39,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 339 transitions, 3916 flow [2023-08-26 12:18:39,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 339 transitions, 3842 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:39,214 INFO L231 Difference]: Finished difference. Result has 130 places, 217 transitions, 2833 flow [2023-08-26 12:18:39,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2833, PETRI_PLACES=130, PETRI_TRANSITIONS=217} [2023-08-26 12:18:39,214 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 42 predicate places. [2023-08-26 12:18:39,214 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 217 transitions, 2833 flow [2023-08-26 12:18:39,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:39,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:39,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:39,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:18:39,215 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:39,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1112494217, now seen corresponding path program 2 times [2023-08-26 12:18:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580369787] [2023-08-26 12:18:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:40,661 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 12:18:40,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:40,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580369787] [2023-08-26 12:18:40,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580369787] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:40,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 12:18:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958921652] [2023-08-26 12:18:40,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:40,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 12:18:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 12:18:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-08-26 12:18:40,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 344 [2023-08-26 12:18:40,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 217 transitions, 2833 flow. Second operand has 11 states, 11 states have (on average 104.81818181818181) internal successors, (1153), 11 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:40,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:40,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 344 [2023-08-26 12:18:40,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:42,379 INFO L124 PetriNetUnfolderBase]: 5942/10034 cut-off events. [2023-08-26 12:18:42,379 INFO L125 PetriNetUnfolderBase]: For 52236/52236 co-relation queries the response was YES. [2023-08-26 12:18:42,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54245 conditions, 10034 events. 5942/10034 cut-off events. For 52236/52236 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 70525 event pairs, 822 based on Foata normal form. 4/9956 useless extension candidates. Maximal degree in co-relation 54202. Up to 6206 conditions per place. [2023-08-26 12:18:42,453 INFO L140 encePairwiseOnDemand]: 331/344 looper letters, 222 selfloop transitions, 139 changer transitions 6/368 dead transitions. [2023-08-26 12:18:42,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 368 transitions, 4911 flow [2023-08-26 12:18:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 12:18:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 12:18:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1576 transitions. [2023-08-26 12:18:42,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3272425249169435 [2023-08-26 12:18:42,460 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1576 transitions. [2023-08-26 12:18:42,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1576 transitions. [2023-08-26 12:18:42,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:42,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1576 transitions. [2023-08-26 12:18:42,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 112.57142857142857) internal successors, (1576), 14 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:42,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 344.0) internal successors, (5160), 15 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:42,468 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 344.0) internal successors, (5160), 15 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:42,468 INFO L175 Difference]: Start difference. First operand has 130 places, 217 transitions, 2833 flow. Second operand 14 states and 1576 transitions. [2023-08-26 12:18:42,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 368 transitions, 4911 flow [2023-08-26 12:18:42,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 368 transitions, 4786 flow, removed 62 selfloop flow, removed 1 redundant places. [2023-08-26 12:18:42,839 INFO L231 Difference]: Finished difference. Result has 146 places, 249 transitions, 3677 flow [2023-08-26 12:18:42,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2740, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3677, PETRI_PLACES=146, PETRI_TRANSITIONS=249} [2023-08-26 12:18:42,839 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 58 predicate places. [2023-08-26 12:18:42,840 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 249 transitions, 3677 flow [2023-08-26 12:18:42,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.81818181818181) internal successors, (1153), 11 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:42,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:42,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:42,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:18:42,840 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:42,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash -646238121, now seen corresponding path program 3 times [2023-08-26 12:18:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510093558] [2023-08-26 12:18:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:44,193 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 12:18:44,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:44,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510093558] [2023-08-26 12:18:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510093558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:44,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:44,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 12:18:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390993977] [2023-08-26 12:18:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:44,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 12:18:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 12:18:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-26 12:18:44,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 344 [2023-08-26 12:18:44,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 249 transitions, 3677 flow. Second operand has 11 states, 11 states have (on average 103.81818181818181) internal successors, (1142), 11 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:44,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:44,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 344 [2023-08-26 12:18:44,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:46,590 INFO L124 PetriNetUnfolderBase]: 8491/14563 cut-off events. [2023-08-26 12:18:46,590 INFO L125 PetriNetUnfolderBase]: For 87920/87920 co-relation queries the response was YES. [2023-08-26 12:18:46,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81049 conditions, 14563 events. 8491/14563 cut-off events. For 87920/87920 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 112160 event pairs, 537 based on Foata normal form. 83/14533 useless extension candidates. Maximal degree in co-relation 81002. Up to 5014 conditions per place. [2023-08-26 12:18:46,720 INFO L140 encePairwiseOnDemand]: 327/344 looper letters, 227 selfloop transitions, 204 changer transitions 58/490 dead transitions. [2023-08-26 12:18:46,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 490 transitions, 7215 flow [2023-08-26 12:18:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 12:18:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 12:18:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1823 transitions. [2023-08-26 12:18:46,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3312136627906977 [2023-08-26 12:18:46,722 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1823 transitions. [2023-08-26 12:18:46,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1823 transitions. [2023-08-26 12:18:46,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:46,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1823 transitions. [2023-08-26 12:18:46,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 113.9375) internal successors, (1823), 16 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:46,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 344.0) internal successors, (5848), 17 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:46,729 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 344.0) internal successors, (5848), 17 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:46,729 INFO L175 Difference]: Start difference. First operand has 146 places, 249 transitions, 3677 flow. Second operand 16 states and 1823 transitions. [2023-08-26 12:18:46,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 490 transitions, 7215 flow [2023-08-26 12:18:47,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 490 transitions, 7050 flow, removed 80 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:47,570 INFO L231 Difference]: Finished difference. Result has 169 places, 313 transitions, 5327 flow [2023-08-26 12:18:47,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=3584, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5327, PETRI_PLACES=169, PETRI_TRANSITIONS=313} [2023-08-26 12:18:47,570 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 81 predicate places. [2023-08-26 12:18:47,570 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 313 transitions, 5327 flow [2023-08-26 12:18:47,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.81818181818181) internal successors, (1142), 11 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:47,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:47,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:47,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:18:47,571 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:47,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1651397969, now seen corresponding path program 4 times [2023-08-26 12:18:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:47,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204587221] [2023-08-26 12:18:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:47,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:48,878 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 12:18:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:48,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204587221] [2023-08-26 12:18:48,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204587221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:48,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:48,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:18:48,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658481849] [2023-08-26 12:18:48,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:48,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:18:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:48,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:18:48,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:18:48,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 344 [2023-08-26 12:18:48,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 313 transitions, 5327 flow. Second operand has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:48,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:48,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 344 [2023-08-26 12:18:48,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:51,815 INFO L124 PetriNetUnfolderBase]: 8680/15047 cut-off events. [2023-08-26 12:18:51,816 INFO L125 PetriNetUnfolderBase]: For 112018/112018 co-relation queries the response was YES. [2023-08-26 12:18:51,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89435 conditions, 15047 events. 8680/15047 cut-off events. For 112018/112018 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 117838 event pairs, 715 based on Foata normal form. 4/14938 useless extension candidates. Maximal degree in co-relation 89377. Up to 5191 conditions per place. [2023-08-26 12:18:51,959 INFO L140 encePairwiseOnDemand]: 333/344 looper letters, 264 selfloop transitions, 206 changer transitions 12/483 dead transitions. [2023-08-26 12:18:51,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 483 transitions, 7774 flow [2023-08-26 12:18:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 12:18:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 12:18:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1681 transitions. [2023-08-26 12:18:51,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3257751937984496 [2023-08-26 12:18:51,963 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1681 transitions. [2023-08-26 12:18:51,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1681 transitions. [2023-08-26 12:18:51,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:51,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1681 transitions. [2023-08-26 12:18:51,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 112.06666666666666) internal successors, (1681), 15 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:51,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 344.0) internal successors, (5504), 16 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:51,969 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 344.0) internal successors, (5504), 16 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:51,969 INFO L175 Difference]: Start difference. First operand has 169 places, 313 transitions, 5327 flow. Second operand 15 states and 1681 transitions. [2023-08-26 12:18:51,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 483 transitions, 7774 flow [2023-08-26 12:18:53,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 483 transitions, 7563 flow, removed 99 selfloop flow, removed 2 redundant places. [2023-08-26 12:18:53,008 INFO L231 Difference]: Finished difference. Result has 187 places, 329 transitions, 6079 flow [2023-08-26 12:18:53,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=5146, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6079, PETRI_PLACES=187, PETRI_TRANSITIONS=329} [2023-08-26 12:18:53,009 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 99 predicate places. [2023-08-26 12:18:53,009 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 329 transitions, 6079 flow [2023-08-26 12:18:53,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:53,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:53,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:53,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:18:53,010 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:53,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash 672792115, now seen corresponding path program 5 times [2023-08-26 12:18:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:53,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227203326] [2023-08-26 12:18:53,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:53,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:54,197 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 12:18:54,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227203326] [2023-08-26 12:18:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227203326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:18:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023139217] [2023-08-26 12:18:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:54,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:18:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:54,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:18:54,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:18:54,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 344 [2023-08-26 12:18:54,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 329 transitions, 6079 flow. Second operand has 8 states, 8 states have (on average 106.5) internal successors, (852), 8 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:54,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:54,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 344 [2023-08-26 12:18:54,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:57,235 INFO L124 PetriNetUnfolderBase]: 9640/16649 cut-off events. [2023-08-26 12:18:57,235 INFO L125 PetriNetUnfolderBase]: For 141694/141694 co-relation queries the response was YES. [2023-08-26 12:18:57,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101442 conditions, 16649 events. 9640/16649 cut-off events. For 141694/141694 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 131504 event pairs, 2078 based on Foata normal form. 15/16543 useless extension candidates. Maximal degree in co-relation 101377. Up to 11451 conditions per place. [2023-08-26 12:18:57,395 INFO L140 encePairwiseOnDemand]: 330/344 looper letters, 307 selfloop transitions, 107 changer transitions 26/441 dead transitions. [2023-08-26 12:18:57,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 441 transitions, 7994 flow [2023-08-26 12:18:57,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:18:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:18:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1051 transitions. [2023-08-26 12:18:57,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33947028423772607 [2023-08-26 12:18:57,397 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1051 transitions. [2023-08-26 12:18:57,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1051 transitions. [2023-08-26 12:18:57,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:57,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1051 transitions. [2023-08-26 12:18:57,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.77777777777777) internal successors, (1051), 9 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:57,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 344.0) internal successors, (3440), 10 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:57,400 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 344.0) internal successors, (3440), 10 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:57,400 INFO L175 Difference]: Start difference. First operand has 187 places, 329 transitions, 6079 flow. Second operand 9 states and 1051 transitions. [2023-08-26 12:18:57,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 441 transitions, 7994 flow [2023-08-26 12:18:58,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 441 transitions, 7881 flow, removed 37 selfloop flow, removed 4 redundant places. [2023-08-26 12:18:58,630 INFO L231 Difference]: Finished difference. Result has 196 places, 349 transitions, 6776 flow [2023-08-26 12:18:58,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=5982, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6776, PETRI_PLACES=196, PETRI_TRANSITIONS=349} [2023-08-26 12:18:58,631 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 108 predicate places. [2023-08-26 12:18:58,631 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 349 transitions, 6776 flow [2023-08-26 12:18:58,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.5) internal successors, (852), 8 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:58,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:58,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:58,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 12:18:58,631 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:18:58,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash -219382591, now seen corresponding path program 6 times [2023-08-26 12:18:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:58,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048658923] [2023-08-26 12:18:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:59,765 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 12:18:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:59,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048658923] [2023-08-26 12:18:59,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048658923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:59,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:59,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:18:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167573425] [2023-08-26 12:18:59,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:59,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:18:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:18:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:18:59,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 344 [2023-08-26 12:18:59,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 349 transitions, 6776 flow. Second operand has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:18:59,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:59,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 344 [2023-08-26 12:18:59,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:19:02,811 INFO L124 PetriNetUnfolderBase]: 9333/16160 cut-off events. [2023-08-26 12:19:02,811 INFO L125 PetriNetUnfolderBase]: For 154342/154342 co-relation queries the response was YES. [2023-08-26 12:19:03,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102037 conditions, 16160 events. 9333/16160 cut-off events. For 154342/154342 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 128057 event pairs, 1816 based on Foata normal form. 4/16042 useless extension candidates. Maximal degree in co-relation 101968. Up to 10133 conditions per place. [2023-08-26 12:19:03,087 INFO L140 encePairwiseOnDemand]: 331/344 looper letters, 293 selfloop transitions, 150 changer transitions 4/448 dead transitions. [2023-08-26 12:19:03,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 448 transitions, 8391 flow [2023-08-26 12:19:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:19:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:19:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1188 transitions. [2023-08-26 12:19:03,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3453488372093023 [2023-08-26 12:19:03,089 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1188 transitions. [2023-08-26 12:19:03,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1188 transitions. [2023-08-26 12:19:03,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:19:03,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1188 transitions. [2023-08-26 12:19:03,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.8) internal successors, (1188), 10 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:03,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 344.0) internal successors, (3784), 11 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:03,093 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 344.0) internal successors, (3784), 11 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:03,093 INFO L175 Difference]: Start difference. First operand has 196 places, 349 transitions, 6776 flow. Second operand 10 states and 1188 transitions. [2023-08-26 12:19:03,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 448 transitions, 8391 flow [2023-08-26 12:19:04,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 448 transitions, 8225 flow, removed 38 selfloop flow, removed 3 redundant places. [2023-08-26 12:19:04,720 INFO L231 Difference]: Finished difference. Result has 204 places, 353 transitions, 7132 flow [2023-08-26 12:19:04,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=6630, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7132, PETRI_PLACES=204, PETRI_TRANSITIONS=353} [2023-08-26 12:19:04,720 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 116 predicate places. [2023-08-26 12:19:04,720 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 353 transitions, 7132 flow [2023-08-26 12:19:04,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:04,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:19:04,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:19:04,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 12:19:04,721 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:19:04,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:19:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -217147125, now seen corresponding path program 7 times [2023-08-26 12:19:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:19:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545348123] [2023-08-26 12:19:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:19:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:19:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:19:05,853 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 12:19:05,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:19:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545348123] [2023-08-26 12:19:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545348123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:19:05,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:19:05,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:19:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448401865] [2023-08-26 12:19:05,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:19:05,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:19:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:19:05,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:19:05,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:19:05,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 344 [2023-08-26 12:19:05,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 353 transitions, 7132 flow. Second operand has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:05,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:19:05,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 344 [2023-08-26 12:19:05,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:19:09,119 INFO L124 PetriNetUnfolderBase]: 9953/17066 cut-off events. [2023-08-26 12:19:09,119 INFO L125 PetriNetUnfolderBase]: For 178270/178270 co-relation queries the response was YES. [2023-08-26 12:19:09,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107991 conditions, 17066 events. 9953/17066 cut-off events. For 178270/178270 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 134335 event pairs, 2908 based on Foata normal form. 19/16964 useless extension candidates. Maximal degree in co-relation 107920. Up to 14105 conditions per place. [2023-08-26 12:19:09,375 INFO L140 encePairwiseOnDemand]: 334/344 looper letters, 387 selfloop transitions, 24 changer transitions 3/415 dead transitions. [2023-08-26 12:19:09,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 415 transitions, 8462 flow [2023-08-26 12:19:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:19:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:19:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 918 transitions. [2023-08-26 12:19:09,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3335755813953488 [2023-08-26 12:19:09,377 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 918 transitions. [2023-08-26 12:19:09,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 918 transitions. [2023-08-26 12:19:09,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:19:09,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 918 transitions. [2023-08-26 12:19:09,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:09,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 344.0) internal successors, (3096), 9 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:09,380 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 344.0) internal successors, (3096), 9 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:09,380 INFO L175 Difference]: Start difference. First operand has 204 places, 353 transitions, 7132 flow. Second operand 8 states and 918 transitions. [2023-08-26 12:19:09,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 415 transitions, 8462 flow [2023-08-26 12:19:11,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 415 transitions, 8175 flow, removed 68 selfloop flow, removed 6 redundant places. [2023-08-26 12:19:11,088 INFO L231 Difference]: Finished difference. Result has 207 places, 363 transitions, 7093 flow [2023-08-26 12:19:11,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=6869, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7093, PETRI_PLACES=207, PETRI_TRANSITIONS=363} [2023-08-26 12:19:11,088 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 119 predicate places. [2023-08-26 12:19:11,088 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 363 transitions, 7093 flow [2023-08-26 12:19:11,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:11,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:19:11,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:19:11,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 12:19:11,089 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:19:11,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:19:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -310650206, now seen corresponding path program 1 times [2023-08-26 12:19:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:19:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479260479] [2023-08-26 12:19:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:19:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:19:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:19:11,381 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 12:19:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:19:11,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479260479] [2023-08-26 12:19:11,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479260479] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:19:11,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:19:11,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:19:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126185731] [2023-08-26 12:19:11,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:19:11,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:19:11,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:19:11,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:19:11,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:19:11,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 344 [2023-08-26 12:19:11,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 363 transitions, 7093 flow. Second operand has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:11,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:19:11,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 344 [2023-08-26 12:19:11,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:19:17,221 INFO L124 PetriNetUnfolderBase]: 19806/32902 cut-off events. [2023-08-26 12:19:17,222 INFO L125 PetriNetUnfolderBase]: For 323938/323940 co-relation queries the response was YES. [2023-08-26 12:19:17,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197867 conditions, 32902 events. 19806/32902 cut-off events. For 323938/323940 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 265107 event pairs, 4341 based on Foata normal form. 85/32767 useless extension candidates. Maximal degree in co-relation 197797. Up to 16179 conditions per place. [2023-08-26 12:19:17,908 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 773 selfloop transitions, 3 changer transitions 42/822 dead transitions. [2023-08-26 12:19:17,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 822 transitions, 16942 flow [2023-08-26 12:19:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:19:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:19:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2023-08-26 12:19:17,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46584302325581395 [2023-08-26 12:19:17,909 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 641 transitions. [2023-08-26 12:19:17,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 641 transitions. [2023-08-26 12:19:17,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:19:17,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 641 transitions. [2023-08-26 12:19:17,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.25) internal successors, (641), 4 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:17,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:17,911 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:17,911 INFO L175 Difference]: Start difference. First operand has 207 places, 363 transitions, 7093 flow. Second operand 4 states and 641 transitions. [2023-08-26 12:19:17,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 822 transitions, 16942 flow [2023-08-26 12:19:20,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 822 transitions, 16511 flow, removed 51 selfloop flow, removed 6 redundant places. [2023-08-26 12:19:20,599 INFO L231 Difference]: Finished difference. Result has 206 places, 364 transitions, 6899 flow [2023-08-26 12:19:20,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=6881, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6899, PETRI_PLACES=206, PETRI_TRANSITIONS=364} [2023-08-26 12:19:20,600 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 118 predicate places. [2023-08-26 12:19:20,600 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 364 transitions, 6899 flow [2023-08-26 12:19:20,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:20,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:19:20,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:19:20,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 12:19:20,601 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:19:20,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:19:20,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1693717186, now seen corresponding path program 2 times [2023-08-26 12:19:20,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:19:20,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218249686] [2023-08-26 12:19:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:19:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:19:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:19:20,745 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 12:19:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:19:20,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218249686] [2023-08-26 12:19:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218249686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:19:20,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:19:20,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:19:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892885528] [2023-08-26 12:19:20,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:19:20,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:19:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:19:20,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:19:20,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:19:20,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 344 [2023-08-26 12:19:20,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 364 transitions, 6899 flow. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:20,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:19:20,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 344 [2023-08-26 12:19:20,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:19:23,070 INFO L124 PetriNetUnfolderBase]: 6975/12226 cut-off events. [2023-08-26 12:19:23,070 INFO L125 PetriNetUnfolderBase]: For 108076/108264 co-relation queries the response was YES. [2023-08-26 12:19:23,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69993 conditions, 12226 events. 6975/12226 cut-off events. For 108076/108264 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 94835 event pairs, 495 based on Foata normal form. 797/12812 useless extension candidates. Maximal degree in co-relation 69922. Up to 4515 conditions per place. [2023-08-26 12:19:23,162 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 432 selfloop transitions, 13 changer transitions 57/508 dead transitions. [2023-08-26 12:19:23,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 508 transitions, 9615 flow [2023-08-26 12:19:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:19:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:19:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 770 transitions. [2023-08-26 12:19:23,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4476744186046512 [2023-08-26 12:19:23,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 770 transitions. [2023-08-26 12:19:23,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 770 transitions. [2023-08-26 12:19:23,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:19:23,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 770 transitions. [2023-08-26 12:19:23,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:23,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:23,166 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:23,166 INFO L175 Difference]: Start difference. First operand has 206 places, 364 transitions, 6899 flow. Second operand 5 states and 770 transitions. [2023-08-26 12:19:23,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 508 transitions, 9615 flow [2023-08-26 12:19:23,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 508 transitions, 9368 flow, removed 49 selfloop flow, removed 8 redundant places. [2023-08-26 12:19:23,501 INFO L231 Difference]: Finished difference. Result has 198 places, 226 transitions, 3643 flow [2023-08-26 12:19:23,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3643, PETRI_PLACES=198, PETRI_TRANSITIONS=226} [2023-08-26 12:19:23,502 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 110 predicate places. [2023-08-26 12:19:23,502 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 226 transitions, 3643 flow [2023-08-26 12:19:23,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:23,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:19:23,502 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] [2023-08-26 12:19:23,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 12:19:23,503 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:19:23,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:19:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash -186286889, now seen corresponding path program 1 times [2023-08-26 12:19:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:19:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80267859] [2023-08-26 12:19:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:19:23,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:19:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:19:23,793 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 12:19:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:19:23,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80267859] [2023-08-26 12:19:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80267859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:19:23,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:19:23,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:19:23,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371269897] [2023-08-26 12:19:23,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:19:23,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:19:23,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:19:23,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:19:23,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:19:23,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 344 [2023-08-26 12:19:23,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 226 transitions, 3643 flow. Second operand has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:23,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:19:23,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 344 [2023-08-26 12:19:23,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:19:25,295 INFO L124 PetriNetUnfolderBase]: 5605/9225 cut-off events. [2023-08-26 12:19:25,296 INFO L125 PetriNetUnfolderBase]: For 77627/77821 co-relation queries the response was YES. [2023-08-26 12:19:25,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55634 conditions, 9225 events. 5605/9225 cut-off events. For 77627/77821 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 68036 event pairs, 266 based on Foata normal form. 417/9463 useless extension candidates. Maximal degree in co-relation 55568. Up to 3350 conditions per place. [2023-08-26 12:19:25,350 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 211 selfloop transitions, 17 changer transitions 156/389 dead transitions. [2023-08-26 12:19:25,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 389 transitions, 6941 flow [2023-08-26 12:19:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:19:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:19:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2023-08-26 12:19:25,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2023-08-26 12:19:25,352 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2023-08-26 12:19:25,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2023-08-26 12:19:25,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:19:25,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2023-08-26 12:19:25,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:25,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:25,355 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:25,355 INFO L175 Difference]: Start difference. First operand has 198 places, 226 transitions, 3643 flow. Second operand 6 states and 903 transitions. [2023-08-26 12:19:25,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 389 transitions, 6941 flow [2023-08-26 12:19:25,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 389 transitions, 6206 flow, removed 78 selfloop flow, removed 30 redundant places. [2023-08-26 12:19:25,931 INFO L231 Difference]: Finished difference. Result has 151 places, 97 transitions, 1207 flow [2023-08-26 12:19:25,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1207, PETRI_PLACES=151, PETRI_TRANSITIONS=97} [2023-08-26 12:19:25,931 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 63 predicate places. [2023-08-26 12:19:25,931 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 97 transitions, 1207 flow [2023-08-26 12:19:25,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:19:25,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:19:25,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:19:25,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-26 12:19:25,932 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2023-08-26 12:19:25,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:19:25,932 INFO L85 PathProgramCache]: Analyzing trace with hash -642946877, now seen corresponding path program 1 times [2023-08-26 12:19:25,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:19:25,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271763891] [2023-08-26 12:19:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:19:25,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:19:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:19:25,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:19:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:19:26,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:19:26,091 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:19:26,092 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONASSERT (78 of 79 remaining) [2023-08-26 12:19:26,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 79 remaining) [2023-08-26 12:19:26,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 79 remaining) [2023-08-26 12:19:26,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 79 remaining) [2023-08-26 12:19:26,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 79 remaining) [2023-08-26 12:19:26,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 79 remaining) [2023-08-26 12:19:26,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 79 remaining) [2023-08-26 12:19:26,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 79 remaining) [2023-08-26 12:19:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 79 remaining) [2023-08-26 12:19:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 79 remaining) [2023-08-26 12:19:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 79 remaining) [2023-08-26 12:19:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 79 remaining) [2023-08-26 12:19:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 79 remaining) [2023-08-26 12:19:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 79 remaining) [2023-08-26 12:19:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 79 remaining) [2023-08-26 12:19:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 79 remaining) [2023-08-26 12:19:26,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 79 remaining) [2023-08-26 12:19:26,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 79 remaining) [2023-08-26 12:19:26,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 79 remaining) [2023-08-26 12:19:26,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 79 remaining) [2023-08-26 12:19:26,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 79 remaining) [2023-08-26 12:19:26,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 79 remaining) [2023-08-26 12:19:26,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 79 remaining) [2023-08-26 12:19:26,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 79 remaining) [2023-08-26 12:19:26,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 79 remaining) [2023-08-26 12:19:26,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 79 remaining) [2023-08-26 12:19:26,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 79 remaining) [2023-08-26 12:19:26,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-26 12:19:26,102 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:19:26,112 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:19:26,112 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:19:26,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:19:26 BasicIcfg [2023-08-26 12:19:26,211 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:19:26,211 INFO L158 Benchmark]: Toolchain (without parser) took 109176.74ms. Allocated memory was 367.0MB in the beginning and 8.2GB in the end (delta: 7.8GB). Free memory was 342.3MB in the beginning and 6.1GB in the end (delta: -5.7GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-08-26 12:19:26,211 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory is still 343.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:19:26,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.82ms. Allocated memory is still 367.0MB. Free memory was 342.3MB in the beginning and 317.9MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:19:26,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.37ms. Allocated memory is still 367.0MB. Free memory was 317.9MB in the beginning and 315.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:19:26,212 INFO L158 Benchmark]: Boogie Preprocessor took 61.23ms. Allocated memory is still 367.0MB. Free memory was 315.4MB in the beginning and 312.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:19:26,212 INFO L158 Benchmark]: RCFGBuilder took 989.75ms. Allocated memory was 367.0MB in the beginning and 478.2MB in the end (delta: 111.1MB). Free memory was 312.9MB in the beginning and 435.5MB in the end (delta: -122.6MB). Peak memory consumption was 50.0MB. Max. memory is 16.0GB. [2023-08-26 12:19:26,212 INFO L158 Benchmark]: TraceAbstraction took 107499.12ms. Allocated memory was 478.2MB in the beginning and 8.2GB in the end (delta: 7.7GB). Free memory was 435.5MB in the beginning and 6.1GB in the end (delta: -5.6GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-08-26 12:19:26,214 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory is still 343.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 558.82ms. Allocated memory is still 367.0MB. Free memory was 342.3MB in the beginning and 317.9MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.37ms. Allocated memory is still 367.0MB. Free memory was 317.9MB in the beginning and 315.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 61.23ms. Allocated memory is still 367.0MB. Free memory was 315.4MB in the beginning and 312.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 989.75ms. Allocated memory was 367.0MB in the beginning and 478.2MB in the end (delta: 111.1MB). Free memory was 312.9MB in the beginning and 435.5MB in the end (delta: -122.6MB). Peak memory consumption was 50.0MB. Max. memory is 16.0GB. * TraceAbstraction took 107499.12ms. Allocated memory was 478.2MB in the beginning and 8.2GB in the end (delta: 7.7GB). Free memory was 435.5MB in the beginning and 6.1GB in the end (delta: -5.6GB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 197 PlacesBefore, 88 PlacesAfterwards, 187 TransitionsBefore, 76 TransitionsAfterwards, 7814 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 153 TotalNumberOfCompositions, 35265 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13432, independent: 12787, independent conditional: 0, independent unconditional: 12787, dependent: 645, dependent conditional: 0, dependent unconditional: 645, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3286, independent: 3218, independent conditional: 0, independent unconditional: 3218, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13432, independent: 9569, independent conditional: 0, independent unconditional: 9569, dependent: 577, dependent conditional: 0, dependent unconditional: 577, unknown: 3286, unknown conditional: 0, unknown unconditional: 3286] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 440, Positive conditional cache size: 0, Positive unconditional cache size: 440, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L863] 0 pthread_t t2433; [L864] FCALL, FORK 0 pthread_create(&t2433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2433, ((void *)0), P0, ((void *)0))=-2, t2433={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L865] 0 pthread_t t2434; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2433={7:0}, t2434={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] FCALL, FORK 0 pthread_create(&t2434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2434, ((void *)0), P1, ((void *)0))=-1, t2433={7:0}, t2434={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L867] 0 pthread_t t2435; [L868] FCALL, FORK 0 pthread_create(&t2435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2435, ((void *)0), P2, ((void *)0))=0, t2433={7:0}, t2434={8:0}, t2435={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] EXPR 1 \read(y) [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L773] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L774] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L775] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L776] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L778] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L779] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L780] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L781] EXPR 1 \read(y) [L781] 1 __unbuffered_p0_EAX = y [L782] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L782] 1 y = y$flush_delayed ? y$mem_tmp : y [L783] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L786] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L869] 0 pthread_t t2436; [L810] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] FCALL, FORK 0 pthread_create(&t2436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2436, ((void *)0), P3, ((void *)0))=1, t2433={7:0}, t2434={8:0}, t2435={5:0}, t2436={6:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L814] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L815] 3 y$flush_delayed = weak$$choice2 [L816] EXPR 3 \read(y) [L816] 3 y$mem_tmp = y [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] EXPR 3 \read(y) [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L819] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L820] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L821] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L823] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 \read(y) [L824] 3 __unbuffered_p2_EBX = y [L825] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L825] 3 y = y$flush_delayed ? y$mem_tmp : y [L826] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 \read(y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 \read(y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2433={7:0}, t2434={8:0}, t2435={5:0}, t2436={6:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe027_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 250 locations, 79 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 107.2s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 81.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1598 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1598 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5047 IncrementalHoareTripleChecker+Invalid, 5484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 437 mSolverCounterUnsat, 6 mSDtfsCounter, 5047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7132occurred in iteration=23, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 5797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:19:26,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...