/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:14:15,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:14:16,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:14:16,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:14:16,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:14:16,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:14:16,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:14:16,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:14:16,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:14:16,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:14:16,090 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:14:16,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:14:16,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:14:16,092 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:14:16,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:14:16,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:14:16,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:14:16,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:14:16,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:14:16,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:14:16,093 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:14:16,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:14:16,093 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:14:16,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:14:16,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:14:16,094 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:14:16,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:14:16,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:14:16,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:14:16,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:14:16,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:14:16,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:14:16,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:14:16,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:14:16,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:14:16,096 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:14:16,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:14:16,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:14:16,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:14:16,399 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:14:16,400 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:14:16,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:14:17,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:14:17,680 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:14:17,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:14:17,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e41cee20/c98ae8513ab04b37adb4c2567c4db635/FLAGd337901fd [2023-08-26 18:14:17,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e41cee20/c98ae8513ab04b37adb4c2567c4db635 [2023-08-26 18:14:17,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:14:17,707 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:14:17,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:14:17,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:14:17,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:14:17,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:14:17" (1/1) ... [2023-08-26 18:14:17,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f92f83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:17, skipping insertion in model container [2023-08-26 18:14:17,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:14:17" (1/1) ... [2023-08-26 18:14:17,749 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:14:18,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:14:18,044 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:14:18,071 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:14:18,072 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:14:18,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:14:18,133 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:14:18,133 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:14:18,138 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:14:18,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18 WrapperNode [2023-08-26 18:14:18,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:14:18,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:14:18,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:14:18,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:14:18,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,200 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-08-26 18:14:18,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:14:18,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:14:18,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:14:18,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:14:18,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:14:18,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:14:18,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:14:18,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:14:18,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (1/1) ... [2023-08-26 18:14:18,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:14:18,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:14:18,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:14:18,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:14:18,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:14:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:14:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:14:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:14:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:14:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:14:18,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:14:18,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:14:18,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:14:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:14:18,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:14:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:14:18,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:14:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:14:18,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:14:18,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:14:18,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:14:18,370 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:14:18,498 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:14:18,499 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:14:18,810 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:14:18,935 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:14:18,935 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:14:18,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:14:18 BoogieIcfgContainer [2023-08-26 18:14:18,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:14:18,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:14:18,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:14:18,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:14:18,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:14:17" (1/3) ... [2023-08-26 18:14:18,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d17b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:14:18, skipping insertion in model container [2023-08-26 18:14:18,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:14:18" (2/3) ... [2023-08-26 18:14:18,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d17b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:14:18, skipping insertion in model container [2023-08-26 18:14:18,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:14:18" (3/3) ... [2023-08-26 18:14:18,948 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:14:18,958 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:14:18,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:14:18,958 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:14:18,992 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:14:19,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 18:14:19,043 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 18:14:19,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:14:19,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 18:14:19,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 18:14:19,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-26 18:14:19,053 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:14:19,058 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 18:14:19,060 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 18:14:19,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-26 18:14:19,084 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 18:14:19,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:14:19,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 18:14:19,087 INFO L119 LiptonReduction]: Number of co-enabled transitions 3584 [2023-08-26 18:14:22,592 INFO L134 LiptonReduction]: Checked pairs total: 10734 [2023-08-26 18:14:22,592 INFO L136 LiptonReduction]: Total number of compositions: 130 [2023-08-26 18:14:22,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:14:22,605 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;@40c6e706, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:14:22,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:14:22,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:14:22,606 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:14:22,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:14:22,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:22,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:14:22,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:22,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2023-08-26 18:14:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190127378] [2023-08-26 18:14:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:22,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:22,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190127378] [2023-08-26 18:14:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190127378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:22,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:22,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:14:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662177716] [2023-08-26 18:14:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:22,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:14:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:14:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:14:22,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-08-26 18:14:22,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:22,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:22,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-08-26 18:14:22,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:23,614 INFO L124 PetriNetUnfolderBase]: 7479/10186 cut-off events. [2023-08-26 18:14:23,614 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-26 18:14:23,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20494 conditions, 10186 events. 7479/10186 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 52206 event pairs, 7479 based on Foata normal form. 0/9174 useless extension candidates. Maximal degree in co-relation 20482. Up to 10091 conditions per place. [2023-08-26 18:14:23,661 INFO L140 encePairwiseOnDemand]: 262/271 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-26 18:14:23,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-26 18:14:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:14:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:14:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-08-26 18:14:23,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276752767527675 [2023-08-26 18:14:23,671 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-08-26 18:14:23,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-08-26 18:14:23,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:23,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-08-26 18:14:23,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:23,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:23,680 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:23,681 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 286 transitions. [2023-08-26 18:14:23,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-26 18:14:23,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:14:23,685 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-26 18:14:23,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-26 18:14:23,689 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-26 18:14:23,689 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-26 18:14:23,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:23,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:23,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:14:23,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:14:23,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:23,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 604565, now seen corresponding path program 1 times [2023-08-26 18:14:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:23,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434625573] [2023-08-26 18:14:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434625573] [2023-08-26 18:14:23,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434625573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:23,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:23,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:14:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988953124] [2023-08-26 18:14:23,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:23,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:14:23,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:23,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:14:23,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:14:23,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 271 [2023-08-26 18:14:23,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:23,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:23,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 271 [2023-08-26 18:14:23,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:24,501 INFO L124 PetriNetUnfolderBase]: 5879/8049 cut-off events. [2023-08-26 18:14:24,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:14:24,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16190 conditions, 8049 events. 5879/8049 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 39521 event pairs, 3031 based on Foata normal form. 0/7711 useless extension candidates. Maximal degree in co-relation 16187. Up to 6367 conditions per place. [2023-08-26 18:14:24,534 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-08-26 18:14:24,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-08-26 18:14:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:14:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:14:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-26 18:14:24,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166051660516605 [2023-08-26 18:14:24,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-26 18:14:24,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-26 18:14:24,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:24,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-26 18:14:24,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:24,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:24,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:24,545 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 420 transitions. [2023-08-26 18:14:24,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-08-26 18:14:24,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:14:24,548 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-26 18:14:24,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-26 18:14:24,548 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-26 18:14:24,549 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-26 18:14:24,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:24,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:24,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:24,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:14:24,552 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:24,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1271657298, now seen corresponding path program 1 times [2023-08-26 18:14:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185848405] [2023-08-26 18:14:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:24,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 18:14:24,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:24,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185848405] [2023-08-26 18:14:24,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185848405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:24,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:24,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:14:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309701294] [2023-08-26 18:14:24,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:24,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:14:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:24,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:14:24,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:14:24,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 271 [2023-08-26 18:14:24,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:24,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:24,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 271 [2023-08-26 18:14:24,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:27,072 INFO L124 PetriNetUnfolderBase]: 24574/33203 cut-off events. [2023-08-26 18:14:27,072 INFO L125 PetriNetUnfolderBase]: For 1637/1637 co-relation queries the response was YES. [2023-08-26 18:14:27,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68445 conditions, 33203 events. 24574/33203 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 181353 event pairs, 8116 based on Foata normal form. 1374/34577 useless extension candidates. Maximal degree in co-relation 68441. Up to 14653 conditions per place. [2023-08-26 18:14:27,190 INFO L140 encePairwiseOnDemand]: 260/271 looper letters, 44 selfloop transitions, 9 changer transitions 35/88 dead transitions. [2023-08-26 18:14:27,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 88 transitions, 374 flow [2023-08-26 18:14:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:14:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:14:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2023-08-26 18:14:27,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46494464944649444 [2023-08-26 18:14:27,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2023-08-26 18:14:27,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2023-08-26 18:14:27,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:27,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2023-08-26 18:14:27,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:27,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:27,197 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:27,197 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 630 transitions. [2023-08-26 18:14:27,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 88 transitions, 374 flow [2023-08-26 18:14:27,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:14:27,199 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 156 flow [2023-08-26 18:14:27,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-26 18:14:27,200 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-26 18:14:27,200 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 156 flow [2023-08-26 18:14:27,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:27,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:27,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:27,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:14:27,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:27,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash 766645609, now seen corresponding path program 1 times [2023-08-26 18:14:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:27,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66255487] [2023-08-26 18:14:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:27,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:27,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66255487] [2023-08-26 18:14:27,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66255487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:27,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:27,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:14:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653870409] [2023-08-26 18:14:27,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:27,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:14:27,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:27,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:14:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:14:27,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 271 [2023-08-26 18:14:27,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:27,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:27,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 271 [2023-08-26 18:14:27,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:29,665 INFO L124 PetriNetUnfolderBase]: 22916/31221 cut-off events. [2023-08-26 18:14:29,666 INFO L125 PetriNetUnfolderBase]: For 25692/25692 co-relation queries the response was YES. [2023-08-26 18:14:29,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88893 conditions, 31221 events. 22916/31221 cut-off events. For 25692/25692 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 173718 event pairs, 2477 based on Foata normal form. 1316/32537 useless extension candidates. Maximal degree in co-relation 88886. Up to 13366 conditions per place. [2023-08-26 18:14:29,787 INFO L140 encePairwiseOnDemand]: 260/271 looper letters, 63 selfloop transitions, 13 changer transitions 53/129 dead transitions. [2023-08-26 18:14:29,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 129 transitions, 782 flow [2023-08-26 18:14:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:14:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:14:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-08-26 18:14:29,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612546125461255 [2023-08-26 18:14:29,789 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-08-26 18:14:29,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-08-26 18:14:29,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:29,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-08-26 18:14:29,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:29,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:29,794 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:29,794 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 156 flow. Second operand 7 states and 875 transitions. [2023-08-26 18:14:29,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 129 transitions, 782 flow [2023-08-26 18:14:29,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 129 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:14:29,831 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 266 flow [2023-08-26 18:14:29,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-26 18:14:29,833 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-26 18:14:29,833 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 266 flow [2023-08-26 18:14:29,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:29,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:29,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:29,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:14:29,834 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:29,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash 766635038, now seen corresponding path program 1 times [2023-08-26 18:14:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099058985] [2023-08-26 18:14:29,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:29,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:29,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099058985] [2023-08-26 18:14:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099058985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:29,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:14:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684579879] [2023-08-26 18:14:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:29,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:14:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:29,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:14:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:14:29,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 271 [2023-08-26 18:14:29,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:29,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:29,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 271 [2023-08-26 18:14:29,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:32,368 INFO L124 PetriNetUnfolderBase]: 21764/29659 cut-off events. [2023-08-26 18:14:32,369 INFO L125 PetriNetUnfolderBase]: For 68918/68918 co-relation queries the response was YES. [2023-08-26 18:14:32,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96077 conditions, 29659 events. 21764/29659 cut-off events. For 68918/68918 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 163480 event pairs, 4065 based on Foata normal form. 1098/30757 useless extension candidates. Maximal degree in co-relation 96065. Up to 13003 conditions per place. [2023-08-26 18:14:32,586 INFO L140 encePairwiseOnDemand]: 260/271 looper letters, 69 selfloop transitions, 22 changer transitions 49/140 dead transitions. [2023-08-26 18:14:32,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 140 transitions, 976 flow [2023-08-26 18:14:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:14:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:14:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2023-08-26 18:14:32,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46178176067474963 [2023-08-26 18:14:32,588 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2023-08-26 18:14:32,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2023-08-26 18:14:32,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:32,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2023-08-26 18:14:32,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:32,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:32,592 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:32,593 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 266 flow. Second operand 7 states and 876 transitions. [2023-08-26 18:14:32,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 140 transitions, 976 flow [2023-08-26 18:14:32,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 140 transitions, 968 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-26 18:14:32,750 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 478 flow [2023-08-26 18:14:32,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=478, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-26 18:14:32,751 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-26 18:14:32,752 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 478 flow [2023-08-26 18:14:32,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:32,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:32,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:32,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:14:32,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:32,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2003825433, now seen corresponding path program 1 times [2023-08-26 18:14:32,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:32,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469011134] [2023-08-26 18:14:32,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:32,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:32,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:32,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469011134] [2023-08-26 18:14:32,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469011134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:32,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:32,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:14:32,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643727154] [2023-08-26 18:14:32,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:32,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:14:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:32,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:14:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:14:32,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 271 [2023-08-26 18:14:32,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 478 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:32,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:32,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 271 [2023-08-26 18:14:32,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:35,027 INFO L124 PetriNetUnfolderBase]: 19932/27213 cut-off events. [2023-08-26 18:14:35,027 INFO L125 PetriNetUnfolderBase]: For 114119/114119 co-relation queries the response was YES. [2023-08-26 18:14:35,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100029 conditions, 27213 events. 19932/27213 cut-off events. For 114119/114119 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 145366 event pairs, 3428 based on Foata normal form. 1140/28353 useless extension candidates. Maximal degree in co-relation 100011. Up to 9745 conditions per place. [2023-08-26 18:14:35,149 INFO L140 encePairwiseOnDemand]: 261/271 looper letters, 80 selfloop transitions, 21 changer transitions 52/153 dead transitions. [2023-08-26 18:14:35,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 1404 flow [2023-08-26 18:14:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:14:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:14:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-08-26 18:14:35,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45598313125988404 [2023-08-26 18:14:35,151 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-08-26 18:14:35,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-08-26 18:14:35,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:35,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-08-26 18:14:35,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:35,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:35,155 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:35,155 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 478 flow. Second operand 7 states and 865 transitions. [2023-08-26 18:14:35,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 153 transitions, 1404 flow [2023-08-26 18:14:35,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 153 transitions, 1366 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-08-26 18:14:35,525 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 730 flow [2023-08-26 18:14:35,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=730, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2023-08-26 18:14:35,526 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2023-08-26 18:14:35,526 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 730 flow [2023-08-26 18:14:35,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:35,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:35,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:35,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:14:35,527 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:35,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1321638345, now seen corresponding path program 1 times [2023-08-26 18:14:35,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:35,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222697378] [2023-08-26 18:14:35,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:35,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:35,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222697378] [2023-08-26 18:14:35,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222697378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:35,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:35,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:14:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852136600] [2023-08-26 18:14:35,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:35,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:14:35,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:35,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:14:35,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:14:35,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 271 [2023-08-26 18:14:35,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 730 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:35,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:35,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 271 [2023-08-26 18:14:35,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:38,934 INFO L124 PetriNetUnfolderBase]: 26100/35784 cut-off events. [2023-08-26 18:14:38,935 INFO L125 PetriNetUnfolderBase]: For 187550/187550 co-relation queries the response was YES. [2023-08-26 18:14:39,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135779 conditions, 35784 events. 26100/35784 cut-off events. For 187550/187550 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 203659 event pairs, 5174 based on Foata normal form. 963/36747 useless extension candidates. Maximal degree in co-relation 135757. Up to 13446 conditions per place. [2023-08-26 18:14:39,093 INFO L140 encePairwiseOnDemand]: 260/271 looper letters, 71 selfloop transitions, 41 changer transitions 44/156 dead transitions. [2023-08-26 18:14:39,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 156 transitions, 1512 flow [2023-08-26 18:14:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:14:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:14:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2023-08-26 18:14:39,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45967316816025305 [2023-08-26 18:14:39,096 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2023-08-26 18:14:39,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2023-08-26 18:14:39,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:39,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2023-08-26 18:14:39,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:39,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:39,100 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:39,100 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 730 flow. Second operand 7 states and 872 transitions. [2023-08-26 18:14:39,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 156 transitions, 1512 flow [2023-08-26 18:14:39,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 156 transitions, 1473 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-26 18:14:39,620 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 972 flow [2023-08-26 18:14:39,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=972, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2023-08-26 18:14:39,621 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2023-08-26 18:14:39,621 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 972 flow [2023-08-26 18:14:39,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:39,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:39,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:39,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:14:39,622 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:39,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1532735992, now seen corresponding path program 1 times [2023-08-26 18:14:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:39,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626662702] [2023-08-26 18:14:39,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:39,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626662702] [2023-08-26 18:14:39,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626662702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:39,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:39,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:14:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281410293] [2023-08-26 18:14:39,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:39,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:14:39,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:14:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:14:39,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 271 [2023-08-26 18:14:39,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 972 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:39,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:39,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 271 [2023-08-26 18:14:39,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:41,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L822-->L838: Formula: (let ((.cse2 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse2)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_152 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_151 256))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_91 v_~a$mem_tmp~0_16) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_65) (= (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse7 v_~a$w_buff0_used~0_152 (ite .cse8 0 v_~a$w_buff0_used~0_152))) v_~a$w_buff0_used~0_151) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_12)) (= v_~a$w_buff0~0_75 v_~a$w_buff0~0_74) (= v_~a$r_buff0_thd4~0_63 (ite .cse0 v_~a$r_buff0_thd4~0_64 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~a$r_buff0_thd4~0_64 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_64)))) (= (ite .cse7 v_~a~0_91 (ite .cse8 v_~a$w_buff0~0_75 v_~a$w_buff1~0_66)) v_~__unbuffered_p3_EBX~0_12))))) InVars {~a~0=v_~a~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_65, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][159], [154#true, Black: 194#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 190#(= ~x~0 0), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 208#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 236#true, P0Thread1of1ForFork2InUse, Black: 207#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork3InUse, Black: 206#(= ~__unbuffered_p3_EAX~0 0), Black: 212#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 222#(= ~y~0 1), 204#true, 188#true, 75#P2EXITtrue, 172#true, Black: 220#true, Black: 224#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 226#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 223#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 228#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 36#L782true, Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 52#L873true, 10#L762true, 34#L838true, Black: 175#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~y~0 0), Black: 178#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-08-26 18:14:41,039 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-26 18:14:41,039 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 18:14:41,039 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 18:14:41,039 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-26 18:14:41,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L822-->L838: Formula: (let ((.cse2 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse2)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_152 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_151 256))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_91 v_~a$mem_tmp~0_16) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_65) (= (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse7 v_~a$w_buff0_used~0_152 (ite .cse8 0 v_~a$w_buff0_used~0_152))) v_~a$w_buff0_used~0_151) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_12)) (= v_~a$w_buff0~0_75 v_~a$w_buff0~0_74) (= v_~a$r_buff0_thd4~0_63 (ite .cse0 v_~a$r_buff0_thd4~0_64 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~a$r_buff0_thd4~0_64 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_64)))) (= (ite .cse7 v_~a~0_91 (ite .cse8 v_~a$w_buff0~0_75 v_~a$w_buff1~0_66)) v_~__unbuffered_p3_EBX~0_12))))) InVars {~a~0=v_~a~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_65, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][159], [154#true, 18#L769true, Black: 194#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 190#(= ~x~0 0), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 208#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), P0Thread1of1ForFork2InUse, 236#true, P2Thread1of1ForFork3InUse, Black: 207#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 206#(= ~__unbuffered_p3_EAX~0 0), Black: 212#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 222#(= ~y~0 1), 204#true, 188#true, 75#P2EXITtrue, 172#true, Black: 220#true, Black: 224#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 226#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 223#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 228#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 36#L782true, Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 52#L873true, 34#L838true, Black: 175#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~y~0 0), Black: 178#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-08-26 18:14:41,221 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,221 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,221 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,221 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][39], [154#true, 18#L769true, Black: 194#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 190#(= ~x~0 0), Black: 188#true, 94#L822true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 208#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 236#true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 206#(= ~__unbuffered_p3_EAX~0 0), Black: 204#true, Black: 212#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 222#(= ~y~0 1), 75#P2EXITtrue, Black: 220#true, Black: 224#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 226#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 161#true, Black: 164#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 223#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 228#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 108#L789true, 52#L873true, Black: 172#true, 175#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 207#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~y~0 0), Black: 178#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-08-26 18:14:41,221 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,221 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,221 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,221 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L822-->L838: Formula: (let ((.cse2 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse2)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_152 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_151 256))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_91 v_~a$mem_tmp~0_16) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_65) (= (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse7 v_~a$w_buff0_used~0_152 (ite .cse8 0 v_~a$w_buff0_used~0_152))) v_~a$w_buff0_used~0_151) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_12)) (= v_~a$w_buff0~0_75 v_~a$w_buff0~0_74) (= v_~a$r_buff0_thd4~0_63 (ite .cse0 v_~a$r_buff0_thd4~0_64 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~a$r_buff0_thd4~0_64 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_64)))) (= (ite .cse7 v_~a~0_91 (ite .cse8 v_~a$w_buff0~0_75 v_~a$w_buff1~0_66)) v_~__unbuffered_p3_EBX~0_12))))) InVars {~a~0=v_~a~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_65, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][159], [154#true, Black: 194#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 190#(= ~x~0 0), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 208#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), P0Thread1of1ForFork2InUse, 236#true, P2Thread1of1ForFork3InUse, Black: 207#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 206#(= ~__unbuffered_p3_EAX~0 0), 45#L880true, Black: 212#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 222#(= ~y~0 1), 204#true, 188#true, 75#P2EXITtrue, 172#true, Black: 220#true, Black: 224#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 226#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 164#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 223#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 228#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 36#L782true, 10#L762true, 34#L838true, Black: 175#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~y~0 0), Black: 178#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-08-26 18:14:41,222 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,222 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,222 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,222 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 18:14:41,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L822-->L838: Formula: (let ((.cse2 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse9 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse10 (not .cse9)) (.cse5 (and .cse9 .cse2)) (.cse6 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse9)) (.cse11 (= (mod v_~a$w_buff0_used~0_152 256) 0))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_151 256))) (.cse7 (or .cse5 .cse6 .cse11)) (.cse8 (and .cse10 (not .cse11)))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_60 0)) v_~a$r_buff1_thd4~0_59) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse5 .cse6 .cse4) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_91 v_~a$mem_tmp~0_16) (= v_~a$w_buff1~0_66 v_~a$w_buff1~0_65) (= (ite .cse0 v_~a$w_buff0_used~0_152 (ite .cse7 v_~a$w_buff0_used~0_152 (ite .cse8 0 v_~a$w_buff0_used~0_152))) v_~a$w_buff0_used~0_151) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_12)) (= v_~a$w_buff0~0_75 v_~a$w_buff0~0_74) (= v_~a$r_buff0_thd4~0_63 (ite .cse0 v_~a$r_buff0_thd4~0_64 (ite (or .cse5 (and .cse3 .cse9) .cse4) v_~a$r_buff0_thd4~0_64 (ite (and .cse10 (not .cse4)) 0 v_~a$r_buff0_thd4~0_64)))) (= (ite .cse7 v_~a~0_91 (ite .cse8 v_~a$w_buff0~0_75 v_~a$w_buff1~0_66)) v_~__unbuffered_p3_EBX~0_12))))) InVars {~a~0=v_~a~0_91, ~a$w_buff1~0=v_~a$w_buff1~0_66, ~a$w_buff0~0=v_~a$w_buff0~0_75, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_152, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_151, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_65, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_74, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][159], [154#true, 18#L769true, Black: 194#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 190#(= ~x~0 0), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 208#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 236#true, P0Thread1of1ForFork2InUse, Black: 207#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork3InUse, Black: 206#(= ~__unbuffered_p3_EAX~0 0), 45#L880true, Black: 212#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 222#(= ~y~0 1), 204#true, 188#true, 75#P2EXITtrue, 172#true, Black: 220#true, Black: 224#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 226#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 223#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 228#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 163#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 36#L782true, 34#L838true, Black: 175#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~y~0 0), Black: 178#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-08-26 18:14:41,385 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 18:14:41,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 18:14:41,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 18:14:41,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 18:14:41,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][39], [154#true, 18#L769true, Black: 194#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 190#(= ~x~0 0), Black: 188#true, 94#L822true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 208#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), 236#true, P0Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 206#(= ~__unbuffered_p3_EAX~0 0), Black: 204#true, 45#L880true, Black: 212#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 222#(= ~y~0 1), 75#P2EXITtrue, Black: 220#true, Black: 224#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 226#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (= ~y~0 1)), Black: 161#true, Black: 223#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 164#(<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|), Black: 166#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), Black: 228#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|)), 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 108#L789true, Black: 172#true, 175#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 174#(= ~y~0 0), 207#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 178#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|))]) [2023-08-26 18:14:41,385 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 18:14:41,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 18:14:41,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 18:14:41,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 18:14:41,924 INFO L124 PetriNetUnfolderBase]: 14562/21477 cut-off events. [2023-08-26 18:14:41,925 INFO L125 PetriNetUnfolderBase]: For 123125/127040 co-relation queries the response was YES. [2023-08-26 18:14:41,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78774 conditions, 21477 events. 14562/21477 cut-off events. For 123125/127040 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 141067 event pairs, 2461 based on Foata normal form. 2281/23362 useless extension candidates. Maximal degree in co-relation 78749. Up to 13799 conditions per place. [2023-08-26 18:14:42,019 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 147 selfloop transitions, 10 changer transitions 0/185 dead transitions. [2023-08-26 18:14:42,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 185 transitions, 2528 flow [2023-08-26 18:14:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:14:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:14:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-08-26 18:14:42,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48560885608856086 [2023-08-26 18:14:42,021 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-08-26 18:14:42,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-08-26 18:14:42,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:42,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-08-26 18:14:42,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:42,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:42,025 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:42,025 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 972 flow. Second operand 5 states and 658 transitions. [2023-08-26 18:14:42,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 185 transitions, 2528 flow [2023-08-26 18:14:42,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 185 transitions, 2500 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-26 18:14:42,102 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 1031 flow [2023-08-26 18:14:42,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1031, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2023-08-26 18:14:42,103 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2023-08-26 18:14:42,103 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 1031 flow [2023-08-26 18:14:42,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:42,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:42,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:42,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:14:42,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:42,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash 809504940, now seen corresponding path program 1 times [2023-08-26 18:14:42,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:42,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176481361] [2023-08-26 18:14:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:42,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176481361] [2023-08-26 18:14:42,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176481361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:42,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:42,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:14:42,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176874619] [2023-08-26 18:14:42,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:42,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:14:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:14:42,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:14:42,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 271 [2023-08-26 18:14:42,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 1031 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 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 18:14:42,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:42,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 271 [2023-08-26 18:14:42,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:45,784 INFO L124 PetriNetUnfolderBase]: 23573/35037 cut-off events. [2023-08-26 18:14:45,784 INFO L125 PetriNetUnfolderBase]: For 203936/207327 co-relation queries the response was YES. [2023-08-26 18:14:45,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152539 conditions, 35037 events. 23573/35037 cut-off events. For 203936/207327 co-relation queries the response was YES. Maximal size of possible extension queue 1628. Compared 247289 event pairs, 10827 based on Foata normal form. 1495/35733 useless extension candidates. Maximal degree in co-relation 152514. Up to 17703 conditions per place. [2023-08-26 18:14:45,948 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 76 selfloop transitions, 13 changer transitions 42/146 dead transitions. [2023-08-26 18:14:45,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 146 transitions, 1751 flow [2023-08-26 18:14:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:14:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:14:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-26 18:14:45,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826568265682657 [2023-08-26 18:14:45,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-26 18:14:45,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-26 18:14:45,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:45,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-26 18:14:45,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:45,954 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 1031 flow. Second operand 5 states and 654 transitions. [2023-08-26 18:14:45,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 146 transitions, 1751 flow [2023-08-26 18:14:46,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 146 transitions, 1738 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 18:14:46,125 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 971 flow [2023-08-26 18:14:46,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=971, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2023-08-26 18:14:46,126 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-08-26 18:14:46,126 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 971 flow [2023-08-26 18:14:46,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 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 18:14:46,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:46,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:46,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:14:46,127 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:46,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash 991887274, now seen corresponding path program 1 times [2023-08-26 18:14:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:46,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61555015] [2023-08-26 18:14:46,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:46,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61555015] [2023-08-26 18:14:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61555015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:14:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532426401] [2023-08-26 18:14:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:46,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:14:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:14:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:14:46,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 271 [2023-08-26 18:14:46,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 971 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:46,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:46,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 271 [2023-08-26 18:14:46,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:48,508 INFO L124 PetriNetUnfolderBase]: 13784/21082 cut-off events. [2023-08-26 18:14:48,508 INFO L125 PetriNetUnfolderBase]: For 113608/116371 co-relation queries the response was YES. [2023-08-26 18:14:48,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87488 conditions, 21082 events. 13784/21082 cut-off events. For 113608/116371 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 148943 event pairs, 1466 based on Foata normal form. 2024/22601 useless extension candidates. Maximal degree in co-relation 87460. Up to 7323 conditions per place. [2023-08-26 18:14:48,616 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 191 selfloop transitions, 16 changer transitions 4/234 dead transitions. [2023-08-26 18:14:48,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 234 transitions, 3276 flow [2023-08-26 18:14:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:14:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:14:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2023-08-26 18:14:48,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849762783342119 [2023-08-26 18:14:48,618 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2023-08-26 18:14:48,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2023-08-26 18:14:48,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:48,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2023-08-26 18:14:48,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:48,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:48,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:48,622 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 971 flow. Second operand 7 states and 920 transitions. [2023-08-26 18:14:48,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 234 transitions, 3276 flow [2023-08-26 18:14:48,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 234 transitions, 3218 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-26 18:14:48,763 INFO L231 Difference]: Finished difference. Result has 85 places, 86 transitions, 1071 flow [2023-08-26 18:14:48,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1071, PETRI_PLACES=85, PETRI_TRANSITIONS=86} [2023-08-26 18:14:48,763 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2023-08-26 18:14:48,763 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 1071 flow [2023-08-26 18:14:48,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:48,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:48,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:48,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:14:48,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:48,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1841271901, now seen corresponding path program 1 times [2023-08-26 18:14:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938672204] [2023-08-26 18:14:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:48,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:48,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938672204] [2023-08-26 18:14:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938672204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:48,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:14:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642751587] [2023-08-26 18:14:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:48,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:14:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:14:48,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:14:48,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 271 [2023-08-26 18:14:48,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 1071 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:48,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:48,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 271 [2023-08-26 18:14:48,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:52,504 INFO L124 PetriNetUnfolderBase]: 24763/37142 cut-off events. [2023-08-26 18:14:52,505 INFO L125 PetriNetUnfolderBase]: For 264897/264897 co-relation queries the response was YES. [2023-08-26 18:14:52,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184931 conditions, 37142 events. 24763/37142 cut-off events. For 264897/264897 co-relation queries the response was YES. Maximal size of possible extension queue 1512. Compared 260738 event pairs, 4320 based on Foata normal form. 150/37292 useless extension candidates. Maximal degree in co-relation 184903. Up to 17751 conditions per place. [2023-08-26 18:14:52,683 INFO L140 encePairwiseOnDemand]: 260/271 looper letters, 88 selfloop transitions, 36 changer transitions 59/183 dead transitions. [2023-08-26 18:14:52,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 183 transitions, 2340 flow [2023-08-26 18:14:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:14:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:14:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-26 18:14:52,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46273062730627307 [2023-08-26 18:14:52,685 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-26 18:14:52,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-26 18:14:52,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:52,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-26 18:14:52,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:52,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:52,688 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:52,688 INFO L175 Difference]: Start difference. First operand has 85 places, 86 transitions, 1071 flow. Second operand 5 states and 627 transitions. [2023-08-26 18:14:52,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 183 transitions, 2340 flow [2023-08-26 18:14:55,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 183 transitions, 2197 flow, removed 54 selfloop flow, removed 4 redundant places. [2023-08-26 18:14:55,531 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 1046 flow [2023-08-26 18:14:55,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1046, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2023-08-26 18:14:55,532 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2023-08-26 18:14:55,532 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 1046 flow [2023-08-26 18:14:55,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:55,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:55,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:55,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:14:55,532 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:55,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1098604667, now seen corresponding path program 2 times [2023-08-26 18:14:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:55,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832305391] [2023-08-26 18:14:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:55,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:55,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:55,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832305391] [2023-08-26 18:14:55,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832305391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:55,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:55,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:14:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767829712] [2023-08-26 18:14:55,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:55,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:14:55,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:55,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:14:55,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:14:55,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 271 [2023-08-26 18:14:55,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 1046 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:55,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:55,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 271 [2023-08-26 18:14:55,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:57,001 INFO L124 PetriNetUnfolderBase]: 7239/11878 cut-off events. [2023-08-26 18:14:57,001 INFO L125 PetriNetUnfolderBase]: For 67427/67884 co-relation queries the response was YES. [2023-08-26 18:14:57,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50261 conditions, 11878 events. 7239/11878 cut-off events. For 67427/67884 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 85264 event pairs, 1200 based on Foata normal form. 936/12539 useless extension candidates. Maximal degree in co-relation 50231. Up to 3764 conditions per place. [2023-08-26 18:14:57,044 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 113 selfloop transitions, 14 changer transitions 63/209 dead transitions. [2023-08-26 18:14:57,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 209 transitions, 3065 flow [2023-08-26 18:14:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:14:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:14:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 924 transitions. [2023-08-26 18:14:57,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870848708487085 [2023-08-26 18:14:57,046 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 924 transitions. [2023-08-26 18:14:57,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 924 transitions. [2023-08-26 18:14:57,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:57,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 924 transitions. [2023-08-26 18:14:57,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:57,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:57,049 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:57,049 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 1046 flow. Second operand 7 states and 924 transitions. [2023-08-26 18:14:57,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 209 transitions, 3065 flow [2023-08-26 18:14:57,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 209 transitions, 2930 flow, removed 24 selfloop flow, removed 5 redundant places. [2023-08-26 18:14:57,133 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 1001 flow [2023-08-26 18:14:57,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1001, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2023-08-26 18:14:57,133 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-26 18:14:57,133 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 1001 flow [2023-08-26 18:14:57,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:57,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:57,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:57,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:14:57,134 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:57,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1059296086, now seen corresponding path program 1 times [2023-08-26 18:14:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:57,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810355172] [2023-08-26 18:14:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:57,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:57,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:57,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810355172] [2023-08-26 18:14:57,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810355172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:57,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:57,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:14:57,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483542872] [2023-08-26 18:14:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:57,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:14:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:57,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:14:57,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:14:57,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 271 [2023-08-26 18:14:57,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 1001 flow. Second operand has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:57,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:57,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 271 [2023-08-26 18:14:57,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:14:58,471 INFO L124 PetriNetUnfolderBase]: 5840/9718 cut-off events. [2023-08-26 18:14:58,472 INFO L125 PetriNetUnfolderBase]: For 49034/49421 co-relation queries the response was YES. [2023-08-26 18:14:58,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43462 conditions, 9718 events. 5840/9718 cut-off events. For 49034/49421 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 70195 event pairs, 1040 based on Foata normal form. 272/9728 useless extension candidates. Maximal degree in co-relation 43432. Up to 3348 conditions per place. [2023-08-26 18:14:58,505 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 53 selfloop transitions, 17 changer transitions 114/188 dead transitions. [2023-08-26 18:14:58,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 188 transitions, 2620 flow [2023-08-26 18:14:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:14:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:14:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1155 transitions. [2023-08-26 18:14:58,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735547355473555 [2023-08-26 18:14:58,507 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1155 transitions. [2023-08-26 18:14:58,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1155 transitions. [2023-08-26 18:14:58,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:14:58,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1155 transitions. [2023-08-26 18:14:58,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.33333333333334) internal successors, (1155), 9 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:58,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:58,512 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:58,512 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 1001 flow. Second operand 9 states and 1155 transitions. [2023-08-26 18:14:58,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 188 transitions, 2620 flow [2023-08-26 18:14:59,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 188 transitions, 2541 flow, removed 28 selfloop flow, removed 7 redundant places. [2023-08-26 18:14:59,042 INFO L231 Difference]: Finished difference. Result has 90 places, 41 transitions, 362 flow [2023-08-26 18:14:59,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=362, PETRI_PLACES=90, PETRI_TRANSITIONS=41} [2023-08-26 18:14:59,043 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2023-08-26 18:14:59,043 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 41 transitions, 362 flow [2023-08-26 18:14:59,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:59,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:14:59,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:14:59,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:14:59,044 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:14:59,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:14:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -803930299, now seen corresponding path program 1 times [2023-08-26 18:14:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:14:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479610519] [2023-08-26 18:14:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:14:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:14:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:14:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:14:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:14:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479610519] [2023-08-26 18:14:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479610519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:14:59,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:14:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:14:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285207523] [2023-08-26 18:14:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:14:59,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:14:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:14:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:14:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:14:59,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 271 [2023-08-26 18:14:59,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 41 transitions, 362 flow. Second operand has 9 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:14:59,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:14:59,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 271 [2023-08-26 18:14:59,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:00,066 INFO L124 PetriNetUnfolderBase]: 683/1153 cut-off events. [2023-08-26 18:15:00,067 INFO L125 PetriNetUnfolderBase]: For 4592/4604 co-relation queries the response was YES. [2023-08-26 18:15:00,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5042 conditions, 1153 events. 683/1153 cut-off events. For 4592/4604 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4940 event pairs, 224 based on Foata normal form. 1/1148 useless extension candidates. Maximal degree in co-relation 5013. Up to 592 conditions per place. [2023-08-26 18:15:00,071 INFO L140 encePairwiseOnDemand]: 263/271 looper letters, 47 selfloop transitions, 5 changer transitions 44/100 dead transitions. [2023-08-26 18:15:00,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 100 transitions, 977 flow [2023-08-26 18:15:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:00,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2023-08-26 18:15:00,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43384290985767 [2023-08-26 18:15:00,073 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2023-08-26 18:15:00,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2023-08-26 18:15:00,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:00,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2023-08-26 18:15:00,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,078 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,078 INFO L175 Difference]: Start difference. First operand has 90 places, 41 transitions, 362 flow. Second operand 7 states and 823 transitions. [2023-08-26 18:15:00,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 100 transitions, 977 flow [2023-08-26 18:15:00,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 100 transitions, 593 flow, removed 74 selfloop flow, removed 35 redundant places. [2023-08-26 18:15:00,085 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 196 flow [2023-08-26 18:15:00,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=196, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2023-08-26 18:15:00,086 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-26 18:15:00,086 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 196 flow [2023-08-26 18:15:00,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:00,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:00,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:15:00,087 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:00,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1816372505, now seen corresponding path program 2 times [2023-08-26 18:15:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:00,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561945355] [2023-08-26 18:15:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561945355] [2023-08-26 18:15:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561945355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:15:00,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270005716] [2023-08-26 18:15:00,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:00,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:15:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:15:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:15:00,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 271 [2023-08-26 18:15:00,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 196 flow. Second operand has 9 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:00,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 271 [2023-08-26 18:15:00,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:00,906 INFO L124 PetriNetUnfolderBase]: 586/995 cut-off events. [2023-08-26 18:15:00,906 INFO L125 PetriNetUnfolderBase]: For 1143/1169 co-relation queries the response was YES. [2023-08-26 18:15:00,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3343 conditions, 995 events. 586/995 cut-off events. For 1143/1169 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4340 event pairs, 50 based on Foata normal form. 1/996 useless extension candidates. Maximal degree in co-relation 3331. Up to 379 conditions per place. [2023-08-26 18:15:00,908 INFO L140 encePairwiseOnDemand]: 263/271 looper letters, 78 selfloop transitions, 5 changer transitions 45/132 dead transitions. [2023-08-26 18:15:00,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 132 transitions, 889 flow [2023-08-26 18:15:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:15:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:15:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 952 transitions. [2023-08-26 18:15:00,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43911439114391143 [2023-08-26 18:15:00,910 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 952 transitions. [2023-08-26 18:15:00,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 952 transitions. [2023-08-26 18:15:00,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:00,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 952 transitions. [2023-08-26 18:15:00,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,914 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,914 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 196 flow. Second operand 8 states and 952 transitions. [2023-08-26 18:15:00,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 132 transitions, 889 flow [2023-08-26 18:15:00,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 132 transitions, 871 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-26 18:15:00,919 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 217 flow [2023-08-26 18:15:00,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-08-26 18:15:00,920 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-26 18:15:00,920 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 217 flow [2023-08-26 18:15:00,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:00,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:00,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:00,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:15:00,920 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:00,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1615885727, now seen corresponding path program 3 times [2023-08-26 18:15:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:00,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636443757] [2023-08-26 18:15:00,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:15:00,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:15:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:15:00,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:15:00,999 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:15:01,000 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:15:01,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:15:01,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:15:01,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:15:01,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:15:01,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:15:01,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:15:01,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:15:01,013 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:01,016 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:15:01,016 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:15:01,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:15:01 BasicIcfg [2023-08-26 18:15:01,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:15:01,106 INFO L158 Benchmark]: Toolchain (without parser) took 43398.66ms. Allocated memory was 379.6MB in the beginning and 12.9GB in the end (delta: 12.5GB). Free memory was 354.4MB in the beginning and 11.0GB in the end (delta: -10.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-08-26 18:15:01,106 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 379.6MB. Free memory was 355.7MB in the beginning and 355.6MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:15:01,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.35ms. Allocated memory is still 379.6MB. Free memory was 354.4MB in the beginning and 329.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:15:01,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.99ms. Allocated memory is still 379.6MB. Free memory was 329.2MB in the beginning and 326.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:01,106 INFO L158 Benchmark]: Boogie Preprocessor took 46.16ms. Allocated memory is still 379.6MB. Free memory was 326.7MB in the beginning and 324.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:01,106 INFO L158 Benchmark]: RCFGBuilder took 686.27ms. Allocated memory is still 379.6MB. Free memory was 324.6MB in the beginning and 340.7MB in the end (delta: -16.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. [2023-08-26 18:15:01,107 INFO L158 Benchmark]: TraceAbstraction took 42167.34ms. Allocated memory was 379.6MB in the beginning and 12.9GB in the end (delta: 12.5GB). Free memory was 340.4MB in the beginning and 11.0GB in the end (delta: -10.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-08-26 18:15:01,107 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 379.6MB. Free memory was 355.7MB in the beginning and 355.6MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 431.35ms. Allocated memory is still 379.6MB. Free memory was 354.4MB in the beginning and 329.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 62.99ms. Allocated memory is still 379.6MB. Free memory was 329.2MB in the beginning and 326.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.16ms. Allocated memory is still 379.6MB. Free memory was 326.7MB in the beginning and 324.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 686.27ms. Allocated memory is still 379.6MB. Free memory was 324.6MB in the beginning and 340.7MB in the end (delta: -16.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. * TraceAbstraction took 42167.34ms. Allocated memory was 379.6MB in the beginning and 12.9GB in the end (delta: 12.5GB). Free memory was 340.4MB in the beginning and 11.0GB in the end (delta: -10.7GB). Peak memory consumption was 1.9GB. 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.5s, 147 PlacesBefore, 52 PlacesAfterwards, 137 TransitionsBefore, 40 TransitionsAfterwards, 3584 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 130 TotalNumberOfCompositions, 10734 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4165, independent: 3922, independent conditional: 0, independent unconditional: 3922, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1929, independent: 1876, independent conditional: 0, independent unconditional: 1876, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4165, independent: 2046, independent conditional: 0, independent unconditional: 2046, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 1929, unknown conditional: 0, unknown unconditional: 1929] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=-3, t801={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=-2, t801={5:0}, t802={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=-1, t801={5:0}, t802={6:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=0, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L798] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 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", "mix030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 869]: 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: 865]: 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: 863]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 15 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: 42.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 35.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 717 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 717 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2231 IncrementalHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 62 mSDtfsCounter, 2231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1071occurred in iteration=10, InterpolantAutomatonStates: 91, 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, 2.8s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 1664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:15:01,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...