/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:18:26,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:18:26,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:18:26,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:18:26,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:18:26,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:18:26,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:18:26,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:18:26,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:18:26,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:18:26,782 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:18:26,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:18:26,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:18:26,783 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:18:26,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:18:26,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:18:26,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:18:26,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:18:26,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:18:26,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:18:26,784 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:18:26,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:18:26,785 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:18:26,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:18:26,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:18:26,786 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:18:26,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:18:26,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:18:26,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:18:26,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:18:26,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:18:26,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:18:26,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:18:26,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:18:26,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:18:26,788 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:18:27,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:18:27,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:18:27,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:18:27,033 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:18:27,035 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:18:27,036 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 12:18:27,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:18:28,128 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:18:28,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 12:18:28,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4068a1737/3b8679555c82474ab75e8abcd44778d2/FLAGf5427bfba [2023-08-26 12:18:28,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4068a1737/3b8679555c82474ab75e8abcd44778d2 [2023-08-26 12:18:28,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:18:28,160 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:18:28,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:18:28,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:18:28,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:18:28,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147d57de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28, skipping insertion in model container [2023-08-26 12:18:28,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,215 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:18:28,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:18:28,513 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:18:28,524 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:18:28,525 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:18:28,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:18:28,586 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:18:28,586 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:18:28,590 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:18:28,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28 WrapperNode [2023-08-26 12:18:28,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:18:28,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:18:28,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:18:28,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:18:28,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,605 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,636 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-08-26 12:18:28,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:18:28,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:18:28,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:18:28,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:18:28,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:18:28,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:18:28,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:18:28,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:18:28,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (1/1) ... [2023-08-26 12:18:28,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:18:28,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:18:28,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:18:28,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:18:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:18:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:18:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:18:28,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:18:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:18:28,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:18:28,716 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:18:28,817 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:18:28,818 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:18:29,095 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:18:29,182 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:18:29,182 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:18:29,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:18:29 BoogieIcfgContainer [2023-08-26 12:18:29,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:18:29,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:18:29,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:18:29,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:18:29,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:18:28" (1/3) ... [2023-08-26 12:18:29,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76513124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:18:29, skipping insertion in model container [2023-08-26 12:18:29,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:18:28" (2/3) ... [2023-08-26 12:18:29,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76513124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:18:29, skipping insertion in model container [2023-08-26 12:18:29,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:18:29" (3/3) ... [2023-08-26 12:18:29,190 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 12:18:29,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:18:29,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 12:18:29,201 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:18:29,239 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:18:29,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 12:18:29,325 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 12:18:29,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:18:29,329 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 12:18:29,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 12:18:29,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 113 transitions, 235 flow [2023-08-26 12:18:29,346 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:18:29,355 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 12:18:29,358 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 12:18:29,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 235 flow [2023-08-26 12:18:29,389 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 12:18:29,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:18:29,390 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 12:18:29,391 INFO L119 LiptonReduction]: Number of co-enabled transitions 2188 [2023-08-26 12:18:32,397 INFO L134 LiptonReduction]: Checked pairs total: 5990 [2023-08-26 12:18:32,397 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 12:18:32,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:18:32,409 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;@3095b104, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:18:32,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 12:18:32,410 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:18:32,410 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:18:32,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:18:32,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:32,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:18:32,411 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 12:18:32,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash 530, now seen corresponding path program 1 times [2023-08-26 12:18:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849664334] [2023-08-26 12:18:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:32,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:32,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849664334] [2023-08-26 12:18:32,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849664334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:32,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:32,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:18:32,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890330867] [2023-08-26 12:18:32,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:32,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:18:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:32,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:18:32,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:18:32,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-08-26 12:18:32,509 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 12:18:32,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:32,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-08-26 12:18:32,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:32,786 INFO L124 PetriNetUnfolderBase]: 1279/1911 cut-off events. [2023-08-26 12:18:32,787 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-26 12:18:32,790 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 12:18:32,797 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-26 12:18:32,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-26 12:18:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:18:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:18:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-26 12:18:32,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021551724137931 [2023-08-26 12:18:32,806 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-26 12:18:32,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-26 12:18:32,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:32,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-26 12:18:32,810 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 12:18:32,812 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 12:18:32,813 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 12:18:32,814 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 233 transitions. [2023-08-26 12:18:32,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-26 12:18:32,816 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 12:18:32,817 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-26 12:18:32,818 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 12:18:32,820 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-26 12:18:32,820 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-26 12:18:32,820 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 12:18:32,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:32,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:18:32,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:18:32,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:18:32,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 522612, now seen corresponding path program 1 times [2023-08-26 12:18:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:32,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377720118] [2023-08-26 12:18:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:33,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:33,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377720118] [2023-08-26 12:18:33,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377720118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:33,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:33,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:18:33,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786807854] [2023-08-26 12:18:33,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:33,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:18:33,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:33,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:18:33,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:18:33,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-26 12:18:33,033 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 12:18:33,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:33,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-26 12:18:33,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:33,188 INFO L124 PetriNetUnfolderBase]: 999/1614 cut-off events. [2023-08-26 12:18:33,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:18:33,190 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 12:18:33,195 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 31 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-08-26 12:18:33,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 164 flow [2023-08-26 12:18:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:18:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:18:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-26 12:18:33,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899425287356322 [2023-08-26 12:18:33,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-26 12:18:33,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-26 12:18:33,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:33,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-26 12:18:33,202 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 12:18:33,204 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 12:18:33,205 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 12:18:33,205 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 341 transitions. [2023-08-26 12:18:33,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 164 flow [2023-08-26 12:18:33,206 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 12:18:33,206 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-26 12:18:33,209 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 12:18:33,209 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-26 12:18:33,209 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-26 12:18:33,210 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 12:18:33,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:33,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:33,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:18:33,214 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 12:18:33,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1004148388, now seen corresponding path program 1 times [2023-08-26 12:18:33,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:33,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131343642] [2023-08-26 12:18:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:33,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:33,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:33,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131343642] [2023-08-26 12:18:33,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131343642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:33,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:33,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:18:33,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652648835] [2023-08-26 12:18:33,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:33,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:18:33,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:33,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:18:33,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:18:33,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 12:18:33,873 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 12:18:33,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:33,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 12:18:33,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:34,258 INFO L124 PetriNetUnfolderBase]: 2149/3194 cut-off events. [2023-08-26 12:18:34,259 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2023-08-26 12:18:34,262 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 12:18:34,271 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 38 selfloop transitions, 12 changer transitions 33/83 dead transitions. [2023-08-26 12:18:34,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 83 transitions, 356 flow [2023-08-26 12:18:34,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:18:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:18:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2023-08-26 12:18:34,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236453201970443 [2023-08-26 12:18:34,273 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2023-08-26 12:18:34,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2023-08-26 12:18:34,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:34,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2023-08-26 12:18:34,274 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 12:18:34,276 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 12:18:34,277 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 12:18:34,277 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 7 states and 688 transitions. [2023-08-26 12:18:34,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 83 transitions, 356 flow [2023-08-26 12:18:34,279 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 12:18:34,280 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 160 flow [2023-08-26 12:18:34,280 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 12:18:34,281 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-26 12:18:34,281 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 160 flow [2023-08-26 12:18:34,281 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 12:18:34,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:34,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:34,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:18:34,284 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 12:18:34,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1063791087, now seen corresponding path program 1 times [2023-08-26 12:18:34,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343367741] [2023-08-26 12:18:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:34,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343367741] [2023-08-26 12:18:34,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343367741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:34,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:34,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:18:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106852607] [2023-08-26 12:18:34,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:34,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:18:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:18:34,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:18:34,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-26 12:18:34,443 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 12:18:34,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:34,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-26 12:18:34,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:34,677 INFO L124 PetriNetUnfolderBase]: 1443/2269 cut-off events. [2023-08-26 12:18:34,677 INFO L125 PetriNetUnfolderBase]: For 3049/3125 co-relation queries the response was YES. [2023-08-26 12:18:34,680 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 12:18:34,687 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 38 selfloop transitions, 4 changer transitions 21/67 dead transitions. [2023-08-26 12:18:34,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 452 flow [2023-08-26 12:18:34,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:18:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:18:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-26 12:18:34,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603448275862069 [2023-08-26 12:18:34,689 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-26 12:18:34,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-26 12:18:34,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:34,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-26 12:18:34,690 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 12:18:34,692 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 12:18:34,692 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 12:18:34,692 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 160 flow. Second operand 5 states and 534 transitions. [2023-08-26 12:18:34,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 452 flow [2023-08-26 12:18:34,698 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 12:18:34,699 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 204 flow [2023-08-26 12:18:34,699 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 12:18:34,699 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-26 12:18:34,699 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 204 flow [2023-08-26 12:18:34,700 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 12:18:34,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:34,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:34,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:18:34,700 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 12:18:34,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1368466034, now seen corresponding path program 1 times [2023-08-26 12:18:34,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:34,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17589121] [2023-08-26 12:18:34,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:35,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17589121] [2023-08-26 12:18:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17589121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:35,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:35,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:18:35,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189662886] [2023-08-26 12:18:35,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:35,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:18:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:35,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:18:35,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:18:35,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 12:18:35,038 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 12:18:35,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:35,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 12:18:35,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:35,564 INFO L124 PetriNetUnfolderBase]: 2627/3958 cut-off events. [2023-08-26 12:18:35,564 INFO L125 PetriNetUnfolderBase]: For 7024/7024 co-relation queries the response was YES. [2023-08-26 12:18:35,571 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 12:18:35,583 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 49 selfloop transitions, 22 changer transitions 30/101 dead transitions. [2023-08-26 12:18:35,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 101 transitions, 723 flow [2023-08-26 12:18:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:18:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:18:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-08-26 12:18:35,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42179802955665024 [2023-08-26 12:18:35,585 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-08-26 12:18:35,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-08-26 12:18:35,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:35,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-08-26 12:18:35,586 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 12:18:35,588 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 12:18:35,588 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 12:18:35,588 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 204 flow. Second operand 7 states and 685 transitions. [2023-08-26 12:18:35,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 101 transitions, 723 flow [2023-08-26 12:18:35,598 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 12:18:35,599 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 412 flow [2023-08-26 12:18:35,599 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 12:18:35,599 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-26 12:18:35,599 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 412 flow [2023-08-26 12:18:35,599 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 12:18:35,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:35,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:35,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:18:35,600 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 12:18:35,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1370253494, now seen corresponding path program 1 times [2023-08-26 12:18:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103590573] [2023-08-26 12:18:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103590573] [2023-08-26 12:18:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103590573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:35,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:18:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436304513] [2023-08-26 12:18:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:35,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:18:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:18:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:18:35,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-26 12:18:35,818 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 12:18:35,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:35,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-26 12:18:35,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:36,147 INFO L124 PetriNetUnfolderBase]: 2221/3423 cut-off events. [2023-08-26 12:18:36,147 INFO L125 PetriNetUnfolderBase]: For 15238/15557 co-relation queries the response was YES. [2023-08-26 12:18:36,155 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 12:18:36,166 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 53 selfloop transitions, 5 changer transitions 22/90 dead transitions. [2023-08-26 12:18:36,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 90 transitions, 834 flow [2023-08-26 12:18:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:18:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:18:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2023-08-26 12:18:36,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543103448275862 [2023-08-26 12:18:36,168 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2023-08-26 12:18:36,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2023-08-26 12:18:36,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:36,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2023-08-26 12:18:36,169 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 12:18:36,170 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 12:18:36,170 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 12:18:36,171 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 412 flow. Second operand 5 states and 527 transitions. [2023-08-26 12:18:36,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 90 transitions, 834 flow [2023-08-26 12:18:36,184 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 12:18:36,185 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 455 flow [2023-08-26 12:18:36,185 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 12:18:36,186 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-26 12:18:36,186 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 455 flow [2023-08-26 12:18:36,186 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 12:18:36,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:36,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:36,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:18:36,187 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 12:18:36,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:36,187 INFO L85 PathProgramCache]: Analyzing trace with hash -676798439, now seen corresponding path program 1 times [2023-08-26 12:18:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:36,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559241588] [2023-08-26 12:18:36,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559241588] [2023-08-26 12:18:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559241588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:18:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027284989] [2023-08-26 12:18:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:36,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:18:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:36,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:18:36,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:18:36,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 12:18:36,522 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 12:18:36,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:36,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 12:18:36,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:37,124 INFO L124 PetriNetUnfolderBase]: 3427/5251 cut-off events. [2023-08-26 12:18:37,124 INFO L125 PetriNetUnfolderBase]: For 20032/20032 co-relation queries the response was YES. [2023-08-26 12:18:37,135 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 12:18:37,146 INFO L140 encePairwiseOnDemand]: 220/232 looper letters, 58 selfloop transitions, 22 changer transitions 34/114 dead transitions. [2023-08-26 12:18:37,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 1072 flow [2023-08-26 12:18:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:18:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:18:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-08-26 12:18:37,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42179802955665024 [2023-08-26 12:18:37,148 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-08-26 12:18:37,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-08-26 12:18:37,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:37,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-08-26 12:18:37,149 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 12:18:37,151 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 12:18:37,151 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 12:18:37,151 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 455 flow. Second operand 7 states and 685 transitions. [2023-08-26 12:18:37,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 1072 flow [2023-08-26 12:18:37,169 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 12:18:37,170 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 596 flow [2023-08-26 12:18:37,171 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 12:18:37,171 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-26 12:18:37,171 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 596 flow [2023-08-26 12:18:37,171 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 12:18:37,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:37,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:37,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:18:37,172 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 12:18:37,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -620665468, now seen corresponding path program 1 times [2023-08-26 12:18:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:37,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600898450] [2023-08-26 12:18:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:37,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:37,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:37,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600898450] [2023-08-26 12:18:37,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600898450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:37,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:37,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:18:37,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371916548] [2023-08-26 12:18:37,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:37,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:18:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:37,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:18:37,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:18:37,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 12:18:37,793 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 12:18:37,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:37,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 12:18:37,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:38,648 INFO L124 PetriNetUnfolderBase]: 3706/5743 cut-off events. [2023-08-26 12:18:38,648 INFO L125 PetriNetUnfolderBase]: For 38130/38130 co-relation queries the response was YES. [2023-08-26 12:18:38,661 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 12:18:38,675 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 77 selfloop transitions, 58 changer transitions 57/192 dead transitions. [2023-08-26 12:18:38,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 192 transitions, 2294 flow [2023-08-26 12:18:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:18:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:18:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 886 transitions. [2023-08-26 12:18:38,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42432950191570884 [2023-08-26 12:18:38,677 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 886 transitions. [2023-08-26 12:18:38,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 886 transitions. [2023-08-26 12:18:38,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:38,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 886 transitions. [2023-08-26 12:18:38,679 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 12:18:38,682 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 12:18:38,682 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 12:18:38,682 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 596 flow. Second operand 9 states and 886 transitions. [2023-08-26 12:18:38,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 192 transitions, 2294 flow [2023-08-26 12:18:38,738 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 12:18:38,740 INFO L231 Difference]: Finished difference. Result has 73 places, 95 transitions, 1295 flow [2023-08-26 12:18:38,741 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 12:18:38,741 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-08-26 12:18:38,741 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 95 transitions, 1295 flow [2023-08-26 12:18:38,741 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 12:18:38,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:38,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:38,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:18:38,742 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 12:18:38,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:38,742 INFO L85 PathProgramCache]: Analyzing trace with hash -620463658, now seen corresponding path program 2 times [2023-08-26 12:18:38,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:38,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979345984] [2023-08-26 12:18:38,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:39,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979345984] [2023-08-26 12:18:39,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979345984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:39,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:39,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:18:39,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52443426] [2023-08-26 12:18:39,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:39,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:18:39,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:39,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:18:39,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:18:39,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 12:18:39,221 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 12:18:39,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:39,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 12:18:39,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:39,849 INFO L124 PetriNetUnfolderBase]: 3332/5206 cut-off events. [2023-08-26 12:18:39,849 INFO L125 PetriNetUnfolderBase]: For 49289/49289 co-relation queries the response was YES. [2023-08-26 12:18:39,862 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 12:18:39,874 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 77 selfloop transitions, 42 changer transitions 56/175 dead transitions. [2023-08-26 12:18:39,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 175 transitions, 2475 flow [2023-08-26 12:18:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:18:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:18:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 782 transitions. [2023-08-26 12:18:39,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4213362068965517 [2023-08-26 12:18:39,877 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 782 transitions. [2023-08-26 12:18:39,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 782 transitions. [2023-08-26 12:18:39,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:39,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 782 transitions. [2023-08-26 12:18:39,879 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 12:18:39,881 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 12:18:39,881 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 12:18:39,881 INFO L175 Difference]: Start difference. First operand has 73 places, 95 transitions, 1295 flow. Second operand 8 states and 782 transitions. [2023-08-26 12:18:39,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 175 transitions, 2475 flow [2023-08-26 12:18:39,975 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 12:18:39,977 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 1237 flow [2023-08-26 12:18:39,978 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 12:18:39,978 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2023-08-26 12:18:39,978 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 1237 flow [2023-08-26 12:18:39,978 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 12:18:39,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:39,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:39,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:18:39,979 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 12:18:39,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1989766520, now seen corresponding path program 1 times [2023-08-26 12:18:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:39,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341054467] [2023-08-26 12:18:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:40,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:40,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341054467] [2023-08-26 12:18:40,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341054467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:40,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:40,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:18:40,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430208247] [2023-08-26 12:18:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:40,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:18:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:18:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:18:40,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-26 12:18:40,429 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 12:18:40,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:40,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-26 12:18:40,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:41,130 INFO L124 PetriNetUnfolderBase]: 2871/4504 cut-off events. [2023-08-26 12:18:41,130 INFO L125 PetriNetUnfolderBase]: For 41124/41124 co-relation queries the response was YES. [2023-08-26 12:18:41,140 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 12:18:41,149 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 79 selfloop transitions, 60 changer transitions 49/188 dead transitions. [2023-08-26 12:18:41,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 188 transitions, 2709 flow [2023-08-26 12:18:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 12:18:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 12:18:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1056 transitions. [2023-08-26 12:18:41,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2023-08-26 12:18:41,152 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1056 transitions. [2023-08-26 12:18:41,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1056 transitions. [2023-08-26 12:18:41,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:41,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1056 transitions. [2023-08-26 12:18:41,154 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 12:18:41,157 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 12:18:41,157 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 12:18:41,157 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 1237 flow. Second operand 11 states and 1056 transitions. [2023-08-26 12:18:41,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 188 transitions, 2709 flow [2023-08-26 12:18:41,213 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 12:18:41,216 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 1532 flow [2023-08-26 12:18:41,216 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 12:18:41,217 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2023-08-26 12:18:41,218 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 1532 flow [2023-08-26 12:18:41,218 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 12:18:41,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:41,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:41,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:18:41,218 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 12:18:41,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:41,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2062503188, now seen corresponding path program 1 times [2023-08-26 12:18:41,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:41,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780794273] [2023-08-26 12:18:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:41,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780794273] [2023-08-26 12:18:41,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780794273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:41,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:41,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:18:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520416904] [2023-08-26 12:18:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:41,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:18:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:41,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:18:41,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:18:41,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 12:18:41,577 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 12:18:41,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:41,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 12:18:41,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:42,270 INFO L124 PetriNetUnfolderBase]: 2805/4522 cut-off events. [2023-08-26 12:18:42,271 INFO L125 PetriNetUnfolderBase]: For 61199/61727 co-relation queries the response was YES. [2023-08-26 12:18:42,284 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 12:18:42,297 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 116 selfloop transitions, 56 changer transitions 57/244 dead transitions. [2023-08-26 12:18:42,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 244 transitions, 3957 flow [2023-08-26 12:18:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:18:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:18:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1026 transitions. [2023-08-26 12:18:42,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44224137931034485 [2023-08-26 12:18:42,299 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1026 transitions. [2023-08-26 12:18:42,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1026 transitions. [2023-08-26 12:18:42,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:42,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1026 transitions. [2023-08-26 12:18:42,302 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 12:18:42,304 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 12:18:42,304 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 12:18:42,304 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 1532 flow. Second operand 10 states and 1026 transitions. [2023-08-26 12:18:42,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 244 transitions, 3957 flow [2023-08-26 12:18:42,418 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 12:18:42,421 INFO L231 Difference]: Finished difference. Result has 91 places, 132 transitions, 2183 flow [2023-08-26 12:18:42,421 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 12:18:42,421 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2023-08-26 12:18:42,421 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 132 transitions, 2183 flow [2023-08-26 12:18:42,422 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 12:18:42,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:42,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:42,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:18:42,422 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 12:18:42,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1483853623, now seen corresponding path program 1 times [2023-08-26 12:18:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333650170] [2023-08-26 12:18:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:42,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333650170] [2023-08-26 12:18:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333650170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:18:42,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116378684] [2023-08-26 12:18:42,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:42,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:18:42,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:42,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:18:42,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:18:42,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 232 [2023-08-26 12:18:42,914 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 12:18:42,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:42,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 232 [2023-08-26 12:18:42,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:43,631 INFO L124 PetriNetUnfolderBase]: 2968/4694 cut-off events. [2023-08-26 12:18:43,631 INFO L125 PetriNetUnfolderBase]: For 56377/56377 co-relation queries the response was YES. [2023-08-26 12:18:43,644 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 12:18:43,652 INFO L140 encePairwiseOnDemand]: 219/232 looper letters, 97 selfloop transitions, 73 changer transitions 39/209 dead transitions. [2023-08-26 12:18:43,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 209 transitions, 3490 flow [2023-08-26 12:18:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 12:18:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 12:18:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 952 transitions. [2023-08-26 12:18:43,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103448275862069 [2023-08-26 12:18:43,655 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 952 transitions. [2023-08-26 12:18:43,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 952 transitions. [2023-08-26 12:18:43,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:43,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 952 transitions. [2023-08-26 12:18:43,657 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 12:18:43,659 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 12:18:43,659 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 12:18:43,659 INFO L175 Difference]: Start difference. First operand has 91 places, 132 transitions, 2183 flow. Second operand 10 states and 952 transitions. [2023-08-26 12:18:43,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 209 transitions, 3490 flow [2023-08-26 12:18:43,751 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 12:18:43,753 INFO L231 Difference]: Finished difference. Result has 100 places, 135 transitions, 2352 flow [2023-08-26 12:18:43,753 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 12:18:43,754 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2023-08-26 12:18:43,754 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 135 transitions, 2352 flow [2023-08-26 12:18:43,754 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 12:18:43,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:43,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:43,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:18:43,754 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 12:18:43,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:43,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1797093995, now seen corresponding path program 2 times [2023-08-26 12:18:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:43,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687379671] [2023-08-26 12:18:43,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687379671] [2023-08-26 12:18:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687379671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:18:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839394395] [2023-08-26 12:18:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:44,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:18:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:44,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:18:44,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:18:44,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 232 [2023-08-26 12:18:44,139 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 12:18:44,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:44,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 232 [2023-08-26 12:18:44,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:44,936 INFO L124 PetriNetUnfolderBase]: 2844/4521 cut-off events. [2023-08-26 12:18:44,937 INFO L125 PetriNetUnfolderBase]: For 68164/68164 co-relation queries the response was YES. [2023-08-26 12:18:44,953 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 12:18:44,978 INFO L140 encePairwiseOnDemand]: 222/232 looper letters, 134 selfloop transitions, 32 changer transitions 33/199 dead transitions. [2023-08-26 12:18:44,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 199 transitions, 3645 flow [2023-08-26 12:18:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:18:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:18:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 671 transitions. [2023-08-26 12:18:44,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131773399014778 [2023-08-26 12:18:44,980 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 671 transitions. [2023-08-26 12:18:44,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 671 transitions. [2023-08-26 12:18:44,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:44,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 671 transitions. [2023-08-26 12:18:44,981 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 12:18:44,983 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 12:18:44,983 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 12:18:44,983 INFO L175 Difference]: Start difference. First operand has 100 places, 135 transitions, 2352 flow. Second operand 7 states and 671 transitions. [2023-08-26 12:18:44,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 199 transitions, 3645 flow [2023-08-26 12:18:45,140 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 12:18:45,143 INFO L231 Difference]: Finished difference. Result has 100 places, 140 transitions, 2474 flow [2023-08-26 12:18:45,143 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 12:18:45,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2023-08-26 12:18:45,144 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 140 transitions, 2474 flow [2023-08-26 12:18:45,144 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 12:18:45,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:45,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:45,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:18:45,144 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 12:18:45,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2013251785, now seen corresponding path program 3 times [2023-08-26 12:18:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:45,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184546748] [2023-08-26 12:18:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:45,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184546748] [2023-08-26 12:18:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184546748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:45,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:45,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:18:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738020822] [2023-08-26 12:18:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:45,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:18:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:45,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:18:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:18:45,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 12:18:45,503 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 12:18:45,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:45,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 12:18:45,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:46,086 INFO L124 PetriNetUnfolderBase]: 2448/4028 cut-off events. [2023-08-26 12:18:46,086 INFO L125 PetriNetUnfolderBase]: For 56715/56816 co-relation queries the response was YES. [2023-08-26 12:18:46,100 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 12:18:46,108 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 110 selfloop transitions, 30 changer transitions 48/202 dead transitions. [2023-08-26 12:18:46,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 202 transitions, 3715 flow [2023-08-26 12:18:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:18:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:18:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 909 transitions. [2023-08-26 12:18:46,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353448275862069 [2023-08-26 12:18:46,110 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 909 transitions. [2023-08-26 12:18:46,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 909 transitions. [2023-08-26 12:18:46,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:46,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 909 transitions. [2023-08-26 12:18:46,112 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 12:18:46,114 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 12:18:46,114 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 12:18:46,114 INFO L175 Difference]: Start difference. First operand has 100 places, 140 transitions, 2474 flow. Second operand 9 states and 909 transitions. [2023-08-26 12:18:46,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 202 transitions, 3715 flow [2023-08-26 12:18:46,208 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 12:18:46,210 INFO L231 Difference]: Finished difference. Result has 108 places, 132 transitions, 2353 flow [2023-08-26 12:18:46,210 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 12:18:46,211 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2023-08-26 12:18:46,211 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 132 transitions, 2353 flow [2023-08-26 12:18:46,211 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 12:18:46,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:46,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:46,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:18:46,211 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 12:18:46,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 337478499, now seen corresponding path program 1 times [2023-08-26 12:18:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:46,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347651719] [2023-08-26 12:18:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:46,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 12:18:46,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347651719] [2023-08-26 12:18:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347651719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:46,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:46,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:18:46,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377755770] [2023-08-26 12:18:46,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:46,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:18:46,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:46,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:18:46,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:18:46,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 12:18:46,283 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 12:18:46,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:46,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 12:18:46,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:46,642 INFO L124 PetriNetUnfolderBase]: 1518/2661 cut-off events. [2023-08-26 12:18:46,642 INFO L125 PetriNetUnfolderBase]: For 53969/54587 co-relation queries the response was YES. [2023-08-26 12:18:46,652 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 12:18:46,658 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 138 selfloop transitions, 6 changer transitions 110/274 dead transitions. [2023-08-26 12:18:46,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 274 transitions, 5462 flow [2023-08-26 12:18:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:18:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:18:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-26 12:18:46,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44655172413793104 [2023-08-26 12:18:46,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-26 12:18:46,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-26 12:18:46,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:46,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-26 12:18:46,660 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 12:18:46,661 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 12:18:46,662 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 12:18:46,662 INFO L175 Difference]: Start difference. First operand has 108 places, 132 transitions, 2353 flow. Second operand 5 states and 518 transitions. [2023-08-26 12:18:46,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 274 transitions, 5462 flow [2023-08-26 12:18:46,715 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 12:18:46,717 INFO L231 Difference]: Finished difference. Result has 105 places, 119 transitions, 2077 flow [2023-08-26 12:18:46,718 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 12:18:46,718 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2023-08-26 12:18:46,718 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 119 transitions, 2077 flow [2023-08-26 12:18:46,718 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 12:18:46,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:46,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:46,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:18:46,718 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 12:18:46,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1854919029, now seen corresponding path program 1 times [2023-08-26 12:18:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758571053] [2023-08-26 12:18:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:46,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:46,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758571053] [2023-08-26 12:18:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758571053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:46,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:46,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:18:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467503147] [2023-08-26 12:18:46,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:46,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:18:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:46,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:18:46,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:18:46,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 12:18:46,795 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 12:18:46,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:46,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 12:18:46,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:47,069 INFO L124 PetriNetUnfolderBase]: 911/1703 cut-off events. [2023-08-26 12:18:47,069 INFO L125 PetriNetUnfolderBase]: For 32594/32927 co-relation queries the response was YES. [2023-08-26 12:18:47,074 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 12:18:47,076 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 125 selfloop transitions, 10 changer transitions 137/290 dead transitions. [2023-08-26 12:18:47,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 290 transitions, 5704 flow [2023-08-26 12:18:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:18:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:18:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 723 transitions. [2023-08-26 12:18:47,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44519704433497537 [2023-08-26 12:18:47,078 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 723 transitions. [2023-08-26 12:18:47,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 723 transitions. [2023-08-26 12:18:47,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:47,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 723 transitions. [2023-08-26 12:18:47,079 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 12:18:47,080 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 12:18:47,081 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 12:18:47,081 INFO L175 Difference]: Start difference. First operand has 105 places, 119 transitions, 2077 flow. Second operand 7 states and 723 transitions. [2023-08-26 12:18:47,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 290 transitions, 5704 flow [2023-08-26 12:18:47,116 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 12:18:47,118 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 1637 flow [2023-08-26 12:18:47,119 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 12:18:47,119 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2023-08-26 12:18:47,119 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 1637 flow [2023-08-26 12:18:47,119 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 12:18:47,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:47,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:47,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:18:47,119 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 12:18:47,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash -701653066, now seen corresponding path program 1 times [2023-08-26 12:18:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629786901] [2023-08-26 12:18:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:47,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:47,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629786901] [2023-08-26 12:18:47,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629786901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:47,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:47,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:18:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672749215] [2023-08-26 12:18:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:47,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:18:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:18:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:18:47,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 232 [2023-08-26 12:18:47,723 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 12:18:47,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:47,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 232 [2023-08-26 12:18:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:48,227 INFO L124 PetriNetUnfolderBase]: 868/1781 cut-off events. [2023-08-26 12:18:48,227 INFO L125 PetriNetUnfolderBase]: For 22523/22593 co-relation queries the response was YES. [2023-08-26 12:18:48,233 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 12:18:48,235 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 68 selfloop transitions, 23 changer transitions 51/153 dead transitions. [2023-08-26 12:18:48,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 153 transitions, 2489 flow [2023-08-26 12:18:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:18:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:18:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 794 transitions. [2023-08-26 12:18:48,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42780172413793105 [2023-08-26 12:18:48,236 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 794 transitions. [2023-08-26 12:18:48,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 794 transitions. [2023-08-26 12:18:48,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:48,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 794 transitions. [2023-08-26 12:18:48,237 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 12:18:48,240 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 12:18:48,240 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 12:18:48,240 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 1637 flow. Second operand 8 states and 794 transitions. [2023-08-26 12:18:48,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 153 transitions, 2489 flow [2023-08-26 12:18:48,285 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 12:18:48,287 INFO L231 Difference]: Finished difference. Result has 110 places, 85 transitions, 1356 flow [2023-08-26 12:18:48,288 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 12:18:48,289 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2023-08-26 12:18:48,289 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 1356 flow [2023-08-26 12:18:48,290 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 12:18:48,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:48,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:48,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:18:48,290 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 12:18:48,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash -79734397, now seen corresponding path program 1 times [2023-08-26 12:18:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104864720] [2023-08-26 12:18:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:48,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:48,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:48,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104864720] [2023-08-26 12:18:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104864720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:48,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:18:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247203510] [2023-08-26 12:18:48,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:48,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:18:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:18:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:18:48,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 12:18:48,410 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 12:18:48,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:48,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 12:18:48,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:48,583 INFO L124 PetriNetUnfolderBase]: 477/981 cut-off events. [2023-08-26 12:18:48,584 INFO L125 PetriNetUnfolderBase]: For 12138/12175 co-relation queries the response was YES. [2023-08-26 12:18:48,587 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 12:18:48,588 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 45 selfloop transitions, 10 changer transitions 122/182 dead transitions. [2023-08-26 12:18:48,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 182 transitions, 3328 flow [2023-08-26 12:18:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:18:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:18:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 804 transitions. [2023-08-26 12:18:48,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4331896551724138 [2023-08-26 12:18:48,590 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 804 transitions. [2023-08-26 12:18:48,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 804 transitions. [2023-08-26 12:18:48,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:48,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 804 transitions. [2023-08-26 12:18:48,591 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 12:18:48,592 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 12:18:48,593 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 12:18:48,593 INFO L175 Difference]: Start difference. First operand has 110 places, 85 transitions, 1356 flow. Second operand 8 states and 804 transitions. [2023-08-26 12:18:48,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 182 transitions, 3328 flow [2023-08-26 12:18:48,615 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 12:18:48,616 INFO L231 Difference]: Finished difference. Result has 97 places, 43 transitions, 544 flow [2023-08-26 12:18:48,616 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 12:18:48,616 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2023-08-26 12:18:48,617 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 43 transitions, 544 flow [2023-08-26 12:18:48,617 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 12:18:48,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:48,617 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 12:18:48,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:18:48,617 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 12:18:48,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash 853050304, now seen corresponding path program 1 times [2023-08-26 12:18:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:48,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041325218] [2023-08-26 12:18:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:18:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:18:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:18:49,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041325218] [2023-08-26 12:18:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041325218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:18:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:18:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:18:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359905404] [2023-08-26 12:18:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:18:49,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:18:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:18:49,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:18:49,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:18:49,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 232 [2023-08-26 12:18:49,716 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 12:18:49,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:18:49,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 232 [2023-08-26 12:18:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:18:50,123 INFO L124 PetriNetUnfolderBase]: 153/318 cut-off events. [2023-08-26 12:18:50,124 INFO L125 PetriNetUnfolderBase]: For 2153/2153 co-relation queries the response was YES. [2023-08-26 12:18:50,125 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 12:18:50,125 INFO L140 encePairwiseOnDemand]: 222/232 looper letters, 49 selfloop transitions, 13 changer transitions 30/92 dead transitions. [2023-08-26 12:18:50,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 1145 flow [2023-08-26 12:18:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:18:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:18:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 811 transitions. [2023-08-26 12:18:50,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38840996168582376 [2023-08-26 12:18:50,126 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 811 transitions. [2023-08-26 12:18:50,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 811 transitions. [2023-08-26 12:18:50,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:18:50,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 811 transitions. [2023-08-26 12:18:50,127 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 12:18:50,129 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 12:18:50,129 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 12:18:50,129 INFO L175 Difference]: Start difference. First operand has 97 places, 43 transitions, 544 flow. Second operand 9 states and 811 transitions. [2023-08-26 12:18:50,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 1145 flow [2023-08-26 12:18:50,134 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 12:18:50,134 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 341 flow [2023-08-26 12:18:50,134 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 12:18:50,135 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-26 12:18:50,135 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 341 flow [2023-08-26 12:18:50,135 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 12:18:50,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:18:50,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:18:50,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:18:50,135 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 12:18:50,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:18:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1679226016, now seen corresponding path program 2 times [2023-08-26 12:18:50,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:18:50,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444817856] [2023-08-26 12:18:50,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:18:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:18:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:18:50,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:18:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:18:50,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:18:50,191 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:18:50,192 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 12:18:50,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 12:18:50,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:18:50,194 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 12:18:50,197 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:18:50,197 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:18:50,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:18:50 BasicIcfg [2023-08-26 12:18:50,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:18:50,244 INFO L158 Benchmark]: Toolchain (without parser) took 22083.82ms. Allocated memory was 438.3MB in the beginning and 1.1GB in the end (delta: 677.4MB). Free memory was 391.5MB in the beginning and 781.1MB in the end (delta: -389.7MB). Peak memory consumption was 290.8MB. Max. memory is 16.0GB. [2023-08-26 12:18:50,244 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 438.3MB. Free memory was 415.5MB in the beginning and 415.4MB in the end (delta: 77.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:18:50,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.56ms. Allocated memory is still 438.3MB. Free memory was 391.4MB in the beginning and 411.4MB in the end (delta: -20.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. [2023-08-26 12:18:50,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.91ms. Allocated memory is still 438.3MB. Free memory was 411.4MB in the beginning and 408.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:18:50,245 INFO L158 Benchmark]: Boogie Preprocessor took 18.41ms. Allocated memory is still 438.3MB. Free memory was 408.8MB in the beginning and 406.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:18:50,245 INFO L158 Benchmark]: RCFGBuilder took 528.17ms. Allocated memory is still 438.3MB. Free memory was 406.7MB in the beginning and 368.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 12:18:50,245 INFO L158 Benchmark]: TraceAbstraction took 21058.51ms. Allocated memory was 438.3MB in the beginning and 1.1GB in the end (delta: 677.4MB). Free memory was 368.3MB in the beginning and 781.1MB in the end (delta: -412.8MB). Peak memory consumption was 265.4MB. Max. memory is 16.0GB. [2023-08-26 12:18:50,246 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.09ms. Allocated memory is still 438.3MB. Free memory was 415.5MB in the beginning and 415.4MB in the end (delta: 77.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 428.56ms. Allocated memory is still 438.3MB. Free memory was 391.4MB in the beginning and 411.4MB in the end (delta: -20.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.91ms. Allocated memory is still 438.3MB. Free memory was 411.4MB in the beginning and 408.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.41ms. Allocated memory is still 438.3MB. Free memory was 408.8MB in the beginning and 406.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 528.17ms. Allocated memory is still 438.3MB. Free memory was 406.7MB in the beginning and 368.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 21058.51ms. Allocated memory was 438.3MB in the beginning and 1.1GB in the end (delta: 677.4MB). Free memory was 368.3MB in the beginning and 781.1MB in the end (delta: -412.8MB). Peak memory consumption was 265.4MB. 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: 3.0s, 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.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, 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.6s 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 12:18:50,269 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...