/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:16:15,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:16:15,170 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 15:16:15,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:16:15,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:16:15,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:16:15,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:16:15,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:16:15,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:16:15,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:16:15,200 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:16:15,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:16:15,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:16:15,201 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:16:15,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:16:15,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:16:15,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:16:15,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:16:15,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:16:15,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:16:15,202 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:16:15,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:16:15,203 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:16:15,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:16:15,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:16:15,203 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:16:15,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:16:15,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:16:15,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:16:15,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:16:15,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:16:15,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:16:15,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:16:15,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:16:15,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:16:15,205 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:16:15,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:16:15,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:16:15,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:16:15,454 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:16:15,454 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:16:15,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 15:16:16,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:16:16,642 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:16:16,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 15:16:16,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe37be78/7ab9f22fc54f4c699e84fde5350ccc03/FLAGe67bfba49 [2023-08-26 15:16:16,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fe37be78/7ab9f22fc54f4c699e84fde5350ccc03 [2023-08-26 15:16:16,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:16:16,666 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:16:16,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:16:16,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:16:16,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:16:16,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:16:16" (1/1) ... [2023-08-26 15:16:16,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8970ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:16, skipping insertion in model container [2023-08-26 15:16:16,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:16:16" (1/1) ... [2023-08-26 15:16:16,702 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:16:16,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:16:16,900 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:16:16,924 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:16:16,926 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:16:16,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:16:17,007 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:16:17,008 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:16:17,013 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:16:17,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17 WrapperNode [2023-08-26 15:16:17,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:16:17,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:16:17,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:16:17,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:16:17,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,073 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-26 15:16:17,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:16:17,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:16:17,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:16:17,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:16:17,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:16:17,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:16:17,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:16:17,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:16:17,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (1/1) ... [2023-08-26 15:16:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:16:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:16:17,137 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 15:16:17,145 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 15:16:17,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:16:17,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:16:17,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:16:17,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:16:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:16:17,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:16:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:16:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:16:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:16:17,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:16:17,169 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 15:16:17,295 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:16:17,301 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:16:17,542 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:16:17,675 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:16:17,675 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:16:17,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:16:17 BoogieIcfgContainer [2023-08-26 15:16:17,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:16:17,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:16:17,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:16:17,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:16:17,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:16:16" (1/3) ... [2023-08-26 15:16:17,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ff72bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:16:17, skipping insertion in model container [2023-08-26 15:16:17,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:16:17" (2/3) ... [2023-08-26 15:16:17,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ff72bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:16:17, skipping insertion in model container [2023-08-26 15:16:17,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:16:17" (3/3) ... [2023-08-26 15:16:17,686 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 15:16:17,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:16:17,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 15:16:17,700 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:16:17,744 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:16:17,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2023-08-26 15:16:17,823 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-26 15:16:17,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:16:17,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 15:16:17,827 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 118 transitions, 251 flow [2023-08-26 15:16:17,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 115 transitions, 239 flow [2023-08-26 15:16:17,832 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:16:17,847 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-26 15:16:17,849 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-26 15:16:17,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 239 flow [2023-08-26 15:16:17,882 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-26 15:16:17,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:16:17,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 15:16:17,884 INFO L119 LiptonReduction]: Number of co-enabled transitions 2188 [2023-08-26 15:16:21,085 INFO L134 LiptonReduction]: Checked pairs total: 6091 [2023-08-26 15:16:21,085 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 15:16:21,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:16:21,098 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;@4301571f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:16:21,098 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 15:16:21,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:16:21,099 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:16:21,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:16:21,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:21,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:16:21,099 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:21,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 1 times [2023-08-26 15:16:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:21,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464614818] [2023-08-26 15:16:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:21,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:21,173 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 15:16:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464614818] [2023-08-26 15:16:21,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464614818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:21,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:16:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902489994] [2023-08-26 15:16:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:21,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:16:21,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:21,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:16:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:16:21,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 234 [2023-08-26 15:16:21,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 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 15:16:21,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:21,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 234 [2023-08-26 15:16:21,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:21,462 INFO L124 PetriNetUnfolderBase]: 1381/2037 cut-off events. [2023-08-26 15:16:21,463 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 15:16:21,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4126 conditions, 2037 events. 1381/2037 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9198 event pairs, 1381 based on Foata normal form. 0/1801 useless extension candidates. Maximal degree in co-relation 4115. Up to 2033 conditions per place. [2023-08-26 15:16:21,474 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-26 15:16:21,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-08-26 15:16:21,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:16:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:16:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-08-26 15:16:21,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49786324786324787 [2023-08-26 15:16:21,486 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-08-26 15:16:21,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-08-26 15:16:21,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:21,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-08-26 15:16:21,491 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 15:16:21,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:21,494 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:21,495 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 233 transitions. [2023-08-26 15:16:21,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-08-26 15:16:21,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:16:21,498 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-26 15:16:21,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-26 15:16:21,501 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-26 15:16:21,501 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-26 15:16:21,501 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 15:16:21,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:21,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:16:21,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:16:21,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 15:16:21,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash 594108, now seen corresponding path program 1 times [2023-08-26 15:16:21,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:21,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349136165] [2023-08-26 15:16:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:21,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:21,709 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 15:16:21,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:21,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349136165] [2023-08-26 15:16:21,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349136165] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:21,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:21,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:16:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913711774] [2023-08-26 15:16:21,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:21,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:16:21,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:21,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:16:21,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:16:21,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-08-26 15:16:21,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 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 15:16:21,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:21,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-08-26 15:16:21,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:21,899 INFO L124 PetriNetUnfolderBase]: 1079/1667 cut-off events. [2023-08-26 15:16:21,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:16:21,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1667 events. 1079/1667 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7943 event pairs, 301 based on Foata normal form. 0/1586 useless extension candidates. Maximal degree in co-relation 3309. Up to 1297 conditions per place. [2023-08-26 15:16:21,906 INFO L140 encePairwiseOnDemand]: 231/234 looper letters, 33 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-26 15:16:21,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 162 flow [2023-08-26 15:16:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:16:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:16:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-26 15:16:21,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48575498575498577 [2023-08-26 15:16:21,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-26 15:16:21,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-26 15:16:21,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:21,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-26 15:16:21,914 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 15:16:21,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:21,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:21,916 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 341 transitions. [2023-08-26 15:16:21,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 162 flow [2023-08-26 15:16:21,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:16:21,920 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-26 15:16:21,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-26 15:16:21,920 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-26 15:16:21,921 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-26 15:16:21,921 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 15:16:21,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:21,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:21,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:16:21,925 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 15:16:21,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1793757261, now seen corresponding path program 1 times [2023-08-26 15:16:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:21,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906460366] [2023-08-26 15:16:21,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:21,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:22,572 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 15:16:22,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906460366] [2023-08-26 15:16:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906460366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:22,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331984732] [2023-08-26 15:16:22,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:22,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:22,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:22,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 234 [2023-08-26 15:16:22,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:22,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:22,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 234 [2023-08-26 15:16:22,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:22,844 INFO L124 PetriNetUnfolderBase]: 1197/1808 cut-off events. [2023-08-26 15:16:22,844 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-08-26 15:16:22,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 1808 events. 1197/1808 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8549 event pairs, 206 based on Foata normal form. 100/1907 useless extension candidates. Maximal degree in co-relation 3817. Up to 1389 conditions per place. [2023-08-26 15:16:22,849 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 30 selfloop transitions, 2 changer transitions 19/52 dead transitions. [2023-08-26 15:16:22,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 224 flow [2023-08-26 15:16:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-08-26 15:16:22,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42136752136752137 [2023-08-26 15:16:22,851 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-08-26 15:16:22,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-08-26 15:16:22,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:22,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-08-26 15:16:22,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:22,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:22,854 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:22,854 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 493 transitions. [2023-08-26 15:16:22,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 224 flow [2023-08-26 15:16:22,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:16:22,856 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 62 flow [2023-08-26 15:16:22,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-26 15:16:22,856 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-26 15:16:22,856 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 62 flow [2023-08-26 15:16:22,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:22,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:22,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:22,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:16:22,857 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 15:16:22,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash 228081888, now seen corresponding path program 1 times [2023-08-26 15:16:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:22,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419347056] [2023-08-26 15:16:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:23,253 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 15:16:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419347056] [2023-08-26 15:16:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419347056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:23,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109114535] [2023-08-26 15:16:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:23,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 234 [2023-08-26 15:16:23,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:23,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:23,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 234 [2023-08-26 15:16:23,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:23,814 INFO L124 PetriNetUnfolderBase]: 1775/2633 cut-off events. [2023-08-26 15:16:23,814 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2023-08-26 15:16:23,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5844 conditions, 2633 events. 1775/2633 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12254 event pairs, 204 based on Foata normal form. 128/2761 useless extension candidates. Maximal degree in co-relation 5837. Up to 1337 conditions per place. [2023-08-26 15:16:23,824 INFO L140 encePairwiseOnDemand]: 222/234 looper letters, 48 selfloop transitions, 16 changer transitions 35/99 dead transitions. [2023-08-26 15:16:23,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 99 transitions, 440 flow [2023-08-26 15:16:23,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:16:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:16:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 877 transitions. [2023-08-26 15:16:23,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4164292497625831 [2023-08-26 15:16:23,827 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 877 transitions. [2023-08-26 15:16:23,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 877 transitions. [2023-08-26 15:16:23,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:23,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 877 transitions. [2023-08-26 15:16:23,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.44444444444444) internal successors, (877), 9 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:23,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:23,832 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:23,832 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 62 flow. Second operand 9 states and 877 transitions. [2023-08-26 15:16:23,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 99 transitions, 440 flow [2023-08-26 15:16:23,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 99 transitions, 424 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 15:16:23,839 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 197 flow [2023-08-26 15:16:23,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 15:16:23,841 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-26 15:16:23,841 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 197 flow [2023-08-26 15:16:23,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:23,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:23,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:23,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:16:23,841 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 15:16:23,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1979973148, now seen corresponding path program 2 times [2023-08-26 15:16:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:23,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523852971] [2023-08-26 15:16:23,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:23,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:24,237 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 15:16:24,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:24,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523852971] [2023-08-26 15:16:24,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523852971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:24,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:24,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:16:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351813528] [2023-08-26 15:16:24,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:24,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:16:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:24,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:16:24,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:16:24,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 234 [2023-08-26 15:16:24,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 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 15:16:24,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:24,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 234 [2023-08-26 15:16:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:24,630 INFO L124 PetriNetUnfolderBase]: 1964/2918 cut-off events. [2023-08-26 15:16:24,630 INFO L125 PetriNetUnfolderBase]: For 6317/6317 co-relation queries the response was YES. [2023-08-26 15:16:24,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11133 conditions, 2918 events. 1964/2918 cut-off events. For 6317/6317 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13786 event pairs, 299 based on Foata normal form. 100/3018 useless extension candidates. Maximal degree in co-relation 11121. Up to 1283 conditions per place. [2023-08-26 15:16:24,642 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 42 selfloop transitions, 3 changer transitions 38/83 dead transitions. [2023-08-26 15:16:24,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 83 transitions, 629 flow [2023-08-26 15:16:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:16:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:16:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2023-08-26 15:16:24,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4180911680911681 [2023-08-26 15:16:24,643 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 587 transitions. [2023-08-26 15:16:24,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 587 transitions. [2023-08-26 15:16:24,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:24,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 587 transitions. [2023-08-26 15:16:24,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,678 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,678 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 197 flow. Second operand 6 states and 587 transitions. [2023-08-26 15:16:24,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 83 transitions, 629 flow [2023-08-26 15:16:24,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 616 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 15:16:24,687 INFO L231 Difference]: Finished difference. Result has 48 places, 25 transitions, 148 flow [2023-08-26 15:16:24,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=25} [2023-08-26 15:16:24,687 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-26 15:16:24,687 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 25 transitions, 148 flow [2023-08-26 15:16:24,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 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 15:16:24,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:24,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:24,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:16:24,688 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 15:16:24,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash -246799988, now seen corresponding path program 1 times [2023-08-26 15:16:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:24,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518058197] [2023-08-26 15:16:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:24,781 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 15:16:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518058197] [2023-08-26 15:16:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518058197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:24,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:24,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:16:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699530979] [2023-08-26 15:16:24,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:24,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:16:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:24,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:16:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:16:24,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 234 [2023-08-26 15:16:24,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 25 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:24,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 234 [2023-08-26 15:16:24,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:24,944 INFO L124 PetriNetUnfolderBase]: 614/967 cut-off events. [2023-08-26 15:16:24,945 INFO L125 PetriNetUnfolderBase]: For 1927/1928 co-relation queries the response was YES. [2023-08-26 15:16:24,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4021 conditions, 967 events. 614/967 cut-off events. For 1927/1928 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4173 event pairs, 140 based on Foata normal form. 45/1007 useless extension candidates. Maximal degree in co-relation 4007. Up to 699 conditions per place. [2023-08-26 15:16:24,949 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 28 selfloop transitions, 3 changer transitions 13/46 dead transitions. [2023-08-26 15:16:24,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 362 flow [2023-08-26 15:16:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-26 15:16:24,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4598290598290598 [2023-08-26 15:16:24,951 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-26 15:16:24,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-26 15:16:24,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:24,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-26 15:16:24,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,954 INFO L175 Difference]: Start difference. First operand has 48 places, 25 transitions, 148 flow. Second operand 5 states and 538 transitions. [2023-08-26 15:16:24,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 362 flow [2023-08-26 15:16:24,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 328 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-08-26 15:16:24,960 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 137 flow [2023-08-26 15:16:24,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-08-26 15:16:24,961 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-26 15:16:24,961 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 137 flow [2023-08-26 15:16:24,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:24,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:24,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:24,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:16:24,961 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 15:16:24,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash -58764608, now seen corresponding path program 1 times [2023-08-26 15:16:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:24,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136562937] [2023-08-26 15:16:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:25,306 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 15:16:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136562937] [2023-08-26 15:16:25,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136562937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:25,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:25,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:25,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581599020] [2023-08-26 15:16:25,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:25,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:25,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 234 [2023-08-26 15:16:25,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:25,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:25,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 234 [2023-08-26 15:16:25,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:25,488 INFO L124 PetriNetUnfolderBase]: 728/1131 cut-off events. [2023-08-26 15:16:25,488 INFO L125 PetriNetUnfolderBase]: For 2013/2014 co-relation queries the response was YES. [2023-08-26 15:16:25,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4332 conditions, 1131 events. 728/1131 cut-off events. For 2013/2014 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4487 event pairs, 250 based on Foata normal form. 48/1178 useless extension candidates. Maximal degree in co-relation 4320. Up to 670 conditions per place. [2023-08-26 15:16:25,494 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 31 selfloop transitions, 2 changer transitions 14/48 dead transitions. [2023-08-26 15:16:25,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 347 flow [2023-08-26 15:16:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2023-08-26 15:16:25,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153846153846154 [2023-08-26 15:16:25,495 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 486 transitions. [2023-08-26 15:16:25,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 486 transitions. [2023-08-26 15:16:25,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:25,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 486 transitions. [2023-08-26 15:16:25,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:25,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:25,498 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:25,498 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 137 flow. Second operand 5 states and 486 transitions. [2023-08-26 15:16:25,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 347 flow [2023-08-26 15:16:25,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 337 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 15:16:25,505 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 139 flow [2023-08-26 15:16:25,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2023-08-26 15:16:25,505 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-26 15:16:25,505 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 139 flow [2023-08-26 15:16:25,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:25,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:25,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:25,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:16:25,506 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 15:16:25,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1855723780, now seen corresponding path program 1 times [2023-08-26 15:16:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:25,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722963184] [2023-08-26 15:16:25,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:25,751 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 15:16:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722963184] [2023-08-26 15:16:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722963184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:25,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:25,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:16:25,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772616414] [2023-08-26 15:16:25,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:25,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:16:25,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:16:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:16:25,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 234 [2023-08-26 15:16:25,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 25 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:25,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:25,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 234 [2023-08-26 15:16:25,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:26,007 INFO L124 PetriNetUnfolderBase]: 1051/1625 cut-off events. [2023-08-26 15:16:26,007 INFO L125 PetriNetUnfolderBase]: For 2823/2823 co-relation queries the response was YES. [2023-08-26 15:16:26,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6313 conditions, 1625 events. 1051/1625 cut-off events. For 2823/2823 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7204 event pairs, 164 based on Foata normal form. 36/1661 useless extension candidates. Maximal degree in co-relation 6300. Up to 764 conditions per place. [2023-08-26 15:16:26,014 INFO L140 encePairwiseOnDemand]: 226/234 looper letters, 38 selfloop transitions, 7 changer transitions 22/68 dead transitions. [2023-08-26 15:16:26,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 514 flow [2023-08-26 15:16:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:16:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:16:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2023-08-26 15:16:26,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448005698005698 [2023-08-26 15:16:26,016 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 629 transitions. [2023-08-26 15:16:26,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions. [2023-08-26 15:16:26,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:26,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions. [2023-08-26 15:16:26,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,019 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,019 INFO L175 Difference]: Start difference. First operand has 45 places, 25 transitions, 139 flow. Second operand 6 states and 629 transitions. [2023-08-26 15:16:26,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 514 flow [2023-08-26 15:16:26,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 68 transitions, 489 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-26 15:16:26,024 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 171 flow [2023-08-26 15:16:26,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2023-08-26 15:16:26,025 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-26 15:16:26,025 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 171 flow [2023-08-26 15:16:26,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:26,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:26,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:16:26,026 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 15:16:26,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2084130064, now seen corresponding path program 2 times [2023-08-26 15:16:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:26,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676057282] [2023-08-26 15:16:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:26,386 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 15:16:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:26,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676057282] [2023-08-26 15:16:26,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676057282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:26,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:26,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:16:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104601536] [2023-08-26 15:16:26,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:26,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:16:26,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:16:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:16:26,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 234 [2023-08-26 15:16:26,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:26,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 234 [2023-08-26 15:16:26,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:26,659 INFO L124 PetriNetUnfolderBase]: 810/1278 cut-off events. [2023-08-26 15:16:26,659 INFO L125 PetriNetUnfolderBase]: For 3113/3113 co-relation queries the response was YES. [2023-08-26 15:16:26,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 1278 events. 810/1278 cut-off events. For 3113/3113 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5450 event pairs, 90 based on Foata normal form. 36/1314 useless extension candidates. Maximal degree in co-relation 5319. Up to 593 conditions per place. [2023-08-26 15:16:26,668 INFO L140 encePairwiseOnDemand]: 226/234 looper letters, 47 selfloop transitions, 8 changer transitions 20/76 dead transitions. [2023-08-26 15:16:26,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 590 flow [2023-08-26 15:16:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:16:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:16:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 835 transitions. [2023-08-26 15:16:26,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44604700854700857 [2023-08-26 15:16:26,670 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 835 transitions. [2023-08-26 15:16:26,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 835 transitions. [2023-08-26 15:16:26,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:26,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 835 transitions. [2023-08-26 15:16:26,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,675 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,675 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 171 flow. Second operand 8 states and 835 transitions. [2023-08-26 15:16:26,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 590 flow [2023-08-26 15:16:26,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 555 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-26 15:16:26,679 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 205 flow [2023-08-26 15:16:26,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=205, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2023-08-26 15:16:26,680 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-26 15:16:26,680 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 205 flow [2023-08-26 15:16:26,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:26,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:26,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:26,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:16:26,681 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 15:16:26,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:26,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1428199563, now seen corresponding path program 1 times [2023-08-26 15:16:26,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:26,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47773100] [2023-08-26 15:16:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:26,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:27,369 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 15:16:27,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:27,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47773100] [2023-08-26 15:16:27,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47773100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:27,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:27,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:16:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267001842] [2023-08-26 15:16:27,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:27,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:16:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:27,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:16:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:16:27,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 234 [2023-08-26 15:16:27,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:27,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:27,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 234 [2023-08-26 15:16:27,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:27,898 INFO L124 PetriNetUnfolderBase]: 929/1480 cut-off events. [2023-08-26 15:16:27,899 INFO L125 PetriNetUnfolderBase]: For 4337/4337 co-relation queries the response was YES. [2023-08-26 15:16:27,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6515 conditions, 1480 events. 929/1480 cut-off events. For 4337/4337 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6559 event pairs, 77 based on Foata normal form. 41/1521 useless extension candidates. Maximal degree in co-relation 6499. Up to 724 conditions per place. [2023-08-26 15:16:27,906 INFO L140 encePairwiseOnDemand]: 223/234 looper letters, 63 selfloop transitions, 29 changer transitions 15/108 dead transitions. [2023-08-26 15:16:27,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 918 flow [2023-08-26 15:16:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 15:16:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 15:16:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1081 transitions. [2023-08-26 15:16:27,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41996891996892 [2023-08-26 15:16:27,909 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1081 transitions. [2023-08-26 15:16:27,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1081 transitions. [2023-08-26 15:16:27,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:27,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1081 transitions. [2023-08-26 15:16:27,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.27272727272727) internal successors, (1081), 11 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:27,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 234.0) internal successors, (2808), 12 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:27,914 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 234.0) internal successors, (2808), 12 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:27,914 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 205 flow. Second operand 11 states and 1081 transitions. [2023-08-26 15:16:27,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 918 flow [2023-08-26 15:16:27,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 843 flow, removed 30 selfloop flow, removed 5 redundant places. [2023-08-26 15:16:27,921 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 506 flow [2023-08-26 15:16:27,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=506, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2023-08-26 15:16:27,922 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2023-08-26 15:16:27,922 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 506 flow [2023-08-26 15:16:27,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:27,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:27,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:27,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:16:27,922 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 15:16:27,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1906180810, now seen corresponding path program 1 times [2023-08-26 15:16:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:27,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923984237] [2023-08-26 15:16:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:28,316 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 15:16:28,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:28,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923984237] [2023-08-26 15:16:28,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923984237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:28,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:28,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:16:28,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391975460] [2023-08-26 15:16:28,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:28,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:16:28,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:16:28,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:16:28,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 234 [2023-08-26 15:16:28,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:28,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:28,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 234 [2023-08-26 15:16:28,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:28,628 INFO L124 PetriNetUnfolderBase]: 953/1535 cut-off events. [2023-08-26 15:16:28,628 INFO L125 PetriNetUnfolderBase]: For 7258/7258 co-relation queries the response was YES. [2023-08-26 15:16:28,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7553 conditions, 1535 events. 953/1535 cut-off events. For 7258/7258 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6949 event pairs, 270 based on Foata normal form. 50/1585 useless extension candidates. Maximal degree in co-relation 7534. Up to 1165 conditions per place. [2023-08-26 15:16:28,637 INFO L140 encePairwiseOnDemand]: 224/234 looper letters, 53 selfloop transitions, 27 changer transitions 15/96 dead transitions. [2023-08-26 15:16:28,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 1018 flow [2023-08-26 15:16:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:16:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:16:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 717 transitions. [2023-08-26 15:16:28,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43772893772893773 [2023-08-26 15:16:28,639 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 717 transitions. [2023-08-26 15:16:28,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 717 transitions. [2023-08-26 15:16:28,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:28,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 717 transitions. [2023-08-26 15:16:28,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:28,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:28,643 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:28,643 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 506 flow. Second operand 7 states and 717 transitions. [2023-08-26 15:16:28,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 1018 flow [2023-08-26 15:16:28,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 933 flow, removed 41 selfloop flow, removed 3 redundant places. [2023-08-26 15:16:28,658 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 701 flow [2023-08-26 15:16:28,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=701, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2023-08-26 15:16:28,659 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-26 15:16:28,659 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 701 flow [2023-08-26 15:16:28,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:28,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:28,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:28,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:16:28,659 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 15:16:28,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash 190484872, now seen corresponding path program 1 times [2023-08-26 15:16:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747153918] [2023-08-26 15:16:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:29,445 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 15:16:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747153918] [2023-08-26 15:16:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747153918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 15:16:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291180016] [2023-08-26 15:16:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:29,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 15:16:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 15:16:29,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-26 15:16:29,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 234 [2023-08-26 15:16:29,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 701 flow. Second operand has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:29,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 234 [2023-08-26 15:16:29,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:29,848 INFO L124 PetriNetUnfolderBase]: 1042/1698 cut-off events. [2023-08-26 15:16:29,848 INFO L125 PetriNetUnfolderBase]: For 9965/9965 co-relation queries the response was YES. [2023-08-26 15:16:29,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8622 conditions, 1698 events. 1042/1698 cut-off events. For 9965/9965 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8195 event pairs, 170 based on Foata normal form. 74/1772 useless extension candidates. Maximal degree in co-relation 8600. Up to 940 conditions per place. [2023-08-26 15:16:29,857 INFO L140 encePairwiseOnDemand]: 226/234 looper letters, 57 selfloop transitions, 46 changer transitions 31/135 dead transitions. [2023-08-26 15:16:29,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 135 transitions, 1594 flow [2023-08-26 15:16:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:16:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:16:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2023-08-26 15:16:29,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41452991452991456 [2023-08-26 15:16:29,859 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2023-08-26 15:16:29,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2023-08-26 15:16:29,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:29,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2023-08-26 15:16:29,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,863 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,863 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 701 flow. Second operand 9 states and 873 transitions. [2023-08-26 15:16:29,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 135 transitions, 1594 flow [2023-08-26 15:16:29,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 135 transitions, 1512 flow, removed 39 selfloop flow, removed 4 redundant places. [2023-08-26 15:16:29,883 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 992 flow [2023-08-26 15:16:29,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=992, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2023-08-26 15:16:29,884 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-08-26 15:16:29,884 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 992 flow [2023-08-26 15:16:29,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:29,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:29,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:29,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:16:29,885 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 15:16:29,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1324448535, now seen corresponding path program 1 times [2023-08-26 15:16:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:29,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405883210] [2023-08-26 15:16:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:29,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:30,950 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 15:16:30,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:30,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405883210] [2023-08-26 15:16:30,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405883210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:30,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:30,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:16:30,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272378278] [2023-08-26 15:16:30,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:30,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:16:30,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:30,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:16:30,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:16:30,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 234 [2023-08-26 15:16:30,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 992 flow. Second operand has 9 states, 9 states have (on average 88.77777777777777) internal successors, (799), 9 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:30,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:30,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 234 [2023-08-26 15:16:30,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:31,582 INFO L124 PetriNetUnfolderBase]: 959/1598 cut-off events. [2023-08-26 15:16:31,583 INFO L125 PetriNetUnfolderBase]: For 11233/11233 co-relation queries the response was YES. [2023-08-26 15:16:31,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8487 conditions, 1598 events. 959/1598 cut-off events. For 11233/11233 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7842 event pairs, 217 based on Foata normal form. 22/1620 useless extension candidates. Maximal degree in co-relation 8461. Up to 1239 conditions per place. [2023-08-26 15:16:31,593 INFO L140 encePairwiseOnDemand]: 223/234 looper letters, 85 selfloop transitions, 40 changer transitions 13/139 dead transitions. [2023-08-26 15:16:31,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 139 transitions, 1777 flow [2023-08-26 15:16:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 15:16:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 15:16:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 956 transitions. [2023-08-26 15:16:31,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40854700854700854 [2023-08-26 15:16:31,596 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 956 transitions. [2023-08-26 15:16:31,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 956 transitions. [2023-08-26 15:16:31,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:31,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 956 transitions. [2023-08-26 15:16:31,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.6) internal successors, (956), 10 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 234.0) internal successors, (2574), 11 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,601 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 234.0) internal successors, (2574), 11 states have internal predecessors, (2574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,601 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 992 flow. Second operand 10 states and 956 transitions. [2023-08-26 15:16:31,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 139 transitions, 1777 flow [2023-08-26 15:16:31,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 139 transitions, 1737 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-08-26 15:16:31,622 INFO L231 Difference]: Finished difference. Result has 80 places, 92 transitions, 1339 flow [2023-08-26 15:16:31,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1339, PETRI_PLACES=80, PETRI_TRANSITIONS=92} [2023-08-26 15:16:31,623 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2023-08-26 15:16:31,623 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 92 transitions, 1339 flow [2023-08-26 15:16:31,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.77777777777777) internal successors, (799), 9 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:31,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:31,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:16:31,623 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 15:16:31,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1324441808, now seen corresponding path program 2 times [2023-08-26 15:16:31,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:31,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25145463] [2023-08-26 15:16:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:16:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25145463] [2023-08-26 15:16:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25145463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:16:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967172500] [2023-08-26 15:16:31,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:31,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:16:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:16:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:16:31,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 234 [2023-08-26 15:16:31,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 92 transitions, 1339 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:31,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 234 [2023-08-26 15:16:31,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:31,937 INFO L124 PetriNetUnfolderBase]: 696/1240 cut-off events. [2023-08-26 15:16:31,937 INFO L125 PetriNetUnfolderBase]: For 15520/15549 co-relation queries the response was YES. [2023-08-26 15:16:31,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 1240 events. 696/1240 cut-off events. For 15520/15549 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6704 event pairs, 124 based on Foata normal form. 160/1396 useless extension candidates. Maximal degree in co-relation 6780. Up to 836 conditions per place. [2023-08-26 15:16:31,945 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 99 selfloop transitions, 4 changer transitions 83/190 dead transitions. [2023-08-26 15:16:31,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 190 transitions, 3078 flow [2023-08-26 15:16:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:16:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:16:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2023-08-26 15:16:31,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452991452991453 [2023-08-26 15:16:31,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2023-08-26 15:16:31,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2023-08-26 15:16:31,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:31,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2023-08-26 15:16:31,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,951 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,951 INFO L175 Difference]: Start difference. First operand has 80 places, 92 transitions, 1339 flow. Second operand 5 states and 530 transitions. [2023-08-26 15:16:31,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 190 transitions, 3078 flow [2023-08-26 15:16:31,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 190 transitions, 2640 flow, removed 111 selfloop flow, removed 12 redundant places. [2023-08-26 15:16:31,964 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 886 flow [2023-08-26 15:16:31,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=886, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2023-08-26 15:16:31,965 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-08-26 15:16:31,965 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 886 flow [2023-08-26 15:16:31,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:31,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:31,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:31,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:16:31,966 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 15:16:31,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1014888699, now seen corresponding path program 1 times [2023-08-26 15:16:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:31,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654116501] [2023-08-26 15:16:31,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:31,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:32,099 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 15:16:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654116501] [2023-08-26 15:16:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654116501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:16:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343776736] [2023-08-26 15:16:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:32,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:16:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:16:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:16:32,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 234 [2023-08-26 15:16:32,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 886 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:32,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:32,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 234 [2023-08-26 15:16:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:32,240 INFO L124 PetriNetUnfolderBase]: 326/659 cut-off events. [2023-08-26 15:16:32,241 INFO L125 PetriNetUnfolderBase]: For 7151/7166 co-relation queries the response was YES. [2023-08-26 15:16:32,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3777 conditions, 659 events. 326/659 cut-off events. For 7151/7166 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3333 event pairs, 31 based on Foata normal form. 100/756 useless extension candidates. Maximal degree in co-relation 3752. Up to 319 conditions per place. [2023-08-26 15:16:32,244 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 92 selfloop transitions, 7 changer transitions 55/157 dead transitions. [2023-08-26 15:16:32,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 157 transitions, 2200 flow [2023-08-26 15:16:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:16:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:16:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2023-08-26 15:16:32,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448005698005698 [2023-08-26 15:16:32,253 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 629 transitions. [2023-08-26 15:16:32,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions. [2023-08-26 15:16:32,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:32,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions. [2023-08-26 15:16:32,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:32,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:32,256 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 234.0) internal successors, (1638), 7 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:32,256 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 886 flow. Second operand 6 states and 629 transitions. [2023-08-26 15:16:32,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 157 transitions, 2200 flow [2023-08-26 15:16:32,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 157 transitions, 2083 flow, removed 43 selfloop flow, removed 4 redundant places. [2023-08-26 15:16:32,265 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 660 flow [2023-08-26 15:16:32,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2023-08-26 15:16:32,265 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-08-26 15:16:32,265 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 660 flow [2023-08-26 15:16:32,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:32,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:32,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:32,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:16:32,266 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 15:16:32,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1093846030, now seen corresponding path program 1 times [2023-08-26 15:16:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:32,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534706311] [2023-08-26 15:16:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:33,301 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 15:16:33,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:33,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534706311] [2023-08-26 15:16:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534706311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:33,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:33,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 15:16:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071967560] [2023-08-26 15:16:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:33,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 15:16:33,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:33,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 15:16:33,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-26 15:16:33,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 234 [2023-08-26 15:16:33,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 660 flow. Second operand has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:33,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 234 [2023-08-26 15:16:33,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:33,629 INFO L124 PetriNetUnfolderBase]: 225/479 cut-off events. [2023-08-26 15:16:33,629 INFO L125 PetriNetUnfolderBase]: For 3555/3555 co-relation queries the response was YES. [2023-08-26 15:16:33,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 479 events. 225/479 cut-off events. For 3555/3555 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2102 event pairs, 24 based on Foata normal form. 10/489 useless extension candidates. Maximal degree in co-relation 2979. Up to 201 conditions per place. [2023-08-26 15:16:33,631 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 47 selfloop transitions, 10 changer transitions 61/119 dead transitions. [2023-08-26 15:16:33,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 119 transitions, 1426 flow [2023-08-26 15:16:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:16:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:16:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 775 transitions. [2023-08-26 15:16:33,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41399572649572647 [2023-08-26 15:16:33,634 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 775 transitions. [2023-08-26 15:16:33,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 775 transitions. [2023-08-26 15:16:33,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:33,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 775 transitions. [2023-08-26 15:16:33,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.875) internal successors, (775), 8 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,639 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 234.0) internal successors, (2106), 9 states have internal predecessors, (2106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,639 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 660 flow. Second operand 8 states and 775 transitions. [2023-08-26 15:16:33,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 119 transitions, 1426 flow [2023-08-26 15:16:33,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 119 transitions, 1296 flow, removed 51 selfloop flow, removed 5 redundant places. [2023-08-26 15:16:33,646 INFO L231 Difference]: Finished difference. Result has 80 places, 46 transitions, 457 flow [2023-08-26 15:16:33,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=457, PETRI_PLACES=80, PETRI_TRANSITIONS=46} [2023-08-26 15:16:33,647 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2023-08-26 15:16:33,647 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 46 transitions, 457 flow [2023-08-26 15:16:33,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:33,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:33,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:16:33,648 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 15:16:33,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 705914422, now seen corresponding path program 2 times [2023-08-26 15:16:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265670001] [2023-08-26 15:16:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:16:33,798 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 15:16:33,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:16:33,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265670001] [2023-08-26 15:16:33,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265670001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:16:33,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:16:33,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:16:33,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734972282] [2023-08-26 15:16:33,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:16:33,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:16:33,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:16:33,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:16:33,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:16:33,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 234 [2023-08-26 15:16:33,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 46 transitions, 457 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:16:33,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 234 [2023-08-26 15:16:33,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:16:33,891 INFO L124 PetriNetUnfolderBase]: 66/152 cut-off events. [2023-08-26 15:16:33,891 INFO L125 PetriNetUnfolderBase]: For 1298/1300 co-relation queries the response was YES. [2023-08-26 15:16:33,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 152 events. 66/152 cut-off events. For 1298/1300 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 458 event pairs, 8 based on Foata normal form. 10/161 useless extension candidates. Maximal degree in co-relation 837. Up to 51 conditions per place. [2023-08-26 15:16:33,892 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 56 selfloop transitions, 10 changer transitions 9/77 dead transitions. [2023-08-26 15:16:33,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 77 transitions, 997 flow [2023-08-26 15:16:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:16:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:16:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 710 transitions. [2023-08-26 15:16:33,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43345543345543347 [2023-08-26 15:16:33,893 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 710 transitions. [2023-08-26 15:16:33,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 710 transitions. [2023-08-26 15:16:33,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:16:33,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 710 transitions. [2023-08-26 15:16:33,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,905 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,906 INFO L175 Difference]: Start difference. First operand has 80 places, 46 transitions, 457 flow. Second operand 7 states and 710 transitions. [2023-08-26 15:16:33,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 77 transitions, 997 flow [2023-08-26 15:16:33,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 77 transitions, 779 flow, removed 48 selfloop flow, removed 17 redundant places. [2023-08-26 15:16:33,909 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 350 flow [2023-08-26 15:16:33,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2023-08-26 15:16:33,910 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-26 15:16:33,910 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 350 flow [2023-08-26 15:16:33,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:16:33,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:16:33,911 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 15:16:33,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:16:33,911 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 15:16:33,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:16:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash 817589300, now seen corresponding path program 1 times [2023-08-26 15:16:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:16:33,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87959137] [2023-08-26 15:16:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:16:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:16:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:16:33,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:16:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:16:34,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:16:34,037 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:16:34,037 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 15:16:34,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 15:16:34,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 15:16:34,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 15:16:34,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:16:34,042 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:16:34,046 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:16:34,046 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:16:34,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:16:34 BasicIcfg [2023-08-26 15:16:34,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:16:34,115 INFO L158 Benchmark]: Toolchain (without parser) took 17449.63ms. Allocated memory was 396.4MB in the beginning and 1.0GB in the end (delta: 639.6MB). Free memory was 370.8MB in the beginning and 800.3MB in the end (delta: -429.5MB). Peak memory consumption was 211.2MB. Max. memory is 16.0GB. [2023-08-26 15:16:34,115 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 396.4MB. Free memory is still 372.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:16:34,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.07ms. Allocated memory is still 396.4MB. Free memory was 370.8MB in the beginning and 345.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 15:16:34,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.66ms. Allocated memory is still 396.4MB. Free memory was 345.1MB in the beginning and 342.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 15:16:34,116 INFO L158 Benchmark]: Boogie Preprocessor took 35.80ms. Allocated memory is still 396.4MB. Free memory was 342.3MB in the beginning and 340.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:16:34,116 INFO L158 Benchmark]: RCFGBuilder took 569.38ms. Allocated memory is still 396.4MB. Free memory was 339.8MB in the beginning and 339.4MB in the end (delta: 466.6kB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. [2023-08-26 15:16:34,116 INFO L158 Benchmark]: TraceAbstraction took 16433.09ms. Allocated memory was 396.4MB in the beginning and 1.0GB in the end (delta: 639.6MB). Free memory was 338.5MB in the beginning and 800.3MB in the end (delta: -461.8MB). Peak memory consumption was 177.4MB. Max. memory is 16.0GB. [2023-08-26 15:16:34,117 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 396.4MB. Free memory is still 372.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 347.07ms. Allocated memory is still 396.4MB. Free memory was 370.8MB in the beginning and 345.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.66ms. Allocated memory is still 396.4MB. Free memory was 345.1MB in the beginning and 342.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.80ms. Allocated memory is still 396.4MB. Free memory was 342.3MB in the beginning and 340.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 569.38ms. Allocated memory is still 396.4MB. Free memory was 339.8MB in the beginning and 339.4MB in the end (delta: 466.6kB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. * TraceAbstraction took 16433.09ms. Allocated memory was 396.4MB in the beginning and 1.0GB in the end (delta: 639.6MB). Free memory was 338.5MB in the beginning and 800.3MB in the end (delta: -461.8MB). Peak memory consumption was 177.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.2s, 122 PlacesBefore, 40 PlacesAfterwards, 115 TransitionsBefore, 31 TransitionsAfterwards, 2188 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 6091 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2530, independent: 2351, independent conditional: 0, independent unconditional: 2351, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1158, independent: 1123, independent conditional: 0, independent unconditional: 1123, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2530, independent: 1228, independent conditional: 0, independent unconditional: 1228, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 1158, unknown conditional: 0, unknown unconditional: 1158] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-2, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1850; [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-1, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L850] 0 pthread_t t1851; [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] 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", "safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={56:57}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 847]: 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: 851]: 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: 849]: 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, 144 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: 16.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 725 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 725 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2134 IncrementalHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 26 mSDtfsCounter, 2134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1339occurred in iteration=13, InterpolantAutomatonStates: 112, 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, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 2677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 15:16:34,136 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...