/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:09:37,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:09:37,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:09:37,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:09:37,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:09:37,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:09:37,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:09:37,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:09:37,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:09:37,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:09:37,290 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:09:37,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:09:37,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:09:37,291 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:09:37,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:09:37,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:09:37,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:09:37,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:09:37,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:09:37,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:09:37,292 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:09:37,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:09:37,293 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:09:37,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:09:37,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:09:37,293 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:09:37,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:09:37,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:09:37,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:09:37,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:09:37,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:09:37,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:09:37,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:09:37,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:09:37,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:09:37,295 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:09:37,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:09:37,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:09:37,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:09:37,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:09:37,539 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:09:37,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-08-26 12:09:38,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:09:38,721 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:09:38,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_rmo.i [2023-08-26 12:09:38,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188df9629/fe993438100842a5894d521e12c9c6db/FLAG74ebc24d7 [2023-08-26 12:09:38,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188df9629/fe993438100842a5894d521e12c9c6db [2023-08-26 12:09:38,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:09:38,748 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:09:38,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:09:38,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:09:38,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:09:38,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:09:38" (1/1) ... [2023-08-26 12:09:38,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a76018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:38, skipping insertion in model container [2023-08-26 12:09:38,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:09:38" (1/1) ... [2023-08-26 12:09:38,781 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:09:39,039 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:09:39,058 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:09:39,082 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:09:39,083 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:09:39,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:09:39,156 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:09:39,156 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:09:39,161 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:09:39,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39 WrapperNode [2023-08-26 12:09:39,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:09:39,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:09:39,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:09:39,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:09:39,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,216 INFO L138 Inliner]: procedures = 176, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2023-08-26 12:09:39,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:09:39,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:09:39,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:09:39,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:09:39,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:09:39,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:09:39,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:09:39,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:09:39,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (1/1) ... [2023-08-26 12:09:39,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:09:39,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:09:39,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:09:39,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:09:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:09:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:09:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:09:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:09:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:09:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:09:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:09:39,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:09:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:09:39,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:09:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:09:39,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:09:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:09:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:09:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:09:39,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:09:39,318 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:09:39,420 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:09:39,421 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:09:39,878 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:09:40,349 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:09:40,349 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:09:40,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:09:40 BoogieIcfgContainer [2023-08-26 12:09:40,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:09:40,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:09:40,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:09:40,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:09:40,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:09:38" (1/3) ... [2023-08-26 12:09:40,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f77ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:09:40, skipping insertion in model container [2023-08-26 12:09:40,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:39" (2/3) ... [2023-08-26 12:09:40,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f77ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:09:40, skipping insertion in model container [2023-08-26 12:09:40,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:09:40" (3/3) ... [2023-08-26 12:09:40,383 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2023-08-26 12:09:40,406 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:09:40,406 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-26 12:09:40,406 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:09:40,495 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:09:40,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 189 transitions, 393 flow [2023-08-26 12:09:40,605 INFO L124 PetriNetUnfolderBase]: 3/186 cut-off events. [2023-08-26 12:09:40,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:40,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 3/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 12:09:40,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 189 transitions, 393 flow [2023-08-26 12:09:40,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 186 transitions, 381 flow [2023-08-26 12:09:40,621 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:09:40,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 186 transitions, 381 flow [2023-08-26 12:09:40,634 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 186 transitions, 381 flow [2023-08-26 12:09:40,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 186 transitions, 381 flow [2023-08-26 12:09:40,678 INFO L124 PetriNetUnfolderBase]: 3/186 cut-off events. [2023-08-26 12:09:40,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:40,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 3/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 12:09:40,682 INFO L119 LiptonReduction]: Number of co-enabled transitions 8612 [2023-08-26 12:09:57,409 INFO L134 LiptonReduction]: Checked pairs total: 49859 [2023-08-26 12:09:57,410 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-08-26 12:09:57,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:09:57,422 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;@67fa563d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:09:57,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-08-26 12:09:57,424 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:09:57,424 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:09:57,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:57,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:57,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:09:57,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:09:57,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1201, now seen corresponding path program 1 times [2023-08-26 12:09:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044510859] [2023-08-26 12:09:57,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:57,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:09:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:09:57,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:09:57,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044510859] [2023-08-26 12:09:57,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044510859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:09:57,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:09:57,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:09:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335224546] [2023-08-26 12:09:57,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:09:57,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:09:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:09:57,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:09:57,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:09:57,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 346 [2023-08-26 12:09:57,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:09:57,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:09:57,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 346 [2023-08-26 12:09:57,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:00,228 INFO L124 PetriNetUnfolderBase]: 16294/23361 cut-off events. [2023-08-26 12:10:00,228 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 12:10:00,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46288 conditions, 23361 events. 16294/23361 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 167492 event pairs, 16294 based on Foata normal form. 400/9766 useless extension candidates. Maximal degree in co-relation 46277. Up to 22831 conditions per place. [2023-08-26 12:10:00,338 INFO L140 encePairwiseOnDemand]: 308/346 looper letters, 43 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-26 12:10:00,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 195 flow [2023-08-26 12:10:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:10:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:10:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions. [2023-08-26 12:10:00,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48121387283236994 [2023-08-26 12:10:00,348 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 333 transitions. [2023-08-26 12:10:00,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 333 transitions. [2023-08-26 12:10:00,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:00,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 333 transitions. [2023-08-26 12:10:00,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:00,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:00,355 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:00,356 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 185 flow. Second operand 2 states and 333 transitions. [2023-08-26 12:10:00,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 195 flow [2023-08-26 12:10:00,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:00,361 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-26 12:10:00,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-26 12:10:00,364 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 12:10:00,364 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-26 12:10:00,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:00,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:00,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:10:00,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:10:00,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:00,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1188544, now seen corresponding path program 1 times [2023-08-26 12:10:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:00,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295053157] [2023-08-26 12:10:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:00,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:00,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295053157] [2023-08-26 12:10:00,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295053157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:00,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:00,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012714262] [2023-08-26 12:10:00,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:00,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:00,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:00,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:00,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:00,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 346 [2023-08-26 12:10:00,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:00,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:00,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 346 [2023-08-26 12:10:00,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:02,631 INFO L124 PetriNetUnfolderBase]: 14310/20980 cut-off events. [2023-08-26 12:10:02,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:02,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41928 conditions, 20980 events. 14310/20980 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 137408 event pairs, 9819 based on Foata normal form. 0/12066 useless extension candidates. Maximal degree in co-relation 41925. Up to 14243 conditions per place. [2023-08-26 12:10:02,704 INFO L140 encePairwiseOnDemand]: 325/346 looper letters, 55 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2023-08-26 12:10:02,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 268 flow [2023-08-26 12:10:02,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-26 12:10:02,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36801541425818884 [2023-08-26 12:10:02,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-26 12:10:02,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-26 12:10:02,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:02,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-26 12:10:02,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:02,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:02,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:02,710 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 382 transitions. [2023-08-26 12:10:02,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 268 flow [2023-08-26 12:10:02,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:10:02,714 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 188 flow [2023-08-26 12:10:02,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-26 12:10:02,715 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2023-08-26 12:10:02,715 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 188 flow [2023-08-26 12:10:02,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:02,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:02,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:10:02,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:10:02,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:02,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1188545, now seen corresponding path program 1 times [2023-08-26 12:10:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:02,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114479121] [2023-08-26 12:10:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:02,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114479121] [2023-08-26 12:10:02,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114479121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:02,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:02,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:02,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284712887] [2023-08-26 12:10:02,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:02,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:02,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:02,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:02,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 346 [2023-08-26 12:10:02,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:02,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:02,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 346 [2023-08-26 12:10:02,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:03,807 INFO L124 PetriNetUnfolderBase]: 4092/6386 cut-off events. [2023-08-26 12:10:03,807 INFO L125 PetriNetUnfolderBase]: For 2167/2182 co-relation queries the response was YES. [2023-08-26 12:10:03,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18114 conditions, 6386 events. 4092/6386 cut-off events. For 2167/2182 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 39473 event pairs, 3031 based on Foata normal form. 1759/7640 useless extension candidates. Maximal degree in co-relation 18109. Up to 6250 conditions per place. [2023-08-26 12:10:03,836 INFO L140 encePairwiseOnDemand]: 335/346 looper letters, 41 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2023-08-26 12:10:03,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 254 flow [2023-08-26 12:10:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-26 12:10:03,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34971098265895956 [2023-08-26 12:10:03,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-26 12:10:03,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-26 12:10:03,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:03,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-26 12:10:03,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:03,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:03,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:03,842 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 188 flow. Second operand 3 states and 363 transitions. [2023-08-26 12:10:03,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 254 flow [2023-08-26 12:10:03,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:03,856 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 148 flow [2023-08-26 12:10:03,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-26 12:10:03,857 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -48 predicate places. [2023-08-26 12:10:03,857 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 148 flow [2023-08-26 12:10:03,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:03,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:03,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:03,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:10:03,857 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:03,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash -471237991, now seen corresponding path program 1 times [2023-08-26 12:10:03,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:03,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382117800] [2023-08-26 12:10:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:04,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:04,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382117800] [2023-08-26 12:10:04,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382117800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:04,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:04,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:04,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059776563] [2023-08-26 12:10:04,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:04,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:04,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 346 [2023-08-26 12:10:04,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:04,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:04,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 346 [2023-08-26 12:10:04,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:04,856 INFO L124 PetriNetUnfolderBase]: 3517/5842 cut-off events. [2023-08-26 12:10:04,856 INFO L125 PetriNetUnfolderBase]: For 1135/1291 co-relation queries the response was YES. [2023-08-26 12:10:04,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14675 conditions, 5842 events. 3517/5842 cut-off events. For 1135/1291 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 40002 event pairs, 1375 based on Foata normal form. 29/4664 useless extension candidates. Maximal degree in co-relation 14670. Up to 3202 conditions per place. [2023-08-26 12:10:04,876 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 61 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-26 12:10:04,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 366 flow [2023-08-26 12:10:04,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-26 12:10:04,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113680154142582 [2023-08-26 12:10:04,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-26 12:10:04,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-26 12:10:04,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:04,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-26 12:10:04,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:04,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:04,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:04,881 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 148 flow. Second operand 3 states and 427 transitions. [2023-08-26 12:10:04,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 366 flow [2023-08-26 12:10:04,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:04,882 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 160 flow [2023-08-26 12:10:04,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 12:10:04,883 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 12:10:04,883 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 160 flow [2023-08-26 12:10:04,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:04,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:04,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:04,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:10:04,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:04,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash -471237633, now seen corresponding path program 1 times [2023-08-26 12:10:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:04,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181521688] [2023-08-26 12:10:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:04,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:05,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:05,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181521688] [2023-08-26 12:10:05,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181521688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:05,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:05,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:05,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824207161] [2023-08-26 12:10:05,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:05,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:05,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 346 [2023-08-26 12:10:05,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:05,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:05,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 346 [2023-08-26 12:10:05,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:05,739 INFO L124 PetriNetUnfolderBase]: 3444/5553 cut-off events. [2023-08-26 12:10:05,739 INFO L125 PetriNetUnfolderBase]: For 2072/2123 co-relation queries the response was YES. [2023-08-26 12:10:05,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15381 conditions, 5553 events. 3444/5553 cut-off events. For 2072/2123 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 37054 event pairs, 839 based on Foata normal form. 7/4677 useless extension candidates. Maximal degree in co-relation 15375. Up to 4236 conditions per place. [2023-08-26 12:10:05,760 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 58 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-26 12:10:05,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 368 flow [2023-08-26 12:10:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-26 12:10:05,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40655105973025046 [2023-08-26 12:10:05,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-26 12:10:05,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-26 12:10:05,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:05,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-26 12:10:05,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:05,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:05,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:05,765 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 160 flow. Second operand 3 states and 422 transitions. [2023-08-26 12:10:05,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 368 flow [2023-08-26 12:10:05,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:05,766 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 162 flow [2023-08-26 12:10:05,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-26 12:10:05,767 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -46 predicate places. [2023-08-26 12:10:05,767 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 162 flow [2023-08-26 12:10:05,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:05,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:05,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:05,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:10:05,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:05,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:05,768 INFO L85 PathProgramCache]: Analyzing trace with hash -296543057, now seen corresponding path program 1 times [2023-08-26 12:10:05,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:05,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727256232] [2023-08-26 12:10:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727256232] [2023-08-26 12:10:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727256232] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:05,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:05,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:05,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738957240] [2023-08-26 12:10:05,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:05,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:05,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:05,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 346 [2023-08-26 12:10:05,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:05,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:05,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 346 [2023-08-26 12:10:05,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:06,520 INFO L124 PetriNetUnfolderBase]: 3720/6117 cut-off events. [2023-08-26 12:10:06,520 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2023-08-26 12:10:06,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16991 conditions, 6117 events. 3720/6117 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 40537 event pairs, 1167 based on Foata normal form. 0/5193 useless extension candidates. Maximal degree in co-relation 16984. Up to 2296 conditions per place. [2023-08-26 12:10:06,543 INFO L140 encePairwiseOnDemand]: 336/346 looper letters, 71 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2023-08-26 12:10:06,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 454 flow [2023-08-26 12:10:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-26 12:10:06,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3453757225433526 [2023-08-26 12:10:06,545 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-26 12:10:06,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-26 12:10:06,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:06,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-26 12:10:06,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:06,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:06,548 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:06,548 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 162 flow. Second operand 4 states and 478 transitions. [2023-08-26 12:10:06,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 454 flow [2023-08-26 12:10:06,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:06,551 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 240 flow [2023-08-26 12:10:06,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2023-08-26 12:10:06,552 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -44 predicate places. [2023-08-26 12:10:06,552 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 240 flow [2023-08-26 12:10:06,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:06,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:06,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:06,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:10:06,552 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:06,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1723466722, now seen corresponding path program 1 times [2023-08-26 12:10:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414219986] [2023-08-26 12:10:06,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:06,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:06,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414219986] [2023-08-26 12:10:06,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414219986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:06,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:06,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795757552] [2023-08-26 12:10:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:06,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:06,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:06,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 346 [2023-08-26 12:10:06,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:06,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:06,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 346 [2023-08-26 12:10:06,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:07,558 INFO L124 PetriNetUnfolderBase]: 5337/8682 cut-off events. [2023-08-26 12:10:07,558 INFO L125 PetriNetUnfolderBase]: For 6453/6548 co-relation queries the response was YES. [2023-08-26 12:10:07,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26520 conditions, 8682 events. 5337/8682 cut-off events. For 6453/6548 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 60665 event pairs, 2726 based on Foata normal form. 130/8488 useless extension candidates. Maximal degree in co-relation 26511. Up to 4867 conditions per place. [2023-08-26 12:10:07,592 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 78 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2023-08-26 12:10:07,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 553 flow [2023-08-26 12:10:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-26 12:10:07,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34826589595375723 [2023-08-26 12:10:07,594 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-26 12:10:07,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-26 12:10:07,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:07,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-26 12:10:07,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:07,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:07,596 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:07,596 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 240 flow. Second operand 4 states and 482 transitions. [2023-08-26 12:10:07,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 553 flow [2023-08-26 12:10:07,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:07,622 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 262 flow [2023-08-26 12:10:07,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2023-08-26 12:10:07,623 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -41 predicate places. [2023-08-26 12:10:07,623 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 262 flow [2023-08-26 12:10:07,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:07,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:07,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:07,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:10:07,624 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:07,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:07,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1985096356, now seen corresponding path program 2 times [2023-08-26 12:10:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:07,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509191499] [2023-08-26 12:10:07,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509191499] [2023-08-26 12:10:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509191499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:07,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:07,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091213367] [2023-08-26 12:10:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:07,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:07,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:07,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 346 [2023-08-26 12:10:07,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:07,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:07,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 346 [2023-08-26 12:10:07,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:08,787 INFO L124 PetriNetUnfolderBase]: 5232/8527 cut-off events. [2023-08-26 12:10:08,788 INFO L125 PetriNetUnfolderBase]: For 8157/8276 co-relation queries the response was YES. [2023-08-26 12:10:08,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26637 conditions, 8527 events. 5232/8527 cut-off events. For 8157/8276 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 59739 event pairs, 2237 based on Foata normal form. 154/8374 useless extension candidates. Maximal degree in co-relation 26627. Up to 6013 conditions per place. [2023-08-26 12:10:08,825 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 72 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-26 12:10:08,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 495 flow [2023-08-26 12:10:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-26 12:10:08,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468208092485549 [2023-08-26 12:10:08,828 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-26 12:10:08,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-26 12:10:08,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:08,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-26 12:10:08,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:08,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:08,831 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:08,831 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 262 flow. Second operand 4 states and 480 transitions. [2023-08-26 12:10:08,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 495 flow [2023-08-26 12:10:08,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 486 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:08,859 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 253 flow [2023-08-26 12:10:08,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-26 12:10:08,859 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -42 predicate places. [2023-08-26 12:10:08,859 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 253 flow [2023-08-26 12:10:08,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:08,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:08,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:08,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:10:08,860 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:08,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1293834567, now seen corresponding path program 1 times [2023-08-26 12:10:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:08,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646557285] [2023-08-26 12:10:08,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:09,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:09,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646557285] [2023-08-26 12:10:09,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646557285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:09,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:09,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:09,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305020995] [2023-08-26 12:10:09,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:09,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:09,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:09,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 346 [2023-08-26 12:10:09,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:09,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:09,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 346 [2023-08-26 12:10:09,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:10,658 INFO L124 PetriNetUnfolderBase]: 8937/14209 cut-off events. [2023-08-26 12:10:10,658 INFO L125 PetriNetUnfolderBase]: For 15938/16702 co-relation queries the response was YES. [2023-08-26 12:10:10,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43213 conditions, 14209 events. 8937/14209 cut-off events. For 15938/16702 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 106193 event pairs, 2294 based on Foata normal form. 447/13622 useless extension candidates. Maximal degree in co-relation 43204. Up to 5234 conditions per place. [2023-08-26 12:10:10,707 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 92 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2023-08-26 12:10:10,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 666 flow [2023-08-26 12:10:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-08-26 12:10:10,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046242774566474 [2023-08-26 12:10:10,709 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-08-26 12:10:10,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-08-26 12:10:10,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:10,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-08-26 12:10:10,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:10,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:10,712 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:10,712 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 253 flow. Second operand 4 states and 560 transitions. [2023-08-26 12:10:10,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 666 flow [2023-08-26 12:10:10,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:10,733 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 268 flow [2023-08-26 12:10:10,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-08-26 12:10:10,734 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 12:10:10,734 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 268 flow [2023-08-26 12:10:10,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:10,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:10,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:10,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:10:10,734 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:10,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1887781290, now seen corresponding path program 1 times [2023-08-26 12:10:10,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:10,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423851898] [2023-08-26 12:10:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:10,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:10,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423851898] [2023-08-26 12:10:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423851898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:10,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404549633] [2023-08-26 12:10:10,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:10,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:10,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:10,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 346 [2023-08-26 12:10:10,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:10,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:10,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 346 [2023-08-26 12:10:10,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:11,846 INFO L124 PetriNetUnfolderBase]: 6714/10624 cut-off events. [2023-08-26 12:10:11,846 INFO L125 PetriNetUnfolderBase]: For 7607/7647 co-relation queries the response was YES. [2023-08-26 12:10:11,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34078 conditions, 10624 events. 6714/10624 cut-off events. For 7607/7647 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 71351 event pairs, 3138 based on Foata normal form. 278/10569 useless extension candidates. Maximal degree in co-relation 34067. Up to 4053 conditions per place. [2023-08-26 12:10:11,895 INFO L140 encePairwiseOnDemand]: 329/346 looper letters, 62 selfloop transitions, 17 changer transitions 0/80 dead transitions. [2023-08-26 12:10:11,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 568 flow [2023-08-26 12:10:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2023-08-26 12:10:11,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3309248554913295 [2023-08-26 12:10:11,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2023-08-26 12:10:11,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2023-08-26 12:10:11,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:11,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2023-08-26 12:10:11,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:11,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:11,900 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:11,900 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 268 flow. Second operand 4 states and 458 transitions. [2023-08-26 12:10:11,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 568 flow [2023-08-26 12:10:11,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:11,919 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 436 flow [2023-08-26 12:10:11,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=436, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2023-08-26 12:10:11,920 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -36 predicate places. [2023-08-26 12:10:11,920 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 436 flow [2023-08-26 12:10:11,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:11,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:11,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:11,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:10:11,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:11,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash 965723041, now seen corresponding path program 1 times [2023-08-26 12:10:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:11,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150302519] [2023-08-26 12:10:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150302519] [2023-08-26 12:10:12,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150302519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:12,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:12,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169288332] [2023-08-26 12:10:12,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:12,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:12,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:12,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 346 [2023-08-26 12:10:12,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 436 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:12,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:12,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 346 [2023-08-26 12:10:12,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:13,078 INFO L124 PetriNetUnfolderBase]: 5702/9515 cut-off events. [2023-08-26 12:10:13,078 INFO L125 PetriNetUnfolderBase]: For 13566/13689 co-relation queries the response was YES. [2023-08-26 12:10:13,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34188 conditions, 9515 events. 5702/9515 cut-off events. For 13566/13689 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 68553 event pairs, 1508 based on Foata normal form. 65/9142 useless extension candidates. Maximal degree in co-relation 34176. Up to 6375 conditions per place. [2023-08-26 12:10:13,117 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 80 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-26 12:10:13,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 105 transitions, 849 flow [2023-08-26 12:10:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-26 12:10:13,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40173410404624277 [2023-08-26 12:10:13,119 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-26 12:10:13,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-26 12:10:13,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:13,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-26 12:10:13,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:13,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:13,122 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:13,122 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 436 flow. Second operand 4 states and 556 transitions. [2023-08-26 12:10:13,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 105 transitions, 849 flow [2023-08-26 12:10:13,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 105 transitions, 841 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:13,201 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 509 flow [2023-08-26 12:10:13,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2023-08-26 12:10:13,201 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -32 predicate places. [2023-08-26 12:10:13,201 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 509 flow [2023-08-26 12:10:13,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:13,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:13,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:13,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:10:13,202 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:13,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1608321693, now seen corresponding path program 1 times [2023-08-26 12:10:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:13,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007232048] [2023-08-26 12:10:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:13,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:13,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007232048] [2023-08-26 12:10:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007232048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:13,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:13,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:10:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842151423] [2023-08-26 12:10:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:13,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:10:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:13,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:10:13,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:10:13,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 346 [2023-08-26 12:10:13,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 509 flow. Second operand has 8 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:13,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:13,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 346 [2023-08-26 12:10:13,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:14,273 INFO L124 PetriNetUnfolderBase]: 5106/8167 cut-off events. [2023-08-26 12:10:14,273 INFO L125 PetriNetUnfolderBase]: For 10699/10731 co-relation queries the response was YES. [2023-08-26 12:10:14,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30395 conditions, 8167 events. 5106/8167 cut-off events. For 10699/10731 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 53168 event pairs, 651 based on Foata normal form. 270/8271 useless extension candidates. Maximal degree in co-relation 30380. Up to 3192 conditions per place. [2023-08-26 12:10:14,305 INFO L140 encePairwiseOnDemand]: 328/346 looper letters, 102 selfloop transitions, 28 changer transitions 0/131 dead transitions. [2023-08-26 12:10:14,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 131 transitions, 1181 flow [2023-08-26 12:10:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:10:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:10:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2023-08-26 12:10:14,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31213872832369943 [2023-08-26 12:10:14,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 756 transitions. [2023-08-26 12:10:14,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 756 transitions. [2023-08-26 12:10:14,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:14,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 756 transitions. [2023-08-26 12:10:14,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,312 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 509 flow. Second operand 7 states and 756 transitions. [2023-08-26 12:10:14,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 131 transitions, 1181 flow [2023-08-26 12:10:14,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 131 transitions, 1168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:14,369 INFO L231 Difference]: Finished difference. Result has 73 places, 85 transitions, 809 flow [2023-08-26 12:10:14,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=809, PETRI_PLACES=73, PETRI_TRANSITIONS=85} [2023-08-26 12:10:14,370 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -24 predicate places. [2023-08-26 12:10:14,370 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 85 transitions, 809 flow [2023-08-26 12:10:14,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:14,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:14,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:10:14,371 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:14,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash -127357036, now seen corresponding path program 1 times [2023-08-26 12:10:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458715504] [2023-08-26 12:10:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458715504] [2023-08-26 12:10:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458715504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:15,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:15,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:10:15,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975388124] [2023-08-26 12:10:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:15,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:10:15,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:10:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:10:15,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 346 [2023-08-26 12:10:15,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 85 transitions, 809 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:15,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:15,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 346 [2023-08-26 12:10:15,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:16,856 INFO L124 PetriNetUnfolderBase]: 7405/12013 cut-off events. [2023-08-26 12:10:16,857 INFO L125 PetriNetUnfolderBase]: For 22447/22503 co-relation queries the response was YES. [2023-08-26 12:10:16,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48370 conditions, 12013 events. 7405/12013 cut-off events. For 22447/22503 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 86288 event pairs, 1201 based on Foata normal form. 120/11847 useless extension candidates. Maximal degree in co-relation 48353. Up to 5368 conditions per place. [2023-08-26 12:10:16,916 INFO L140 encePairwiseOnDemand]: 336/346 looper letters, 180 selfloop transitions, 34 changer transitions 3/218 dead transitions. [2023-08-26 12:10:16,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 218 transitions, 2385 flow [2023-08-26 12:10:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:10:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:10:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 823 transitions. [2023-08-26 12:10:16,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2973265895953757 [2023-08-26 12:10:16,920 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 823 transitions. [2023-08-26 12:10:16,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 823 transitions. [2023-08-26 12:10:16,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:16,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 823 transitions. [2023-08-26 12:10:16,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.875) internal successors, (823), 8 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 12:10:16,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 346.0) internal successors, (3114), 9 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:16,924 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 346.0) internal successors, (3114), 9 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:16,925 INFO L175 Difference]: Start difference. First operand has 73 places, 85 transitions, 809 flow. Second operand 8 states and 823 transitions. [2023-08-26 12:10:16,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 218 transitions, 2385 flow [2023-08-26 12:10:17,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 218 transitions, 2359 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:17,123 INFO L231 Difference]: Finished difference. Result has 83 places, 109 transitions, 1201 flow [2023-08-26 12:10:17,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1201, PETRI_PLACES=83, PETRI_TRANSITIONS=109} [2023-08-26 12:10:17,124 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -14 predicate places. [2023-08-26 12:10:17,124 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 109 transitions, 1201 flow [2023-08-26 12:10:17,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:17,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:17,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:10:17,125 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:17,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:17,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1681631593, now seen corresponding path program 1 times [2023-08-26 12:10:17,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:17,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358994588] [2023-08-26 12:10:17,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:17,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:17,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358994588] [2023-08-26 12:10:17,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358994588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:17,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:17,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:10:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847090164] [2023-08-26 12:10:17,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:17,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:10:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:10:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:10:17,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 346 [2023-08-26 12:10:17,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 109 transitions, 1201 flow. Second operand has 9 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:17,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 346 [2023-08-26 12:10:17,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:18,503 INFO L124 PetriNetUnfolderBase]: 6260/9624 cut-off events. [2023-08-26 12:10:18,503 INFO L125 PetriNetUnfolderBase]: For 26244/26268 co-relation queries the response was YES. [2023-08-26 12:10:18,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40724 conditions, 9624 events. 6260/9624 cut-off events. For 26244/26268 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 60520 event pairs, 2369 based on Foata normal form. 364/9988 useless extension candidates. Maximal degree in co-relation 40701. Up to 5579 conditions per place. [2023-08-26 12:10:18,537 INFO L140 encePairwiseOnDemand]: 333/346 looper letters, 26 selfloop transitions, 7 changer transitions 98/132 dead transitions. [2023-08-26 12:10:18,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 1587 flow [2023-08-26 12:10:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:10:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:10:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 726 transitions. [2023-08-26 12:10:18,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29975227085053674 [2023-08-26 12:10:18,541 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 726 transitions. [2023-08-26 12:10:18,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 726 transitions. [2023-08-26 12:10:18,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:18,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 726 transitions. [2023-08-26 12:10:18,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,545 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,545 INFO L175 Difference]: Start difference. First operand has 83 places, 109 transitions, 1201 flow. Second operand 7 states and 726 transitions. [2023-08-26 12:10:18,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 1587 flow [2023-08-26 12:10:18,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 132 transitions, 1552 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:10:18,703 INFO L231 Difference]: Finished difference. Result has 77 places, 27 transitions, 177 flow [2023-08-26 12:10:18,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=77, PETRI_TRANSITIONS=27} [2023-08-26 12:10:18,704 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -20 predicate places. [2023-08-26 12:10:18,704 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 27 transitions, 177 flow [2023-08-26 12:10:18,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:18,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:18,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:10:18,705 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:18,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1561879778, now seen corresponding path program 1 times [2023-08-26 12:10:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359199038] [2023-08-26 12:10:18,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:19,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359199038] [2023-08-26 12:10:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359199038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:19,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:19,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646021079] [2023-08-26 12:10:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:19,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:19,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:19,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 346 [2023-08-26 12:10:19,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 27 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:19,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 346 [2023-08-26 12:10:19,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:19,763 INFO L124 PetriNetUnfolderBase]: 754/1239 cut-off events. [2023-08-26 12:10:19,763 INFO L125 PetriNetUnfolderBase]: For 2858/2858 co-relation queries the response was YES. [2023-08-26 12:10:19,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 1239 events. 754/1239 cut-off events. For 2858/2858 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5339 event pairs, 550 based on Foata normal form. 6/1244 useless extension candidates. Maximal degree in co-relation 4045. Up to 823 conditions per place. [2023-08-26 12:10:19,768 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 45 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2023-08-26 12:10:19,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 55 transitions, 430 flow [2023-08-26 12:10:19,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:10:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:10:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2023-08-26 12:10:19,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3265895953757225 [2023-08-26 12:10:19,771 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions. [2023-08-26 12:10:19,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions. [2023-08-26 12:10:19,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:19,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions. [2023-08-26 12:10:19,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,774 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,774 INFO L175 Difference]: Start difference. First operand has 77 places, 27 transitions, 177 flow. Second operand 6 states and 678 transitions. [2023-08-26 12:10:19,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 55 transitions, 430 flow [2023-08-26 12:10:19,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 355 flow, removed 14 selfloop flow, removed 16 redundant places. [2023-08-26 12:10:19,778 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 211 flow [2023-08-26 12:10:19,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2023-08-26 12:10:19,778 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 12:10:19,778 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 211 flow [2023-08-26 12:10:19,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:19,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:19,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:10:19,779 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:19,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash -492204944, now seen corresponding path program 2 times [2023-08-26 12:10:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910564496] [2023-08-26 12:10:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910564496] [2023-08-26 12:10:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910564496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163950132] [2023-08-26 12:10:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:20,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:20,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 346 [2023-08-26 12:10:20,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 34 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:20,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 346 [2023-08-26 12:10:20,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:21,081 INFO L124 PetriNetUnfolderBase]: 844/1372 cut-off events. [2023-08-26 12:10:21,082 INFO L125 PetriNetUnfolderBase]: For 1854/1854 co-relation queries the response was YES. [2023-08-26 12:10:21,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4658 conditions, 1372 events. 844/1372 cut-off events. For 1854/1854 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6058 event pairs, 552 based on Foata normal form. 6/1377 useless extension candidates. Maximal degree in co-relation 4644. Up to 1250 conditions per place. [2023-08-26 12:10:21,086 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 39 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2023-08-26 12:10:21,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 48 transitions, 391 flow [2023-08-26 12:10:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-08-26 12:10:21,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33164739884393063 [2023-08-26 12:10:21,088 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-08-26 12:10:21,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-08-26 12:10:21,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:21,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-08-26 12:10:21,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,091 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,091 INFO L175 Difference]: Start difference. First operand has 58 places, 34 transitions, 211 flow. Second operand 4 states and 459 transitions. [2023-08-26 12:10:21,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 48 transitions, 391 flow [2023-08-26 12:10:21,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 48 transitions, 376 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:21,093 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 267 flow [2023-08-26 12:10:21,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-08-26 12:10:21,093 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -36 predicate places. [2023-08-26 12:10:21,093 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 267 flow [2023-08-26 12:10:21,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:21,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:10:21,094 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:21,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash -389985072, now seen corresponding path program 3 times [2023-08-26 12:10:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886924822] [2023-08-26 12:10:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:21,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886924822] [2023-08-26 12:10:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886924822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:21,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:21,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504911960] [2023-08-26 12:10:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:21,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:21,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:21,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 346 [2023-08-26 12:10:21,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:21,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 346 [2023-08-26 12:10:21,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:22,083 INFO L124 PetriNetUnfolderBase]: 896/1461 cut-off events. [2023-08-26 12:10:22,083 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2023-08-26 12:10:22,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5412 conditions, 1461 events. 896/1461 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6540 event pairs, 478 based on Foata normal form. 12/1472 useless extension candidates. Maximal degree in co-relation 5397. Up to 1292 conditions per place. [2023-08-26 12:10:22,089 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 37 selfloop transitions, 15 changer transitions 0/53 dead transitions. [2023-08-26 12:10:22,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 446 flow [2023-08-26 12:10:22,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:10:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:10:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2023-08-26 12:10:22,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33005780346820807 [2023-08-26 12:10:22,091 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2023-08-26 12:10:22,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2023-08-26 12:10:22,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:22,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2023-08-26 12:10:22,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:22,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:22,094 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:22,094 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 267 flow. Second operand 5 states and 571 transitions. [2023-08-26 12:10:22,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 446 flow [2023-08-26 12:10:22,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 431 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:22,097 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 348 flow [2023-08-26 12:10:22,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=348, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2023-08-26 12:10:22,098 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -33 predicate places. [2023-08-26 12:10:22,098 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 348 flow [2023-08-26 12:10:22,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:22,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:22,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:22,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:10:22,098 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:22,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1778115824, now seen corresponding path program 4 times [2023-08-26 12:10:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:22,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100082223] [2023-08-26 12:10:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:22,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100082223] [2023-08-26 12:10:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100082223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:10:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791106562] [2023-08-26 12:10:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:22,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:10:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:10:22,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:10:22,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 346 [2023-08-26 12:10:22,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 348 flow. Second operand has 9 states, 9 states have (on average 94.66666666666667) internal successors, (852), 9 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:22,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:22,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 346 [2023-08-26 12:10:22,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:23,240 INFO L124 PetriNetUnfolderBase]: 889/1452 cut-off events. [2023-08-26 12:10:23,240 INFO L125 PetriNetUnfolderBase]: For 3902/3902 co-relation queries the response was YES. [2023-08-26 12:10:23,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5943 conditions, 1452 events. 889/1452 cut-off events. For 3902/3902 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6553 event pairs, 328 based on Foata normal form. 4/1455 useless extension candidates. Maximal degree in co-relation 5927. Up to 775 conditions per place. [2023-08-26 12:10:23,246 INFO L140 encePairwiseOnDemand]: 337/346 looper letters, 63 selfloop transitions, 35 changer transitions 0/99 dead transitions. [2023-08-26 12:10:23,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 924 flow [2023-08-26 12:10:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:10:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:10:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 906 transitions. [2023-08-26 12:10:23,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2909441233140655 [2023-08-26 12:10:23,249 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 906 transitions. [2023-08-26 12:10:23,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 906 transitions. [2023-08-26 12:10:23,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:23,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 906 transitions. [2023-08-26 12:10:23,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.66666666666667) internal successors, (906), 9 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 346.0) internal successors, (3460), 10 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,253 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 346.0) internal successors, (3460), 10 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,253 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 348 flow. Second operand 9 states and 906 transitions. [2023-08-26 12:10:23,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 924 flow [2023-08-26 12:10:23,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 828 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:23,258 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 615 flow [2023-08-26 12:10:23,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=615, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-08-26 12:10:23,258 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -24 predicate places. [2023-08-26 12:10:23,258 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 615 flow [2023-08-26 12:10:23,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.66666666666667) internal successors, (852), 9 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:23,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:23,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:10:23,259 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:23,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash -936956356, now seen corresponding path program 5 times [2023-08-26 12:10:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:23,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139866380] [2023-08-26 12:10:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:24,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139866380] [2023-08-26 12:10:24,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139866380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:24,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:24,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814699637] [2023-08-26 12:10:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:24,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:24,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:24,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:24,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 346 [2023-08-26 12:10:24,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 615 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:24,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:24,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 346 [2023-08-26 12:10:24,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:24,376 INFO L124 PetriNetUnfolderBase]: 896/1469 cut-off events. [2023-08-26 12:10:24,376 INFO L125 PetriNetUnfolderBase]: For 5101/5101 co-relation queries the response was YES. [2023-08-26 12:10:24,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 1469 events. 896/1469 cut-off events. For 5101/5101 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6662 event pairs, 466 based on Foata normal form. 14/1482 useless extension candidates. Maximal degree in co-relation 6221. Up to 1258 conditions per place. [2023-08-26 12:10:24,383 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 44 selfloop transitions, 29 changer transitions 0/74 dead transitions. [2023-08-26 12:10:24,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 809 flow [2023-08-26 12:10:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:10:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:10:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2023-08-26 12:10:24,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32716763005780347 [2023-08-26 12:10:24,385 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2023-08-26 12:10:24,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2023-08-26 12:10:24,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:24,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2023-08-26 12:10:24,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:24,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:24,393 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:24,394 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 615 flow. Second operand 5 states and 566 transitions. [2023-08-26 12:10:24,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 74 transitions, 809 flow [2023-08-26 12:10:24,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 775 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:24,401 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 697 flow [2023-08-26 12:10:24,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=697, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2023-08-26 12:10:24,402 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -21 predicate places. [2023-08-26 12:10:24,402 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 697 flow [2023-08-26 12:10:24,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:24,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:24,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:10:24,402 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:24,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1007820387, now seen corresponding path program 1 times [2023-08-26 12:10:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:24,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109983553] [2023-08-26 12:10:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109983553] [2023-08-26 12:10:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109983553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:25,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82550697] [2023-08-26 12:10:25,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:25,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:25,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 346 [2023-08-26 12:10:25,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:25,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 346 [2023-08-26 12:10:25,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:25,472 INFO L124 PetriNetUnfolderBase]: 948/1561 cut-off events. [2023-08-26 12:10:25,472 INFO L125 PetriNetUnfolderBase]: For 7603/7603 co-relation queries the response was YES. [2023-08-26 12:10:25,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7051 conditions, 1561 events. 948/1561 cut-off events. For 7603/7603 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7393 event pairs, 290 based on Foata normal form. 12/1572 useless extension candidates. Maximal degree in co-relation 7030. Up to 972 conditions per place. [2023-08-26 12:10:25,479 INFO L140 encePairwiseOnDemand]: 337/346 looper letters, 45 selfloop transitions, 38 changer transitions 0/84 dead transitions. [2023-08-26 12:10:25,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 84 transitions, 975 flow [2023-08-26 12:10:25,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:10:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:10:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 681 transitions. [2023-08-26 12:10:25,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32803468208092484 [2023-08-26 12:10:25,481 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 681 transitions. [2023-08-26 12:10:25,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 681 transitions. [2023-08-26 12:10:25,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:25,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 681 transitions. [2023-08-26 12:10:25,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,484 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,484 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 697 flow. Second operand 6 states and 681 transitions. [2023-08-26 12:10:25,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 84 transitions, 975 flow [2023-08-26 12:10:25,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 921 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:25,494 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 823 flow [2023-08-26 12:10:25,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=823, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-08-26 12:10:25,495 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -18 predicate places. [2023-08-26 12:10:25,495 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 823 flow [2023-08-26 12:10:25,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:25,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:25,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:10:25,495 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:25,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash 967466385, now seen corresponding path program 1 times [2023-08-26 12:10:25,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:25,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879527974] [2023-08-26 12:10:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879527974] [2023-08-26 12:10:25,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879527974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:25,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:25,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:25,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775929857] [2023-08-26 12:10:25,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:25,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:25,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:25,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:25,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 12:10:25,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:25,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 12:10:25,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:25,779 INFO L124 PetriNetUnfolderBase]: 599/1074 cut-off events. [2023-08-26 12:10:25,779 INFO L125 PetriNetUnfolderBase]: For 6146/6220 co-relation queries the response was YES. [2023-08-26 12:10:25,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4892 conditions, 1074 events. 599/1074 cut-off events. For 6146/6220 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5440 event pairs, 105 based on Foata normal form. 95/1162 useless extension candidates. Maximal degree in co-relation 4870. Up to 890 conditions per place. [2023-08-26 12:10:25,784 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 89 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2023-08-26 12:10:25,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 1445 flow [2023-08-26 12:10:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-26 12:10:25,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3815028901734104 [2023-08-26 12:10:25,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-26 12:10:25,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-26 12:10:25,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:25,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-26 12:10:25,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,787 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 823 flow. Second operand 3 states and 396 transitions. [2023-08-26 12:10:25,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 1445 flow [2023-08-26 12:10:25,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 109 transitions, 1388 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:25,794 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 813 flow [2023-08-26 12:10:25,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2023-08-26 12:10:25,795 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -18 predicate places. [2023-08-26 12:10:25,795 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 813 flow [2023-08-26 12:10:25,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:25,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:25,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:10:25,795 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:25,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:25,795 INFO L85 PathProgramCache]: Analyzing trace with hash -782420182, now seen corresponding path program 1 times [2023-08-26 12:10:25,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091299327] [2023-08-26 12:10:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:25,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091299327] [2023-08-26 12:10:25,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091299327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:25,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:25,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296200251] [2023-08-26 12:10:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:25,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:25,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 12:10:25,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 813 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:25,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 12:10:25,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:26,046 INFO L124 PetriNetUnfolderBase]: 307/628 cut-off events. [2023-08-26 12:10:26,046 INFO L125 PetriNetUnfolderBase]: For 2976/2998 co-relation queries the response was YES. [2023-08-26 12:10:26,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3170 conditions, 628 events. 307/628 cut-off events. For 2976/2998 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3014 event pairs, 24 based on Foata normal form. 71/695 useless extension candidates. Maximal degree in co-relation 3147. Up to 238 conditions per place. [2023-08-26 12:10:26,048 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 95 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-08-26 12:10:26,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 1468 flow [2023-08-26 12:10:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2023-08-26 12:10:26,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3800578034682081 [2023-08-26 12:10:26,050 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 526 transitions. [2023-08-26 12:10:26,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 526 transitions. [2023-08-26 12:10:26,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:26,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 526 transitions. [2023-08-26 12:10:26,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,052 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,052 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 813 flow. Second operand 4 states and 526 transitions. [2023-08-26 12:10:26,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 1468 flow [2023-08-26 12:10:26,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 1426 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:26,058 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 737 flow [2023-08-26 12:10:26,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=737, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2023-08-26 12:10:26,058 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -17 predicate places. [2023-08-26 12:10:26,058 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 737 flow [2023-08-26 12:10:26,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:26,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:26,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 12:10:26,059 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:26,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1787391808, now seen corresponding path program 1 times [2023-08-26 12:10:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:26,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352693176] [2023-08-26 12:10:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:26,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:26,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352693176] [2023-08-26 12:10:26,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352693176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:26,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:26,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900598765] [2023-08-26 12:10:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:26,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:26,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:26,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:26,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 12:10:26,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 737 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:26,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 12:10:26,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:26,306 INFO L124 PetriNetUnfolderBase]: 244/501 cut-off events. [2023-08-26 12:10:26,307 INFO L125 PetriNetUnfolderBase]: For 2542/2561 co-relation queries the response was YES. [2023-08-26 12:10:26,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 501 events. 244/501 cut-off events. For 2542/2561 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2359 event pairs, 16 based on Foata normal form. 40/537 useless extension candidates. Maximal degree in co-relation 2597. Up to 238 conditions per place. [2023-08-26 12:10:26,309 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 90 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2023-08-26 12:10:26,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 1421 flow [2023-08-26 12:10:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:10:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:10:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2023-08-26 12:10:26,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739884393063584 [2023-08-26 12:10:26,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2023-08-26 12:10:26,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2023-08-26 12:10:26,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:26,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2023-08-26 12:10:26,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,313 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,313 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 737 flow. Second operand 5 states and 647 transitions. [2023-08-26 12:10:26,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 1421 flow [2023-08-26 12:10:26,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 1318 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-08-26 12:10:26,317 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 665 flow [2023-08-26 12:10:26,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=665, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2023-08-26 12:10:26,318 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -16 predicate places. [2023-08-26 12:10:26,318 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 665 flow [2023-08-26 12:10:26,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:26,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:26,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 12:10:26,318 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:26,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1523497646, now seen corresponding path program 1 times [2023-08-26 12:10:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060609408] [2023-08-26 12:10:26,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:10:26,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:10:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:10:26,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:10:26,479 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:10:26,479 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (99 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-08-26 12:10:26,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-08-26 12:10:26,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-08-26 12:10:26,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-08-26 12:10:26,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-08-26 12:10:26,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-08-26 12:10:26,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-08-26 12:10:26,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-08-26 12:10:26,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-08-26 12:10:26,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-08-26 12:10:26,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-08-26 12:10:26,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-08-26 12:10:26,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-08-26 12:10:26,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-08-26 12:10:26,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-08-26 12:10:26,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 12:10:26,487 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:26,492 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:10:26,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:10:26,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:10:26 BasicIcfg [2023-08-26 12:10:26,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:10:26,540 INFO L158 Benchmark]: Toolchain (without parser) took 47792.33ms. Allocated memory was 394.3MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 368.6MB in the beginning and 3.4GB in the end (delta: -3.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 12:10:26,540 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 394.3MB. Free memory is still 370.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:10:26,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.88ms. Allocated memory is still 394.3MB. Free memory was 368.6MB in the beginning and 342.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 12:10:26,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.64ms. Allocated memory is still 394.3MB. Free memory was 342.9MB in the beginning and 340.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:10:26,540 INFO L158 Benchmark]: Boogie Preprocessor took 52.94ms. Allocated memory is still 394.3MB. Free memory was 340.3MB in the beginning and 337.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:10:26,541 INFO L158 Benchmark]: RCFGBuilder took 1080.61ms. Allocated memory was 394.3MB in the beginning and 503.3MB in the end (delta: 109.1MB). Free memory was 337.7MB in the beginning and 376.0MB in the end (delta: -38.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. [2023-08-26 12:10:26,541 INFO L158 Benchmark]: TraceAbstraction took 46160.88ms. Allocated memory was 503.3MB in the beginning and 3.7GB in the end (delta: 3.2GB). Free memory was 470.9MB in the beginning and 3.4GB in the end (delta: -2.9GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 12:10:26,542 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.11ms. Allocated memory is still 394.3MB. Free memory is still 370.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 412.88ms. Allocated memory is still 394.3MB. Free memory was 368.6MB in the beginning and 342.9MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.64ms. Allocated memory is still 394.3MB. Free memory was 342.9MB in the beginning and 340.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.94ms. Allocated memory is still 394.3MB. Free memory was 340.3MB in the beginning and 337.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1080.61ms. Allocated memory was 394.3MB in the beginning and 503.3MB in the end (delta: 109.1MB). Free memory was 337.7MB in the beginning and 376.0MB in the end (delta: -38.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. * TraceAbstraction took 46160.88ms. Allocated memory was 503.3MB in the beginning and 3.7GB in the end (delta: 3.2GB). Free memory was 470.9MB in the beginning and 3.4GB in the end (delta: -2.9GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8s, 193 PlacesBefore, 97 PlacesAfterwards, 186 TransitionsBefore, 88 TransitionsAfterwards, 8612 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 157 TotalNumberOfCompositions, 49859 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10358, independent: 9563, independent conditional: 0, independent unconditional: 9563, dependent: 795, dependent conditional: 0, dependent unconditional: 795, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3166, independent: 3046, independent conditional: 0, independent unconditional: 3046, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10358, independent: 6517, independent conditional: 0, independent unconditional: 6517, dependent: 675, dependent conditional: 0, dependent unconditional: 675, unknown: 3166, unknown conditional: 0, unknown unconditional: 3166] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 417, Positive conditional cache size: 0, Positive unconditional cache size: 417, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=0, t1789={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1790; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={6:0}, t1790={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=1, t1789={6:0}, t1790={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1791; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=2, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L794] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe000_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 249 locations, 100 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: 46.0s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 884 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 884 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2142 IncrementalHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 19 mSDtfsCounter, 2142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1201occurred in iteration=13, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 3043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:10:26,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...