/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:29:00,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:29:00,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:29:00,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:29:00,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:29:00,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:29:00,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:29:00,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:29:00,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:29:00,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:29:00,268 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:29:00,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:29:00,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:29:00,269 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:29:00,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:29:00,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:29:00,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:29:00,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:29:00,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:29:00,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:29:00,270 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:29:00,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:29:00,271 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:29:00,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:29:00,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:29:00,271 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:29:00,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:29:00,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:29:00,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:29:00,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:29:00,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:29:00,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:29:00,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:29:00,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:29:00,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:29:00,273 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:29:00,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:29:00,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:29:00,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:29:00,536 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:29:00,536 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:29:00,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:29:01,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:29:01,685 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:29:01,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:29:01,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e8124bcd/217e46b15a9b43fa8a6c0152bda9e9c1/FLAG30b1d6787 [2023-08-26 18:29:01,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e8124bcd/217e46b15a9b43fa8a6c0152bda9e9c1 [2023-08-26 18:29:01,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:29:01,720 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:29:01,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:29:01,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:29:01,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:29:01,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:29:01" (1/1) ... [2023-08-26 18:29:01,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b448615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:01, skipping insertion in model container [2023-08-26 18:29:01,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:29:01" (1/1) ... [2023-08-26 18:29:01,771 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:29:02,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:29:02,083 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:29:02,112 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:29:02,113 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:29:02,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:29:02,162 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:29:02,162 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:29:02,167 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:29:02,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02 WrapperNode [2023-08-26 18:29:02,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:29:02,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:29:02,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:29:02,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:29:02,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,222 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-08-26 18:29:02,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:29:02,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:29:02,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:29:02,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:29:02,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:29:02,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:29:02,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:29:02,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:29:02,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (1/1) ... [2023-08-26 18:29:02,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:29:02,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:29:02,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:29:02,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:29:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:29:02,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:29:02,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:29:02,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:29:02,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:29:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:29:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:29:02,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:29:02,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:29:02,339 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:29:02,445 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:29:02,446 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:29:02,661 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:29:02,750 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:29:02,750 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:29:02,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:29:02 BoogieIcfgContainer [2023-08-26 18:29:02,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:29:02,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:29:02,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:29:02,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:29:02,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:29:01" (1/3) ... [2023-08-26 18:29:02,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453d939f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:29:02, skipping insertion in model container [2023-08-26 18:29:02,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:29:02" (2/3) ... [2023-08-26 18:29:02,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453d939f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:29:02, skipping insertion in model container [2023-08-26 18:29:02,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:29:02" (3/3) ... [2023-08-26 18:29:02,759 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:29:02,773 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:29:02,774 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 18:29:02,774 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:29:02,818 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:29:02,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 18:29:02,899 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 18:29:02,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:29:02,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 18:29:02,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 18:29:02,906 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 113 transitions, 235 flow [2023-08-26 18:29:02,908 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:29:02,918 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 18:29:02,920 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 18:29:02,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 235 flow [2023-08-26 18:29:02,936 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 18:29:02,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:29:02,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 18:29:02,938 INFO L119 LiptonReduction]: Number of co-enabled transitions 2188 [2023-08-26 18:29:05,865 INFO L134 LiptonReduction]: Checked pairs total: 5990 [2023-08-26 18:29:05,865 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 18:29:05,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:29:05,880 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;@1902fab7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:29:05,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 18:29:05,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:29:05,882 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:29:05,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:29:05,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:05,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:29:05,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:05,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash 530, now seen corresponding path program 1 times [2023-08-26 18:29:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:05,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70633277] [2023-08-26 18:29:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:05,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70633277] [2023-08-26 18:29:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70633277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:05,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:29:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057970398] [2023-08-26 18:29:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:05,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:29:05,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:29:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:29:05,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-08-26 18:29:05,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:05,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:05,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-08-26 18:29:05,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:06,219 INFO L124 PetriNetUnfolderBase]: 1279/1911 cut-off events. [2023-08-26 18:29:06,219 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-26 18:29:06,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 1911 events. 1279/1911 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9081 event pairs, 1279 based on Foata normal form. 80/1669 useless extension candidates. Maximal degree in co-relation 3847. Up to 1891 conditions per place. [2023-08-26 18:29:06,229 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-26 18:29:06,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-26 18:29:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:29:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:29:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-26 18:29:06,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021551724137931 [2023-08-26 18:29:06,238 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-26 18:29:06,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-26 18:29:06,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:06,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-26 18:29:06,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,245 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,246 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 233 transitions. [2023-08-26 18:29:06,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-26 18:29:06,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:29:06,249 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-26 18:29:06,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-26 18:29:06,252 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-26 18:29:06,252 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-26 18:29:06,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:06,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:29:06,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:29:06,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:06,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash 522612, now seen corresponding path program 1 times [2023-08-26 18:29:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346927437] [2023-08-26 18:29:06,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:06,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:06,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:06,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346927437] [2023-08-26 18:29:06,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346927437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:06,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:06,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:29:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121305214] [2023-08-26 18:29:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:06,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:29:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:06,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:29:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:29:06,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-26 18:29:06,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:06,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-26 18:29:06,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:06,647 INFO L124 PetriNetUnfolderBase]: 999/1614 cut-off events. [2023-08-26 18:29:06,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:29:06,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 1614 events. 999/1614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8872 event pairs, 159 based on Foata normal form. 0/1478 useless extension candidates. Maximal degree in co-relation 3144. Up to 1207 conditions per place. [2023-08-26 18:29:06,654 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 31 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-08-26 18:29:06,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 164 flow [2023-08-26 18:29:06,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:29:06,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:29:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-26 18:29:06,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899425287356322 [2023-08-26 18:29:06,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-26 18:29:06,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-26 18:29:06,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:06,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-26 18:29:06,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,665 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 341 transitions. [2023-08-26 18:29:06,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 164 flow [2023-08-26 18:29:06,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:29:06,668 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-26 18:29:06,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-26 18:29:06,669 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-26 18:29:06,669 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-26 18:29:06,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:06,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:06,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:06,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:29:06,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:06,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1004148388, now seen corresponding path program 1 times [2023-08-26 18:29:06,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:06,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513161289] [2023-08-26 18:29:06,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:07,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:07,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513161289] [2023-08-26 18:29:07,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513161289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:07,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:07,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:29:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100984744] [2023-08-26 18:29:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:29:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:07,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:29:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:29:07,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 18:29:07,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:07,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:07,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 18:29:07,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:07,787 INFO L124 PetriNetUnfolderBase]: 2149/3194 cut-off events. [2023-08-26 18:29:07,787 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2023-08-26 18:29:07,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6648 conditions, 3194 events. 2149/3194 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14886 event pairs, 364 based on Foata normal form. 166/3360 useless extension candidates. Maximal degree in co-relation 6644. Up to 2084 conditions per place. [2023-08-26 18:29:07,798 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 38 selfloop transitions, 12 changer transitions 33/83 dead transitions. [2023-08-26 18:29:07,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 83 transitions, 356 flow [2023-08-26 18:29:07,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:29:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:29:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2023-08-26 18:29:07,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236453201970443 [2023-08-26 18:29:07,800 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2023-08-26 18:29:07,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2023-08-26 18:29:07,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:07,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2023-08-26 18:29:07,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:07,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:07,805 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:07,805 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 7 states and 688 transitions. [2023-08-26 18:29:07,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 83 transitions, 356 flow [2023-08-26 18:29:07,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 83 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:29:07,807 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 160 flow [2023-08-26 18:29:07,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-26 18:29:07,808 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-26 18:29:07,808 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 160 flow [2023-08-26 18:29:07,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:07,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:07,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:07,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:29:07,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:07,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1063791087, now seen corresponding path program 1 times [2023-08-26 18:29:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98686410] [2023-08-26 18:29:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98686410] [2023-08-26 18:29:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98686410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:07,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:07,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:29:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405362087] [2023-08-26 18:29:07,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:07,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:29:07,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:07,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:29:07,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:29:07,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-26 18:29:07,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:07,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:07,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-26 18:29:07,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:08,234 INFO L124 PetriNetUnfolderBase]: 1443/2269 cut-off events. [2023-08-26 18:29:08,234 INFO L125 PetriNetUnfolderBase]: For 3049/3125 co-relation queries the response was YES. [2023-08-26 18:29:08,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7541 conditions, 2269 events. 1443/2269 cut-off events. For 3049/3125 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11485 event pairs, 529 based on Foata normal form. 125/2392 useless extension candidates. Maximal degree in co-relation 7532. Up to 1847 conditions per place. [2023-08-26 18:29:08,244 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 38 selfloop transitions, 4 changer transitions 21/67 dead transitions. [2023-08-26 18:29:08,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 452 flow [2023-08-26 18:29:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:29:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:29:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-26 18:29:08,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603448275862069 [2023-08-26 18:29:08,246 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-26 18:29:08,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-26 18:29:08,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:08,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-26 18:29:08,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:08,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:08,249 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:08,249 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 160 flow. Second operand 5 states and 534 transitions. [2023-08-26 18:29:08,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 452 flow [2023-08-26 18:29:08,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 450 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:29:08,255 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 204 flow [2023-08-26 18:29:08,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 18:29:08,256 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-26 18:29:08,256 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 204 flow [2023-08-26 18:29:08,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:08,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:08,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:08,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:29:08,257 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:08,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1368466034, now seen corresponding path program 1 times [2023-08-26 18:29:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:08,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444782942] [2023-08-26 18:29:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:08,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:08,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444782942] [2023-08-26 18:29:08,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444782942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:08,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:08,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:29:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658856245] [2023-08-26 18:29:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:08,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:29:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:08,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:29:08,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:29:08,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 18:29:08,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 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 18:29:08,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:08,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 18:29:08,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:09,122 INFO L124 PetriNetUnfolderBase]: 2627/3958 cut-off events. [2023-08-26 18:29:09,122 INFO L125 PetriNetUnfolderBase]: For 7024/7024 co-relation queries the response was YES. [2023-08-26 18:29:09,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13980 conditions, 3958 events. 2627/3958 cut-off events. For 7024/7024 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20162 event pairs, 453 based on Foata normal form. 162/4120 useless extension candidates. Maximal degree in co-relation 13968. Up to 1852 conditions per place. [2023-08-26 18:29:09,143 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 49 selfloop transitions, 22 changer transitions 30/101 dead transitions. [2023-08-26 18:29:09,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 101 transitions, 723 flow [2023-08-26 18:29:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:29:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:29:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-08-26 18:29:09,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42179802955665024 [2023-08-26 18:29:09,145 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-08-26 18:29:09,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-08-26 18:29:09,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:09,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-08-26 18:29:09,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:09,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:09,149 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:09,149 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 204 flow. Second operand 7 states and 685 transitions. [2023-08-26 18:29:09,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 101 transitions, 723 flow [2023-08-26 18:29:09,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 101 transitions, 710 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 18:29:09,161 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 412 flow [2023-08-26 18:29:09,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-08-26 18:29:09,162 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-26 18:29:09,162 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 412 flow [2023-08-26 18:29:09,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 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 18:29:09,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:09,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:09,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:29:09,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:09,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1370253494, now seen corresponding path program 1 times [2023-08-26 18:29:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350883012] [2023-08-26 18:29:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:09,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350883012] [2023-08-26 18:29:09,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350883012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:09,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:09,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:29:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889293585] [2023-08-26 18:29:09,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:09,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:29:09,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:09,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:29:09,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:29:09,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-26 18:29:09,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:09,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:09,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-26 18:29:09,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:09,755 INFO L124 PetriNetUnfolderBase]: 2221/3423 cut-off events. [2023-08-26 18:29:09,755 INFO L125 PetriNetUnfolderBase]: For 15238/15557 co-relation queries the response was YES. [2023-08-26 18:29:09,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14567 conditions, 3423 events. 2221/3423 cut-off events. For 15238/15557 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18098 event pairs, 895 based on Foata normal form. 359/3734 useless extension candidates. Maximal degree in co-relation 14551. Up to 2774 conditions per place. [2023-08-26 18:29:09,776 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 53 selfloop transitions, 5 changer transitions 22/90 dead transitions. [2023-08-26 18:29:09,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 834 flow [2023-08-26 18:29:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:29:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:29:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2023-08-26 18:29:09,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543103448275862 [2023-08-26 18:29:09,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2023-08-26 18:29:09,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2023-08-26 18:29:09,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:09,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2023-08-26 18:29:09,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:09,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:09,781 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:09,781 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 412 flow. Second operand 5 states and 527 transitions. [2023-08-26 18:29:09,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 834 flow [2023-08-26 18:29:09,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 828 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 18:29:09,814 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 455 flow [2023-08-26 18:29:09,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-26 18:29:09,815 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-26 18:29:09,815 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 455 flow [2023-08-26 18:29:09,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:09,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:09,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:29:09,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:09,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -676798439, now seen corresponding path program 1 times [2023-08-26 18:29:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577639098] [2023-08-26 18:29:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:10,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:10,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577639098] [2023-08-26 18:29:10,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577639098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:10,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:10,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:29:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128957987] [2023-08-26 18:29:10,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:10,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:29:10,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:10,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:29:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:29:10,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 18:29:10,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:10,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:10,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 18:29:10,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:10,842 INFO L124 PetriNetUnfolderBase]: 3427/5251 cut-off events. [2023-08-26 18:29:10,842 INFO L125 PetriNetUnfolderBase]: For 20032/20032 co-relation queries the response was YES. [2023-08-26 18:29:10,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22713 conditions, 5251 events. 3427/5251 cut-off events. For 20032/20032 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 28913 event pairs, 851 based on Foata normal form. 164/5415 useless extension candidates. Maximal degree in co-relation 22695. Up to 2363 conditions per place. [2023-08-26 18:29:10,863 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 58 selfloop transitions, 22 changer transitions 34/114 dead transitions. [2023-08-26 18:29:10,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 1072 flow [2023-08-26 18:29:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:29:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:29:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-08-26 18:29:10,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42179802955665024 [2023-08-26 18:29:10,865 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-08-26 18:29:10,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-08-26 18:29:10,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:10,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-08-26 18:29:10,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:10,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:10,869 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:10,869 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 455 flow. Second operand 7 states and 685 transitions. [2023-08-26 18:29:10,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 1072 flow [2023-08-26 18:29:10,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 1054 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-26 18:29:10,886 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 596 flow [2023-08-26 18:29:10,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=596, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2023-08-26 18:29:10,887 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-26 18:29:10,887 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 596 flow [2023-08-26 18:29:10,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:10,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:10,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:10,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:29:10,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:10,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash -620665468, now seen corresponding path program 1 times [2023-08-26 18:29:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791642624] [2023-08-26 18:29:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:11,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791642624] [2023-08-26 18:29:11,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791642624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:11,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:29:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101020532] [2023-08-26 18:29:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:11,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:29:11,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:11,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:29:11,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:29:11,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 18:29:11,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 596 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:11,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:11,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 18:29:11,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:12,317 INFO L124 PetriNetUnfolderBase]: 3706/5743 cut-off events. [2023-08-26 18:29:12,318 INFO L125 PetriNetUnfolderBase]: For 38130/38130 co-relation queries the response was YES. [2023-08-26 18:29:12,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27608 conditions, 5743 events. 3706/5743 cut-off events. For 38130/38130 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 32646 event pairs, 897 based on Foata normal form. 272/6015 useless extension candidates. Maximal degree in co-relation 27586. Up to 3788 conditions per place. [2023-08-26 18:29:12,347 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 77 selfloop transitions, 58 changer transitions 57/192 dead transitions. [2023-08-26 18:29:12,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 192 transitions, 2294 flow [2023-08-26 18:29:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:29:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:29:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 886 transitions. [2023-08-26 18:29:12,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42432950191570884 [2023-08-26 18:29:12,352 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 886 transitions. [2023-08-26 18:29:12,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 886 transitions. [2023-08-26 18:29:12,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:12,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 886 transitions. [2023-08-26 18:29:12,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.44444444444444) internal successors, (886), 9 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:12,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:12,357 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:12,357 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 596 flow. Second operand 9 states and 886 transitions. [2023-08-26 18:29:12,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 192 transitions, 2294 flow [2023-08-26 18:29:12,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 192 transitions, 2232 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-08-26 18:29:12,408 INFO L231 Difference]: Finished difference. Result has 73 places, 95 transitions, 1295 flow [2023-08-26 18:29:12,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1295, PETRI_PLACES=73, PETRI_TRANSITIONS=95} [2023-08-26 18:29:12,409 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-08-26 18:29:12,409 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 95 transitions, 1295 flow [2023-08-26 18:29:12,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:12,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:12,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:12,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:29:12,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:12,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -620463658, now seen corresponding path program 2 times [2023-08-26 18:29:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99102524] [2023-08-26 18:29:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99102524] [2023-08-26 18:29:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99102524] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:12,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:12,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:29:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052075556] [2023-08-26 18:29:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:12,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:29:12,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:29:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:29:12,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 18:29:12,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 95 transitions, 1295 flow. Second operand has 7 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:12,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:12,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 18:29:12,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:13,593 INFO L124 PetriNetUnfolderBase]: 3332/5206 cut-off events. [2023-08-26 18:29:13,594 INFO L125 PetriNetUnfolderBase]: For 49289/49289 co-relation queries the response was YES. [2023-08-26 18:29:13,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30182 conditions, 5206 events. 3332/5206 cut-off events. For 49289/49289 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29300 event pairs, 920 based on Foata normal form. 244/5450 useless extension candidates. Maximal degree in co-relation 30155. Up to 3576 conditions per place. [2023-08-26 18:29:13,620 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 77 selfloop transitions, 42 changer transitions 56/175 dead transitions. [2023-08-26 18:29:13,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 175 transitions, 2475 flow [2023-08-26 18:29:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:29:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:29:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 782 transitions. [2023-08-26 18:29:13,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4213362068965517 [2023-08-26 18:29:13,623 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 782 transitions. [2023-08-26 18:29:13,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 782 transitions. [2023-08-26 18:29:13,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:13,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 782 transitions. [2023-08-26 18:29:13,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:13,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:13,626 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:13,627 INFO L175 Difference]: Start difference. First operand has 73 places, 95 transitions, 1295 flow. Second operand 8 states and 782 transitions. [2023-08-26 18:29:13,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 175 transitions, 2475 flow [2023-08-26 18:29:13,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 175 transitions, 2398 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-08-26 18:29:13,709 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 1237 flow [2023-08-26 18:29:13,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1237, PETRI_PLACES=77, PETRI_TRANSITIONS=88} [2023-08-26 18:29:13,710 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2023-08-26 18:29:13,710 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 1237 flow [2023-08-26 18:29:13,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:13,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:13,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:13,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:29:13,712 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:13,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1989766520, now seen corresponding path program 1 times [2023-08-26 18:29:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404990562] [2023-08-26 18:29:13,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:14,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404990562] [2023-08-26 18:29:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404990562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:14,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:29:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718056854] [2023-08-26 18:29:14,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:14,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:29:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:14,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:29:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:29:14,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 18:29:14,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 1237 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:14,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:14,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 18:29:14,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:14,925 INFO L124 PetriNetUnfolderBase]: 2871/4504 cut-off events. [2023-08-26 18:29:14,925 INFO L125 PetriNetUnfolderBase]: For 41124/41124 co-relation queries the response was YES. [2023-08-26 18:29:14,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26565 conditions, 4504 events. 2871/4504 cut-off events. For 41124/41124 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24895 event pairs, 959 based on Foata normal form. 136/4640 useless extension candidates. Maximal degree in co-relation 26536. Up to 3239 conditions per place. [2023-08-26 18:29:14,949 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 79 selfloop transitions, 60 changer transitions 49/188 dead transitions. [2023-08-26 18:29:14,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 188 transitions, 2709 flow [2023-08-26 18:29:14,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:29:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:29:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1056 transitions. [2023-08-26 18:29:14,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2023-08-26 18:29:14,952 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1056 transitions. [2023-08-26 18:29:14,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1056 transitions. [2023-08-26 18:29:14,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:14,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1056 transitions. [2023-08-26 18:29:14,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:14,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:14,957 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:14,957 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 1237 flow. Second operand 11 states and 1056 transitions. [2023-08-26 18:29:14,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 188 transitions, 2709 flow [2023-08-26 18:29:15,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 188 transitions, 2533 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-08-26 18:29:15,015 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 1532 flow [2023-08-26 18:29:15,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1532, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2023-08-26 18:29:15,017 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2023-08-26 18:29:15,017 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 1532 flow [2023-08-26 18:29:15,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:15,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:15,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:15,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:29:15,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:15,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2062503188, now seen corresponding path program 1 times [2023-08-26 18:29:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952388696] [2023-08-26 18:29:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:15,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952388696] [2023-08-26 18:29:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952388696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:15,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:15,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:29:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734379261] [2023-08-26 18:29:15,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:15,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:29:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:29:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:29:15,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 18:29:15,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 102 transitions, 1532 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:15,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:15,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 18:29:15,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:16,039 INFO L124 PetriNetUnfolderBase]: 2805/4522 cut-off events. [2023-08-26 18:29:16,040 INFO L125 PetriNetUnfolderBase]: For 61199/61727 co-relation queries the response was YES. [2023-08-26 18:29:16,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30141 conditions, 4522 events. 2805/4522 cut-off events. For 61199/61727 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 26728 event pairs, 865 based on Foata normal form. 490/4962 useless extension candidates. Maximal degree in co-relation 30107. Up to 2935 conditions per place. [2023-08-26 18:29:16,065 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 116 selfloop transitions, 56 changer transitions 57/244 dead transitions. [2023-08-26 18:29:16,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 244 transitions, 3957 flow [2023-08-26 18:29:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:29:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:29:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1026 transitions. [2023-08-26 18:29:16,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44224137931034485 [2023-08-26 18:29:16,067 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1026 transitions. [2023-08-26 18:29:16,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1026 transitions. [2023-08-26 18:29:16,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:16,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1026 transitions. [2023-08-26 18:29:16,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.6) internal successors, (1026), 10 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:16,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:16,072 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:16,072 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 1532 flow. Second operand 10 states and 1026 transitions. [2023-08-26 18:29:16,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 244 transitions, 3957 flow [2023-08-26 18:29:16,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 244 transitions, 3873 flow, removed 42 selfloop flow, removed 5 redundant places. [2023-08-26 18:29:16,204 INFO L231 Difference]: Finished difference. Result has 91 places, 132 transitions, 2183 flow [2023-08-26 18:29:16,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2183, PETRI_PLACES=91, PETRI_TRANSITIONS=132} [2023-08-26 18:29:16,205 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2023-08-26 18:29:16,205 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 132 transitions, 2183 flow [2023-08-26 18:29:16,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:16,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:16,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:16,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:29:16,206 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:16,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:16,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1483853623, now seen corresponding path program 1 times [2023-08-26 18:29:16,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:16,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714422559] [2023-08-26 18:29:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714422559] [2023-08-26 18:29:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714422559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:29:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502991492] [2023-08-26 18:29:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:16,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:29:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:16,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:29:16,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:29:16,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 232 [2023-08-26 18:29:16,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 132 transitions, 2183 flow. Second operand has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:16,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:16,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 232 [2023-08-26 18:29:16,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:17,390 INFO L124 PetriNetUnfolderBase]: 2968/4694 cut-off events. [2023-08-26 18:29:17,390 INFO L125 PetriNetUnfolderBase]: For 56377/56377 co-relation queries the response was YES. [2023-08-26 18:29:17,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32686 conditions, 4694 events. 2968/4694 cut-off events. For 56377/56377 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26588 event pairs, 861 based on Foata normal form. 104/4798 useless extension candidates. Maximal degree in co-relation 32649. Up to 3308 conditions per place. [2023-08-26 18:29:17,414 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 97 selfloop transitions, 73 changer transitions 39/209 dead transitions. [2023-08-26 18:29:17,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 209 transitions, 3490 flow [2023-08-26 18:29:17,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:29:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:29:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 952 transitions. [2023-08-26 18:29:17,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103448275862069 [2023-08-26 18:29:17,417 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 952 transitions. [2023-08-26 18:29:17,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 952 transitions. [2023-08-26 18:29:17,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:17,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 952 transitions. [2023-08-26 18:29:17,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.2) internal successors, (952), 10 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:17,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:17,421 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:17,421 INFO L175 Difference]: Start difference. First operand has 91 places, 132 transitions, 2183 flow. Second operand 10 states and 952 transitions. [2023-08-26 18:29:17,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 209 transitions, 3490 flow [2023-08-26 18:29:17,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 209 transitions, 3444 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-26 18:29:17,508 INFO L231 Difference]: Finished difference. Result has 100 places, 135 transitions, 2352 flow [2023-08-26 18:29:17,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=2153, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2352, PETRI_PLACES=100, PETRI_TRANSITIONS=135} [2023-08-26 18:29:17,508 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2023-08-26 18:29:17,508 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 135 transitions, 2352 flow [2023-08-26 18:29:17,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:17,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:17,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:17,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:29:17,509 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:17,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1797093995, now seen corresponding path program 2 times [2023-08-26 18:29:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:17,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067069092] [2023-08-26 18:29:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:17,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:17,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067069092] [2023-08-26 18:29:17,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067069092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:17,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:17,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:29:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482362907] [2023-08-26 18:29:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:17,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:29:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:17,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:29:17,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:29:17,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 232 [2023-08-26 18:29:17,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 135 transitions, 2352 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:17,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:17,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 232 [2023-08-26 18:29:17,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:18,580 INFO L124 PetriNetUnfolderBase]: 2844/4521 cut-off events. [2023-08-26 18:29:18,581 INFO L125 PetriNetUnfolderBase]: For 68164/68164 co-relation queries the response was YES. [2023-08-26 18:29:18,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33148 conditions, 4521 events. 2844/4521 cut-off events. For 68164/68164 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 25440 event pairs, 1059 based on Foata normal form. 110/4631 useless extension candidates. Maximal degree in co-relation 33107. Up to 4009 conditions per place. [2023-08-26 18:29:18,606 INFO L140 encePairwiseOnDemand]: 222/232 looper letters, 134 selfloop transitions, 32 changer transitions 33/199 dead transitions. [2023-08-26 18:29:18,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 199 transitions, 3645 flow [2023-08-26 18:29:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:29:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:29:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 671 transitions. [2023-08-26 18:29:18,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131773399014778 [2023-08-26 18:29:18,608 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 671 transitions. [2023-08-26 18:29:18,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 671 transitions. [2023-08-26 18:29:18,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:18,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 671 transitions. [2023-08-26 18:29:18,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:18,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:18,611 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:18,611 INFO L175 Difference]: Start difference. First operand has 100 places, 135 transitions, 2352 flow. Second operand 7 states and 671 transitions. [2023-08-26 18:29:18,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 199 transitions, 3645 flow [2023-08-26 18:29:18,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 199 transitions, 3551 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-26 18:29:18,736 INFO L231 Difference]: Finished difference. Result has 100 places, 140 transitions, 2474 flow [2023-08-26 18:29:18,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2474, PETRI_PLACES=100, PETRI_TRANSITIONS=140} [2023-08-26 18:29:18,737 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2023-08-26 18:29:18,737 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 140 transitions, 2474 flow [2023-08-26 18:29:18,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:18,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:18,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:18,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:29:18,738 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:18,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2013251785, now seen corresponding path program 3 times [2023-08-26 18:29:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167357110] [2023-08-26 18:29:18,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:19,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:19,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167357110] [2023-08-26 18:29:19,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167357110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:19,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:19,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:29:19,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816010555] [2023-08-26 18:29:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:19,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:29:19,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:19,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:29:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:29:19,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 18:29:19,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 140 transitions, 2474 flow. Second operand has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:19,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:19,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 18:29:19,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:19,701 INFO L124 PetriNetUnfolderBase]: 2448/4028 cut-off events. [2023-08-26 18:29:19,701 INFO L125 PetriNetUnfolderBase]: For 56715/56816 co-relation queries the response was YES. [2023-08-26 18:29:19,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29235 conditions, 4028 events. 2448/4028 cut-off events. For 56715/56816 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23860 event pairs, 909 based on Foata normal form. 201/4141 useless extension candidates. Maximal degree in co-relation 29195. Up to 3059 conditions per place. [2023-08-26 18:29:19,725 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 110 selfloop transitions, 30 changer transitions 48/202 dead transitions. [2023-08-26 18:29:19,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 202 transitions, 3715 flow [2023-08-26 18:29:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:29:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:29:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 909 transitions. [2023-08-26 18:29:19,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353448275862069 [2023-08-26 18:29:19,727 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 909 transitions. [2023-08-26 18:29:19,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 909 transitions. [2023-08-26 18:29:19,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:19,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 909 transitions. [2023-08-26 18:29:19,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.0) internal successors, (909), 9 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:19,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:19,731 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:19,731 INFO L175 Difference]: Start difference. First operand has 100 places, 140 transitions, 2474 flow. Second operand 9 states and 909 transitions. [2023-08-26 18:29:19,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 202 transitions, 3715 flow [2023-08-26 18:29:19,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 202 transitions, 3649 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-08-26 18:29:19,817 INFO L231 Difference]: Finished difference. Result has 108 places, 132 transitions, 2353 flow [2023-08-26 18:29:19,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=2422, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2353, PETRI_PLACES=108, PETRI_TRANSITIONS=132} [2023-08-26 18:29:19,817 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2023-08-26 18:29:19,817 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 132 transitions, 2353 flow [2023-08-26 18:29:19,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:19,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:19,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:19,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:29:19,818 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:19,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:19,818 INFO L85 PathProgramCache]: Analyzing trace with hash 337478499, now seen corresponding path program 1 times [2023-08-26 18:29:19,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:19,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825635257] [2023-08-26 18:29:19,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:19,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:19,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825635257] [2023-08-26 18:29:19,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825635257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:19,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:19,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:29:19,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470969982] [2023-08-26 18:29:19,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:19,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:29:19,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:19,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:29:19,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:29:19,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 18:29:19,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 132 transitions, 2353 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:19,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:19,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 18:29:19,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:20,244 INFO L124 PetriNetUnfolderBase]: 1518/2661 cut-off events. [2023-08-26 18:29:20,244 INFO L125 PetriNetUnfolderBase]: For 53969/54587 co-relation queries the response was YES. [2023-08-26 18:29:20,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19358 conditions, 2661 events. 1518/2661 cut-off events. For 53969/54587 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 16521 event pairs, 264 based on Foata normal form. 668/3293 useless extension candidates. Maximal degree in co-relation 19314. Up to 1555 conditions per place. [2023-08-26 18:29:20,259 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 138 selfloop transitions, 6 changer transitions 110/274 dead transitions. [2023-08-26 18:29:20,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 274 transitions, 5462 flow [2023-08-26 18:29:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:29:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:29:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-26 18:29:20,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44655172413793104 [2023-08-26 18:29:20,261 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-26 18:29:20,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-26 18:29:20,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:20,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-26 18:29:20,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,263 INFO L175 Difference]: Start difference. First operand has 108 places, 132 transitions, 2353 flow. Second operand 5 states and 518 transitions. [2023-08-26 18:29:20,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 274 transitions, 5462 flow [2023-08-26 18:29:20,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 274 transitions, 5350 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-26 18:29:20,312 INFO L231 Difference]: Finished difference. Result has 105 places, 119 transitions, 2077 flow [2023-08-26 18:29:20,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2077, PETRI_PLACES=105, PETRI_TRANSITIONS=119} [2023-08-26 18:29:20,312 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2023-08-26 18:29:20,312 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 119 transitions, 2077 flow [2023-08-26 18:29:20,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:20,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:20,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:29:20,313 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:20,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:20,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1854919029, now seen corresponding path program 1 times [2023-08-26 18:29:20,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:20,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349320453] [2023-08-26 18:29:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:20,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:20,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349320453] [2023-08-26 18:29:20,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349320453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:20,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:20,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:29:20,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041337746] [2023-08-26 18:29:20,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:20,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:29:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:20,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:29:20,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:29:20,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 18:29:20,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 119 transitions, 2077 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:20,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 18:29:20,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:20,662 INFO L124 PetriNetUnfolderBase]: 911/1703 cut-off events. [2023-08-26 18:29:20,663 INFO L125 PetriNetUnfolderBase]: For 32594/32927 co-relation queries the response was YES. [2023-08-26 18:29:20,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12703 conditions, 1703 events. 911/1703 cut-off events. For 32594/32927 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10446 event pairs, 59 based on Foata normal form. 356/2042 useless extension candidates. Maximal degree in co-relation 12660. Up to 813 conditions per place. [2023-08-26 18:29:20,671 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 125 selfloop transitions, 10 changer transitions 137/290 dead transitions. [2023-08-26 18:29:20,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 290 transitions, 5704 flow [2023-08-26 18:29:20,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:29:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:29:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 723 transitions. [2023-08-26 18:29:20,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44519704433497537 [2023-08-26 18:29:20,673 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 723 transitions. [2023-08-26 18:29:20,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 723 transitions. [2023-08-26 18:29:20,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:20,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 723 transitions. [2023-08-26 18:29:20,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,678 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,678 INFO L175 Difference]: Start difference. First operand has 105 places, 119 transitions, 2077 flow. Second operand 7 states and 723 transitions. [2023-08-26 18:29:20,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 290 transitions, 5704 flow [2023-08-26 18:29:20,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 290 transitions, 5573 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-26 18:29:20,712 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 1637 flow [2023-08-26 18:29:20,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1637, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2023-08-26 18:29:20,712 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2023-08-26 18:29:20,712 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 1637 flow [2023-08-26 18:29:20,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:20,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:20,713 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 18:29:20,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:29:20,713 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:20,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash -701653066, now seen corresponding path program 1 times [2023-08-26 18:29:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531779494] [2023-08-26 18:29:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531779494] [2023-08-26 18:29:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531779494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:21,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:29:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147482330] [2023-08-26 18:29:21,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:21,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:29:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:29:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:29:21,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-26 18:29:21,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 1637 flow. Second operand has 9 states, 9 states have (on average 94.0) internal successors, (846), 9 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:21,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:21,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-26 18:29:21,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:21,816 INFO L124 PetriNetUnfolderBase]: 868/1781 cut-off events. [2023-08-26 18:29:21,817 INFO L125 PetriNetUnfolderBase]: For 22523/22593 co-relation queries the response was YES. [2023-08-26 18:29:21,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13854 conditions, 1781 events. 868/1781 cut-off events. For 22523/22593 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11448 event pairs, 82 based on Foata normal form. 63/1829 useless extension candidates. Maximal degree in co-relation 13810. Up to 990 conditions per place. [2023-08-26 18:29:21,826 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 68 selfloop transitions, 23 changer transitions 51/153 dead transitions. [2023-08-26 18:29:21,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 153 transitions, 2489 flow [2023-08-26 18:29:21,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:29:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:29:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 794 transitions. [2023-08-26 18:29:21,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42780172413793105 [2023-08-26 18:29:21,828 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 794 transitions. [2023-08-26 18:29:21,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 794 transitions. [2023-08-26 18:29:21,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:21,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 794 transitions. [2023-08-26 18:29:21,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.25) internal successors, (794), 8 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:21,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:21,831 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:21,831 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 1637 flow. Second operand 8 states and 794 transitions. [2023-08-26 18:29:21,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 153 transitions, 2489 flow [2023-08-26 18:29:21,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 153 transitions, 2301 flow, removed 61 selfloop flow, removed 8 redundant places. [2023-08-26 18:29:21,882 INFO L231 Difference]: Finished difference. Result has 110 places, 85 transitions, 1356 flow [2023-08-26 18:29:21,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1356, PETRI_PLACES=110, PETRI_TRANSITIONS=85} [2023-08-26 18:29:21,883 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2023-08-26 18:29:21,883 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 1356 flow [2023-08-26 18:29:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.0) internal successors, (846), 9 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:21,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:21,892 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 18:29:21,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:29:21,892 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:21,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash -79734397, now seen corresponding path program 1 times [2023-08-26 18:29:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718655446] [2023-08-26 18:29:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:21,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718655446] [2023-08-26 18:29:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718655446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:29:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969977631] [2023-08-26 18:29:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:21,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:29:21,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:21,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:29:21,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:29:21,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 18:29:21,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 85 transitions, 1356 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:21,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:21,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 18:29:21,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:22,174 INFO L124 PetriNetUnfolderBase]: 477/981 cut-off events. [2023-08-26 18:29:22,174 INFO L125 PetriNetUnfolderBase]: For 12138/12175 co-relation queries the response was YES. [2023-08-26 18:29:22,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7350 conditions, 981 events. 477/981 cut-off events. For 12138/12175 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5684 event pairs, 36 based on Foata normal form. 74/1048 useless extension candidates. Maximal degree in co-relation 7307. Up to 430 conditions per place. [2023-08-26 18:29:22,178 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 45 selfloop transitions, 10 changer transitions 122/182 dead transitions. [2023-08-26 18:29:22,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 182 transitions, 3328 flow [2023-08-26 18:29:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:29:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:29:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 804 transitions. [2023-08-26 18:29:22,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331896551724138 [2023-08-26 18:29:22,180 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 804 transitions. [2023-08-26 18:29:22,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 804 transitions. [2023-08-26 18:29:22,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:22,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 804 transitions. [2023-08-26 18:29:22,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:22,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:22,183 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:22,183 INFO L175 Difference]: Start difference. First operand has 110 places, 85 transitions, 1356 flow. Second operand 8 states and 804 transitions. [2023-08-26 18:29:22,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 182 transitions, 3328 flow [2023-08-26 18:29:22,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 2974 flow, removed 81 selfloop flow, removed 19 redundant places. [2023-08-26 18:29:22,204 INFO L231 Difference]: Finished difference. Result has 97 places, 43 transitions, 544 flow [2023-08-26 18:29:22,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=544, PETRI_PLACES=97, PETRI_TRANSITIONS=43} [2023-08-26 18:29:22,204 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2023-08-26 18:29:22,204 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 43 transitions, 544 flow [2023-08-26 18:29:22,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:22,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:22,204 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] [2023-08-26 18:29:22,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:29:22,205 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:22,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash 853050304, now seen corresponding path program 1 times [2023-08-26 18:29:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824985623] [2023-08-26 18:29:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:29:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:29:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:29:23,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824985623] [2023-08-26 18:29:23,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824985623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:29:23,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:29:23,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:29:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627695314] [2023-08-26 18:29:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:29:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:29:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:29:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:29:23,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:29:23,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 232 [2023-08-26 18:29:23,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 43 transitions, 544 flow. Second operand has 10 states, 10 states have (on average 85.2) internal successors, (852), 10 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 18:29:23,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:29:23,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 232 [2023-08-26 18:29:23,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:29:23,671 INFO L124 PetriNetUnfolderBase]: 153/318 cut-off events. [2023-08-26 18:29:23,671 INFO L125 PetriNetUnfolderBase]: For 2153/2153 co-relation queries the response was YES. [2023-08-26 18:29:23,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 318 events. 153/318 cut-off events. For 2153/2153 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1125 event pairs, 22 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 2070. Up to 136 conditions per place. [2023-08-26 18:29:23,672 INFO L140 encePairwiseOnDemand]: 222/232 looper letters, 49 selfloop transitions, 13 changer transitions 30/92 dead transitions. [2023-08-26 18:29:23,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 1145 flow [2023-08-26 18:29:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:29:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:29:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 811 transitions. [2023-08-26 18:29:23,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38840996168582376 [2023-08-26 18:29:23,674 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 811 transitions. [2023-08-26 18:29:23,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 811 transitions. [2023-08-26 18:29:23,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:29:23,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 811 transitions. [2023-08-26 18:29:23,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.11111111111111) internal successors, (811), 9 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:23,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:23,677 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:29:23,677 INFO L175 Difference]: Start difference. First operand has 97 places, 43 transitions, 544 flow. Second operand 9 states and 811 transitions. [2023-08-26 18:29:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 1145 flow [2023-08-26 18:29:23,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 759 flow, removed 99 selfloop flow, removed 31 redundant places. [2023-08-26 18:29:23,682 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 341 flow [2023-08-26 18:29:23,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=341, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2023-08-26 18:29:23,682 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-26 18:29:23,682 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 341 flow [2023-08-26 18:29:23,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.2) internal successors, (852), 10 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 18:29:23,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:29:23,683 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] [2023-08-26 18:29:23,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:29:23,683 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:29:23,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:29:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1679226016, now seen corresponding path program 2 times [2023-08-26 18:29:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:29:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108670797] [2023-08-26 18:29:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:29:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:29:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:29:23,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:29:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:29:23,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:29:23,757 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:29:23,757 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 18:29:23,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 18:29:23,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 18:29:23,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 18:29:23,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:29:23,759 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:29:23,763 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:29:23,763 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:29:23,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:29:23 BasicIcfg [2023-08-26 18:29:23,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:29:23,806 INFO L158 Benchmark]: Toolchain (without parser) took 22085.73ms. Allocated memory was 381.7MB in the beginning and 910.2MB in the end (delta: 528.5MB). Free memory was 354.6MB in the beginning and 550.7MB in the end (delta: -196.1MB). Peak memory consumption was 333.6MB. Max. memory is 16.0GB. [2023-08-26 18:29:23,806 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 381.7MB. Free memory was 358.3MB in the beginning and 358.3MB in the end (delta: 17.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:29:23,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.80ms. Allocated memory is still 381.7MB. Free memory was 354.6MB in the beginning and 330.6MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:29:23,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 381.7MB. Free memory was 330.6MB in the beginning and 328.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:29:23,806 INFO L158 Benchmark]: Boogie Preprocessor took 41.27ms. Allocated memory is still 381.7MB. Free memory was 328.6MB in the beginning and 326.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:29:23,807 INFO L158 Benchmark]: RCFGBuilder took 487.18ms. Allocated memory is still 381.7MB. Free memory was 326.5MB in the beginning and 287.8MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 18:29:23,807 INFO L158 Benchmark]: TraceAbstraction took 21051.27ms. Allocated memory was 381.7MB in the beginning and 910.2MB in the end (delta: 528.5MB). Free memory was 287.7MB in the beginning and 550.7MB in the end (delta: -263.0MB). Peak memory consumption was 268.6MB. Max. memory is 16.0GB. [2023-08-26 18:29:23,808 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.10ms. Allocated memory is still 381.7MB. Free memory was 358.3MB in the beginning and 358.3MB in the end (delta: 17.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 446.80ms. Allocated memory is still 381.7MB. Free memory was 354.6MB in the beginning and 330.6MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 381.7MB. Free memory was 330.6MB in the beginning and 328.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.27ms. Allocated memory is still 381.7MB. Free memory was 328.6MB in the beginning and 326.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 487.18ms. Allocated memory is still 381.7MB. Free memory was 326.5MB in the beginning and 287.8MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 21051.27ms. Allocated memory was 381.7MB in the beginning and 910.2MB in the end (delta: 528.5MB). Free memory was 287.7MB in the beginning and 550.7MB in the end (delta: -263.0MB). Peak memory consumption was 268.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 120 PlacesBefore, 41 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2188 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 5990 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2359, independent: 2194, independent conditional: 0, independent unconditional: 2194, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1154, independent: 1122, independent conditional: 0, independent unconditional: 1122, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2359, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 1154, unknown conditional: 0, unknown unconditional: 1154] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-1, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=1, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=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$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 817]: 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: 819]: 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: 821]: 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 7 procedures, 142 locations, 12 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: 20.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 697 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 697 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2555 IncrementalHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 77 mSDtfsCounter, 2555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2474occurred in iteration=13, InterpolantAutomatonStates: 137, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 4200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:29:23,823 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...