/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:30:05,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:30:05,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:30:05,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:30:05,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:30:05,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:30:05,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:30:05,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:30:05,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:30:05,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:30:05,647 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:30:05,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:30:05,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:30:05,648 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:30:05,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:30:05,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:30:05,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:30:05,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:30:05,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:30:05,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:30:05,649 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:30:05,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:30:05,650 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:30:05,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:30:05,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:30:05,650 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:30:05,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:30:05,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:30:05,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:30:05,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:30:05,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:30:05,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:30:05,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:30:05,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:30:05,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:30:05,652 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:30:05,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:30:05,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:30:05,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:30:05,944 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:30:05,948 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:30:05,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2023-08-26 18:30:07,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:30:07,288 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:30:07,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2023-08-26 18:30:07,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6491a88ae/2802f5cd20e449ba94f22b7a65a942b1/FLAG07d16b7d4 [2023-08-26 18:30:07,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6491a88ae/2802f5cd20e449ba94f22b7a65a942b1 [2023-08-26 18:30:07,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:30:07,312 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:30:07,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:30:07,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:30:07,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:30:07,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2b4d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07, skipping insertion in model container [2023-08-26 18:30:07,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,366 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:30:07,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:30:07,660 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:30:07,670 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:30:07,671 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:30:07,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:30:07,708 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:30:07,708 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:30:07,712 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:30:07,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07 WrapperNode [2023-08-26 18:30:07,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:30:07,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:30:07,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:30:07,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:30:07,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,749 INFO L138 Inliner]: procedures = 177, calls = 81, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2023-08-26 18:30:07,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:30:07,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:30:07,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:30:07,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:30:07,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:30:07,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:30:07,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:30:07,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:30:07,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (1/1) ... [2023-08-26 18:30:07,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:30:07,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:30:07,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:30:07,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:30:07,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:30:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:30:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:30:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:30:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:30:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:30:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:30:07,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:30:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:30:07,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:30:07,895 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:30:07,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:30:07,896 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:30:07,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:30:07,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:30:07,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:30:07,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:30:07,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:30:07,897 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:30:07,999 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:30:08,000 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:30:08,322 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:30:08,629 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:30:08,630 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:30:08,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:30:08 BoogieIcfgContainer [2023-08-26 18:30:08,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:30:08,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:30:08,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:30:08,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:30:08,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:30:07" (1/3) ... [2023-08-26 18:30:08,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f147ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:30:08, skipping insertion in model container [2023-08-26 18:30:08,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:30:07" (2/3) ... [2023-08-26 18:30:08,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f147ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:30:08, skipping insertion in model container [2023-08-26 18:30:08,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:30:08" (3/3) ... [2023-08-26 18:30:08,639 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2023-08-26 18:30:08,651 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:30:08,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-08-26 18:30:08,652 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:30:08,723 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:30:08,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 183 transitions, 386 flow [2023-08-26 18:30:08,826 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2023-08-26 18:30:08,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:30:08,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 179 events. 3/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 206 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-08-26 18:30:08,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 183 transitions, 386 flow [2023-08-26 18:30:08,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 179 transitions, 370 flow [2023-08-26 18:30:08,839 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:30:08,847 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 179 transitions, 370 flow [2023-08-26 18:30:08,850 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 179 transitions, 370 flow [2023-08-26 18:30:08,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 179 transitions, 370 flow [2023-08-26 18:30:08,891 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2023-08-26 18:30:08,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:30:08,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 179 events. 3/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 205 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-08-26 18:30:08,895 INFO L119 LiptonReduction]: Number of co-enabled transitions 6106 [2023-08-26 18:30:15,087 INFO L134 LiptonReduction]: Checked pairs total: 25199 [2023-08-26 18:30:15,087 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-08-26 18:30:15,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:30:15,105 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;@3041e838, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:30:15,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2023-08-26 18:30:15,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:30:15,106 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:30:15,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:30:15,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:15,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:30:15,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:15,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 869, now seen corresponding path program 1 times [2023-08-26 18:30:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:15,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227823990] [2023-08-26 18:30:15,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:15,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:15,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227823990] [2023-08-26 18:30:15,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227823990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:15,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:15,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:30:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440694294] [2023-08-26 18:30:15,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:15,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:30:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:15,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:30:15,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:30:15,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 340 [2023-08-26 18:30:15,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 144 flow. Second operand has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:15,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:15,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 340 [2023-08-26 18:30:15,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:17,319 INFO L124 PetriNetUnfolderBase]: 17076/23519 cut-off events. [2023-08-26 18:30:17,319 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 18:30:17,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46584 conditions, 23519 events. 17076/23519 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 1544. Compared 148491 event pairs, 17076 based on Foata normal form. 0/14813 useless extension candidates. Maximal degree in co-relation 46572. Up to 22928 conditions per place. [2023-08-26 18:30:17,438 INFO L140 encePairwiseOnDemand]: 321/340 looper letters, 39 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-08-26 18:30:17,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 46 transitions, 182 flow [2023-08-26 18:30:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:30:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:30:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 356 transitions. [2023-08-26 18:30:17,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235294117647059 [2023-08-26 18:30:17,449 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 356 transitions. [2023-08-26 18:30:17,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 356 transitions. [2023-08-26 18:30:17,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:17,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 356 transitions. [2023-08-26 18:30:17,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 178.0) internal successors, (356), 2 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:17,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:17,458 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:17,459 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 144 flow. Second operand 2 states and 356 transitions. [2023-08-26 18:30:17,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 46 transitions, 182 flow [2023-08-26 18:30:17,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:30:17,464 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 100 flow [2023-08-26 18:30:17,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-26 18:30:17,467 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -22 predicate places. [2023-08-26 18:30:17,467 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 100 flow [2023-08-26 18:30:17,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:17,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:17,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:30:17,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:30:17,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:17,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 855818, now seen corresponding path program 1 times [2023-08-26 18:30:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:17,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202689432] [2023-08-26 18:30:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:17,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202689432] [2023-08-26 18:30:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202689432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:17,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:30:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84892781] [2023-08-26 18:30:17,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:17,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:30:17,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:17,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:30:17,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:30:17,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 340 [2023-08-26 18:30:17,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:17,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:17,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 340 [2023-08-26 18:30:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:18,843 INFO L124 PetriNetUnfolderBase]: 10222/14121 cut-off events. [2023-08-26 18:30:18,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:30:18,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28065 conditions, 14121 events. 10222/14121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 81099 event pairs, 10222 based on Foata normal form. 0/10429 useless extension candidates. Maximal degree in co-relation 28062. Up to 13835 conditions per place. [2023-08-26 18:30:18,902 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 35 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-26 18:30:18,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 160 flow [2023-08-26 18:30:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:30:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:30:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-26 18:30:18,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42058823529411765 [2023-08-26 18:30:18,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-26 18:30:18,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-26 18:30:18,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:18,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-26 18:30:18,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:18,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:18,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:18,909 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 100 flow. Second operand 3 states and 429 transitions. [2023-08-26 18:30:18,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 160 flow [2023-08-26 18:30:18,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:30:18,910 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 90 flow [2023-08-26 18:30:18,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-26 18:30:18,911 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2023-08-26 18:30:18,911 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 90 flow [2023-08-26 18:30:18,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:18,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:18,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:30:18,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:30:18,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:18,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 855817, now seen corresponding path program 1 times [2023-08-26 18:30:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815519122] [2023-08-26 18:30:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:18,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:18,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815519122] [2023-08-26 18:30:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815519122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:18,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:18,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:30:18,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714165732] [2023-08-26 18:30:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:18,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:30:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:18,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:30:18,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:30:18,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 340 [2023-08-26 18:30:18,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:18,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:18,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 340 [2023-08-26 18:30:18,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:19,915 INFO L124 PetriNetUnfolderBase]: 7657/10870 cut-off events. [2023-08-26 18:30:19,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:30:19,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21619 conditions, 10870 events. 7657/10870 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64134 event pairs, 4627 based on Foata normal form. 0/9732 useless extension candidates. Maximal degree in co-relation 21615. Up to 6239 conditions per place. [2023-08-26 18:30:19,961 INFO L140 encePairwiseOnDemand]: 326/340 looper letters, 40 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-08-26 18:30:19,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 208 flow [2023-08-26 18:30:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:30:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:30:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-26 18:30:19,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176470588235294 [2023-08-26 18:30:19,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-26 18:30:19,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-26 18:30:19,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:19,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-26 18:30:19,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:19,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:19,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:19,967 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 90 flow. Second operand 3 states and 426 transitions. [2023-08-26 18:30:19,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 208 flow [2023-08-26 18:30:19,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:30:19,969 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 149 flow [2023-08-26 18:30:19,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-26 18:30:19,970 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -25 predicate places. [2023-08-26 18:30:19,970 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 149 flow [2023-08-26 18:30:19,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:19,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:19,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:19,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:30:19,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:19,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash 966535801, now seen corresponding path program 1 times [2023-08-26 18:30:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862195565] [2023-08-26 18:30:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:19,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:20,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:20,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862195565] [2023-08-26 18:30:20,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862195565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:20,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:20,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:30:20,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533476027] [2023-08-26 18:30:20,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:20,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:30:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:20,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:30:20,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:30:20,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 340 [2023-08-26 18:30:20,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:20,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:20,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 340 [2023-08-26 18:30:20,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:21,073 INFO L124 PetriNetUnfolderBase]: 6558/10182 cut-off events. [2023-08-26 18:30:21,073 INFO L125 PetriNetUnfolderBase]: For 3998/4508 co-relation queries the response was YES. [2023-08-26 18:30:21,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23879 conditions, 10182 events. 6558/10182 cut-off events. For 3998/4508 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 71813 event pairs, 1463 based on Foata normal form. 78/9560 useless extension candidates. Maximal degree in co-relation 23874. Up to 6761 conditions per place. [2023-08-26 18:30:21,121 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 60 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-26 18:30:21,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 365 flow [2023-08-26 18:30:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:30:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:30:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-08-26 18:30:21,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48627450980392156 [2023-08-26 18:30:21,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-08-26 18:30:21,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-08-26 18:30:21,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:21,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-08-26 18:30:21,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,127 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 149 flow. Second operand 3 states and 496 transitions. [2023-08-26 18:30:21,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 365 flow [2023-08-26 18:30:21,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:21,136 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 141 flow [2023-08-26 18:30:21,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=141, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-08-26 18:30:21,136 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -24 predicate places. [2023-08-26 18:30:21,136 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 141 flow [2023-08-26 18:30:21,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:21,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:21,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:30:21,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:21,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 966535515, now seen corresponding path program 1 times [2023-08-26 18:30:21,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:21,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280069200] [2023-08-26 18:30:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:21,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:21,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280069200] [2023-08-26 18:30:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280069200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:30:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014551519] [2023-08-26 18:30:21,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:21,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:30:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:21,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:30:21,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:30:21,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 340 [2023-08-26 18:30:21,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:21,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 340 [2023-08-26 18:30:21,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:21,855 INFO L124 PetriNetUnfolderBase]: 6207/9183 cut-off events. [2023-08-26 18:30:21,855 INFO L125 PetriNetUnfolderBase]: For 1744/1843 co-relation queries the response was YES. [2023-08-26 18:30:21,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22782 conditions, 9183 events. 6207/9183 cut-off events. For 1744/1843 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 56518 event pairs, 4021 based on Foata normal form. 0/8183 useless extension candidates. Maximal degree in co-relation 22776. Up to 5746 conditions per place. [2023-08-26 18:30:21,889 INFO L140 encePairwiseOnDemand]: 336/340 looper letters, 58 selfloop transitions, 3 changer transitions 1/71 dead transitions. [2023-08-26 18:30:21,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 348 flow [2023-08-26 18:30:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:30:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:30:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2023-08-26 18:30:21,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49117647058823527 [2023-08-26 18:30:21,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2023-08-26 18:30:21,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2023-08-26 18:30:21,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:21,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2023-08-26 18:30:21,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,894 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 141 flow. Second operand 3 states and 501 transitions. [2023-08-26 18:30:21,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 348 flow [2023-08-26 18:30:21,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:21,895 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 150 flow [2023-08-26 18:30:21,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-26 18:30:21,896 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2023-08-26 18:30:21,896 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 150 flow [2023-08-26 18:30:21,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:21,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:21,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:21,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:30:21,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:21,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -738700547, now seen corresponding path program 1 times [2023-08-26 18:30:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:21,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393935599] [2023-08-26 18:30:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393935599] [2023-08-26 18:30:22,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393935599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:22,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:22,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:30:22,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079993054] [2023-08-26 18:30:22,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:22,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:30:22,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:22,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:30:22,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:30:22,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 340 [2023-08-26 18:30:22,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:22,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:22,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 340 [2023-08-26 18:30:22,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:22,910 INFO L124 PetriNetUnfolderBase]: 6997/10026 cut-off events. [2023-08-26 18:30:22,911 INFO L125 PetriNetUnfolderBase]: For 2059/2059 co-relation queries the response was YES. [2023-08-26 18:30:22,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26009 conditions, 10026 events. 6997/10026 cut-off events. For 2059/2059 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 58096 event pairs, 2731 based on Foata normal form. 0/9590 useless extension candidates. Maximal degree in co-relation 26002. Up to 4087 conditions per place. [2023-08-26 18:30:22,944 INFO L140 encePairwiseOnDemand]: 331/340 looper letters, 70 selfloop transitions, 8 changer transitions 2/83 dead transitions. [2023-08-26 18:30:22,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 424 flow [2023-08-26 18:30:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:30:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:30:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-08-26 18:30:22,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2023-08-26 18:30:22,966 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-08-26 18:30:22,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-08-26 18:30:22,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:22,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-08-26 18:30:22,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:22,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:22,972 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:22,973 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 150 flow. Second operand 5 states and 685 transitions. [2023-08-26 18:30:22,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 424 flow [2023-08-26 18:30:22,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:22,986 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 200 flow [2023-08-26 18:30:22,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-26 18:30:22,986 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2023-08-26 18:30:22,986 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 200 flow [2023-08-26 18:30:22,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:22,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:22,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:22,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:30:22,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:22,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -102162540, now seen corresponding path program 1 times [2023-08-26 18:30:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354043078] [2023-08-26 18:30:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354043078] [2023-08-26 18:30:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354043078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:23,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:30:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21988354] [2023-08-26 18:30:23,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:23,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:30:23,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:23,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:30:23,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:30:23,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 340 [2023-08-26 18:30:23,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 200 flow. Second operand has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:23,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:23,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 340 [2023-08-26 18:30:23,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:24,467 INFO L124 PetriNetUnfolderBase]: 7141/10262 cut-off events. [2023-08-26 18:30:24,468 INFO L125 PetriNetUnfolderBase]: For 5235/5235 co-relation queries the response was YES. [2023-08-26 18:30:24,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28245 conditions, 10262 events. 7141/10262 cut-off events. For 5235/5235 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 61744 event pairs, 1406 based on Foata normal form. 171/10286 useless extension candidates. Maximal degree in co-relation 28236. Up to 2512 conditions per place. [2023-08-26 18:30:24,516 INFO L140 encePairwiseOnDemand]: 326/340 looper letters, 115 selfloop transitions, 27 changer transitions 9/154 dead transitions. [2023-08-26 18:30:24,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 154 transitions, 831 flow [2023-08-26 18:30:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 18:30:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 18:30:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1777 transitions. [2023-08-26 18:30:24,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37331932773109244 [2023-08-26 18:30:24,521 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1777 transitions. [2023-08-26 18:30:24,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1777 transitions. [2023-08-26 18:30:24,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:24,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1777 transitions. [2023-08-26 18:30:24,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 126.92857142857143) internal successors, (1777), 14 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:24,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 340.0) internal successors, (5100), 15 states have internal predecessors, (5100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:24,533 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 340.0) internal successors, (5100), 15 states have internal predecessors, (5100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:24,533 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 200 flow. Second operand 14 states and 1777 transitions. [2023-08-26 18:30:24,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 154 transitions, 831 flow [2023-08-26 18:30:24,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 154 transitions, 814 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:30:24,579 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 354 flow [2023-08-26 18:30:24,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=354, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-26 18:30:24,580 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2023-08-26 18:30:24,580 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 354 flow [2023-08-26 18:30:24,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:24,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:24,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:24,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:30:24,581 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:24,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash 52390967, now seen corresponding path program 1 times [2023-08-26 18:30:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:24,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700581422] [2023-08-26 18:30:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:24,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700581422] [2023-08-26 18:30:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700581422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:30:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937481118] [2023-08-26 18:30:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:24,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:30:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:30:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:30:24,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 340 [2023-08-26 18:30:24,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:24,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:24,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 340 [2023-08-26 18:30:24,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:26,098 INFO L124 PetriNetUnfolderBase]: 9873/14871 cut-off events. [2023-08-26 18:30:26,098 INFO L125 PetriNetUnfolderBase]: For 18649/19153 co-relation queries the response was YES. [2023-08-26 18:30:26,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42667 conditions, 14871 events. 9873/14871 cut-off events. For 18649/19153 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 105780 event pairs, 3015 based on Foata normal form. 210/14668 useless extension candidates. Maximal degree in co-relation 42655. Up to 5221 conditions per place. [2023-08-26 18:30:26,226 INFO L140 encePairwiseOnDemand]: 336/340 looper letters, 95 selfloop transitions, 3 changer transitions 0/110 dead transitions. [2023-08-26 18:30:26,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 771 flow [2023-08-26 18:30:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:30:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:30:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 655 transitions. [2023-08-26 18:30:26,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48161764705882354 [2023-08-26 18:30:26,228 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 655 transitions. [2023-08-26 18:30:26,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 655 transitions. [2023-08-26 18:30:26,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:26,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 655 transitions. [2023-08-26 18:30:26,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:26,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:26,232 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:26,232 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 354 flow. Second operand 4 states and 655 transitions. [2023-08-26 18:30:26,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 771 flow [2023-08-26 18:30:26,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 110 transitions, 744 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:26,502 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 352 flow [2023-08-26 18:30:26,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-08-26 18:30:26,502 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2023-08-26 18:30:26,502 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 352 flow [2023-08-26 18:30:26,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:26,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:26,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:26,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:30:26,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:26,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1127958378, now seen corresponding path program 1 times [2023-08-26 18:30:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922490485] [2023-08-26 18:30:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922490485] [2023-08-26 18:30:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922490485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:26,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:30:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682936690] [2023-08-26 18:30:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:26,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:30:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:26,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:30:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:30:26,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 340 [2023-08-26 18:30:26,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:26,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:26,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 340 [2023-08-26 18:30:26,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:27,553 INFO L124 PetriNetUnfolderBase]: 8937/12917 cut-off events. [2023-08-26 18:30:27,553 INFO L125 PetriNetUnfolderBase]: For 11382/11412 co-relation queries the response was YES. [2023-08-26 18:30:27,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40237 conditions, 12917 events. 8937/12917 cut-off events. For 11382/11412 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 81160 event pairs, 2770 based on Foata normal form. 153/12909 useless extension candidates. Maximal degree in co-relation 40224. Up to 5477 conditions per place. [2023-08-26 18:30:27,610 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 61 selfloop transitions, 20 changer transitions 1/85 dead transitions. [2023-08-26 18:30:27,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 85 transitions, 612 flow [2023-08-26 18:30:27,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:30:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:30:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-26 18:30:27,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3963235294117647 [2023-08-26 18:30:27,612 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-26 18:30:27,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-26 18:30:27,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:27,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-26 18:30:27,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:27,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:27,614 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:27,615 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 352 flow. Second operand 4 states and 539 transitions. [2023-08-26 18:30:27,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 85 transitions, 612 flow [2023-08-26 18:30:27,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 85 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:27,912 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 475 flow [2023-08-26 18:30:27,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2023-08-26 18:30:27,913 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2023-08-26 18:30:27,913 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 475 flow [2023-08-26 18:30:27,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:27,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:27,913 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 18:30:27,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:30:27,913 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:27,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2073939518, now seen corresponding path program 1 times [2023-08-26 18:30:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:27,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561591758] [2023-08-26 18:30:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:28,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561591758] [2023-08-26 18:30:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561591758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:28,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:30:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547872294] [2023-08-26 18:30:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:28,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:30:28,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:30:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:30:28,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 340 [2023-08-26 18:30:28,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:28,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:28,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 340 [2023-08-26 18:30:28,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:28,932 INFO L124 PetriNetUnfolderBase]: 7411/11255 cut-off events. [2023-08-26 18:30:28,932 INFO L125 PetriNetUnfolderBase]: For 20917/20953 co-relation queries the response was YES. [2023-08-26 18:30:28,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37978 conditions, 11255 events. 7411/11255 cut-off events. For 20917/20953 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 76076 event pairs, 1578 based on Foata normal form. 36/11130 useless extension candidates. Maximal degree in co-relation 37964. Up to 8538 conditions per place. [2023-08-26 18:30:28,985 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 70 selfloop transitions, 2 changer transitions 2/89 dead transitions. [2023-08-26 18:30:28,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 781 flow [2023-08-26 18:30:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:30:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:30:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-08-26 18:30:28,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745098039215686 [2023-08-26 18:30:28,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-08-26 18:30:28,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-08-26 18:30:28,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:28,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-08-26 18:30:28,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:28,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:28,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:28,989 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 475 flow. Second operand 3 states and 484 transitions. [2023-08-26 18:30:28,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 781 flow [2023-08-26 18:30:29,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 776 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:30:29,225 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 480 flow [2023-08-26 18:30:29,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2023-08-26 18:30:29,225 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2023-08-26 18:30:29,225 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 480 flow [2023-08-26 18:30:29,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:29,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:29,226 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 18:30:29,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:30:29,226 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:29,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash 606968219, now seen corresponding path program 1 times [2023-08-26 18:30:29,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:29,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682889356] [2023-08-26 18:30:29,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:29,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682889356] [2023-08-26 18:30:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682889356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:30:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631091027] [2023-08-26 18:30:29,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:29,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:30:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:30:29,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:30:29,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 340 [2023-08-26 18:30:29,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 480 flow. Second operand has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:29,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:29,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 340 [2023-08-26 18:30:29,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:30,262 INFO L124 PetriNetUnfolderBase]: 7882/11391 cut-off events. [2023-08-26 18:30:30,262 INFO L125 PetriNetUnfolderBase]: For 17906/17930 co-relation queries the response was YES. [2023-08-26 18:30:30,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39019 conditions, 11391 events. 7882/11391 cut-off events. For 17906/17930 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 70434 event pairs, 868 based on Foata normal form. 147/11425 useless extension candidates. Maximal degree in co-relation 39003. Up to 3517 conditions per place. [2023-08-26 18:30:30,315 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 86 selfloop transitions, 23 changer transitions 1/113 dead transitions. [2023-08-26 18:30:30,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 113 transitions, 913 flow [2023-08-26 18:30:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:30:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:30:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2023-08-26 18:30:30,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3777310924369748 [2023-08-26 18:30:30,317 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 899 transitions. [2023-08-26 18:30:30,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 899 transitions. [2023-08-26 18:30:30,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:30,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 899 transitions. [2023-08-26 18:30:30,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:30,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 340.0) internal successors, (2720), 8 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:30,321 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 340.0) internal successors, (2720), 8 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:30,321 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 480 flow. Second operand 7 states and 899 transitions. [2023-08-26 18:30:30,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 113 transitions, 913 flow [2023-08-26 18:30:30,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 113 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:30,539 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 641 flow [2023-08-26 18:30:30,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=641, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-08-26 18:30:30,540 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2023-08-26 18:30:30,540 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 641 flow [2023-08-26 18:30:30,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:30,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:30,540 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 18:30:30,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:30:30,541 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:30,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1611996722, now seen corresponding path program 1 times [2023-08-26 18:30:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14840134] [2023-08-26 18:30:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14840134] [2023-08-26 18:30:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14840134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:30,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:30,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:30:30,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900023432] [2023-08-26 18:30:30,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:30,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:30:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:30,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:30:30,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:30:30,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 340 [2023-08-26 18:30:30,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 641 flow. Second operand has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:30,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:30,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 340 [2023-08-26 18:30:30,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:32,140 INFO L124 PetriNetUnfolderBase]: 12390/18488 cut-off events. [2023-08-26 18:30:32,140 INFO L125 PetriNetUnfolderBase]: For 55950/56494 co-relation queries the response was YES. [2023-08-26 18:30:32,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67927 conditions, 18488 events. 12390/18488 cut-off events. For 55950/56494 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 129901 event pairs, 3494 based on Foata normal form. 238/18364 useless extension candidates. Maximal degree in co-relation 67909. Up to 6729 conditions per place. [2023-08-26 18:30:32,221 INFO L140 encePairwiseOnDemand]: 336/340 looper letters, 131 selfloop transitions, 4 changer transitions 2/153 dead transitions. [2023-08-26 18:30:32,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 153 transitions, 1660 flow [2023-08-26 18:30:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:30:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:30:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2023-08-26 18:30:32,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47573529411764703 [2023-08-26 18:30:32,223 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 647 transitions. [2023-08-26 18:30:32,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 647 transitions. [2023-08-26 18:30:32,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:32,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 647 transitions. [2023-08-26 18:30:32,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.75) internal successors, (647), 4 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 18:30:32,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:32,226 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:32,226 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 641 flow. Second operand 4 states and 647 transitions. [2023-08-26 18:30:32,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 153 transitions, 1660 flow [2023-08-26 18:30:32,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 153 transitions, 1638 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:32,714 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 663 flow [2023-08-26 18:30:32,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=663, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2023-08-26 18:30:32,715 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2023-08-26 18:30:32,715 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 663 flow [2023-08-26 18:30:32,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:32,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:32,715 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 18:30:32,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:30:32,715 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:32,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:32,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1636146039, now seen corresponding path program 1 times [2023-08-26 18:30:32,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:32,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355089677] [2023-08-26 18:30:32,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:32,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:32,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355089677] [2023-08-26 18:30:32,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355089677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:32,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:30:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469470158] [2023-08-26 18:30:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:32,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:30:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:32,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:30:32,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:30:32,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 340 [2023-08-26 18:30:32,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 663 flow. Second operand has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:32,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:32,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 340 [2023-08-26 18:30:32,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:34,146 INFO L124 PetriNetUnfolderBase]: 10518/15293 cut-off events. [2023-08-26 18:30:34,147 INFO L125 PetriNetUnfolderBase]: For 33487/33527 co-relation queries the response was YES. [2023-08-26 18:30:34,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55801 conditions, 15293 events. 10518/15293 cut-off events. For 33487/33527 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 98662 event pairs, 2248 based on Foata normal form. 239/15439 useless extension candidates. Maximal degree in co-relation 55780. Up to 4702 conditions per place. [2023-08-26 18:30:34,225 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 94 selfloop transitions, 21 changer transitions 4/122 dead transitions. [2023-08-26 18:30:34,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 122 transitions, 1084 flow [2023-08-26 18:30:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:30:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:30:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1019 transitions. [2023-08-26 18:30:34,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37463235294117647 [2023-08-26 18:30:34,227 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1019 transitions. [2023-08-26 18:30:34,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1019 transitions. [2023-08-26 18:30:34,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:34,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1019 transitions. [2023-08-26 18:30:34,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.375) internal successors, (1019), 8 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:34,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 340.0) internal successors, (3060), 9 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:34,232 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 340.0) internal successors, (3060), 9 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:34,232 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 663 flow. Second operand 8 states and 1019 transitions. [2023-08-26 18:30:34,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 122 transitions, 1084 flow [2023-08-26 18:30:34,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 122 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:34,810 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 717 flow [2023-08-26 18:30:34,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=717, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2023-08-26 18:30:34,811 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 17 predicate places. [2023-08-26 18:30:34,811 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 717 flow [2023-08-26 18:30:34,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:34,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:34,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:34,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:30:34,811 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:34,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -819077894, now seen corresponding path program 1 times [2023-08-26 18:30:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:34,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391520479] [2023-08-26 18:30:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:35,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 18:30:35,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:35,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391520479] [2023-08-26 18:30:35,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391520479] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:35,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:35,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-26 18:30:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911696221] [2023-08-26 18:30:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:35,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 18:30:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:35,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 18:30:35,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-08-26 18:30:35,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 340 [2023-08-26 18:30:35,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 717 flow. Second operand has 12 states, 12 states have (on average 114.58333333333333) internal successors, (1375), 12 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:35,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:35,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 340 [2023-08-26 18:30:35,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:37,566 INFO L124 PetriNetUnfolderBase]: 17187/25013 cut-off events. [2023-08-26 18:30:37,566 INFO L125 PetriNetUnfolderBase]: For 72953/73009 co-relation queries the response was YES. [2023-08-26 18:30:37,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96778 conditions, 25013 events. 17187/25013 cut-off events. For 72953/73009 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 175607 event pairs, 1800 based on Foata normal form. 255/25204 useless extension candidates. Maximal degree in co-relation 96756. Up to 4891 conditions per place. [2023-08-26 18:30:37,659 INFO L140 encePairwiseOnDemand]: 324/340 looper letters, 86 selfloop transitions, 37 changer transitions 73/199 dead transitions. [2023-08-26 18:30:37,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 199 transitions, 1992 flow [2023-08-26 18:30:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:30:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:30:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1367 transitions. [2023-08-26 18:30:37,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655080213903743 [2023-08-26 18:30:37,662 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1367 transitions. [2023-08-26 18:30:37,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1367 transitions. [2023-08-26 18:30:37,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:37,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1367 transitions. [2023-08-26 18:30:37,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.27272727272727) internal successors, (1367), 11 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:37,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 340.0) internal successors, (4080), 12 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:37,667 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 340.0) internal successors, (4080), 12 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:37,667 INFO L175 Difference]: Start difference. First operand has 95 places, 75 transitions, 717 flow. Second operand 11 states and 1367 transitions. [2023-08-26 18:30:37,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 199 transitions, 1992 flow [2023-08-26 18:30:39,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 199 transitions, 1916 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 18:30:39,041 INFO L231 Difference]: Finished difference. Result has 102 places, 77 transitions, 800 flow [2023-08-26 18:30:39,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=800, PETRI_PLACES=102, PETRI_TRANSITIONS=77} [2023-08-26 18:30:39,042 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 24 predicate places. [2023-08-26 18:30:39,042 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 77 transitions, 800 flow [2023-08-26 18:30:39,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 114.58333333333333) internal successors, (1375), 12 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:39,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:39,043 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 18:30:39,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:30:39,043 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:39,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1697398964, now seen corresponding path program 1 times [2023-08-26 18:30:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:39,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585149652] [2023-08-26 18:30:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:39,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:39,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585149652] [2023-08-26 18:30:39,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585149652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:39,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:39,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:30:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957288252] [2023-08-26 18:30:39,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:39,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:30:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:39,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:30:39,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:30:39,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 340 [2023-08-26 18:30:39,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 77 transitions, 800 flow. Second operand has 4 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:39,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:39,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 340 [2023-08-26 18:30:39,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:42,159 INFO L124 PetriNetUnfolderBase]: 19160/28948 cut-off events. [2023-08-26 18:30:42,159 INFO L125 PetriNetUnfolderBase]: For 92721/93849 co-relation queries the response was YES. [2023-08-26 18:30:42,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104551 conditions, 28948 events. 19160/28948 cut-off events. For 92721/93849 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 218876 event pairs, 5786 based on Foata normal form. 376/28814 useless extension candidates. Maximal degree in co-relation 104526. Up to 11204 conditions per place. [2023-08-26 18:30:42,456 INFO L140 encePairwiseOnDemand]: 336/340 looper letters, 148 selfloop transitions, 4 changer transitions 3/171 dead transitions. [2023-08-26 18:30:42,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 171 transitions, 2113 flow [2023-08-26 18:30:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:30:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:30:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 652 transitions. [2023-08-26 18:30:42,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47941176470588237 [2023-08-26 18:30:42,460 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 652 transitions. [2023-08-26 18:30:42,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 652 transitions. [2023-08-26 18:30:42,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:42,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 652 transitions. [2023-08-26 18:30:42,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.0) internal successors, (652), 4 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 18:30:42,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:42,462 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:42,462 INFO L175 Difference]: Start difference. First operand has 102 places, 77 transitions, 800 flow. Second operand 4 states and 652 transitions. [2023-08-26 18:30:42,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 171 transitions, 2113 flow [2023-08-26 18:30:43,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 171 transitions, 1932 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-26 18:30:43,914 INFO L231 Difference]: Finished difference. Result has 99 places, 78 transitions, 743 flow [2023-08-26 18:30:43,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=743, PETRI_PLACES=99, PETRI_TRANSITIONS=78} [2023-08-26 18:30:43,914 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2023-08-26 18:30:43,914 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 78 transitions, 743 flow [2023-08-26 18:30:43,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:43,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:43,914 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 18:30:43,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:30:43,915 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:43,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1069003607, now seen corresponding path program 1 times [2023-08-26 18:30:43,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:43,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027320703] [2023-08-26 18:30:43,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:43,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027320703] [2023-08-26 18:30:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027320703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:44,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-26 18:30:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437328431] [2023-08-26 18:30:44,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:44,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 18:30:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:44,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 18:30:44,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-08-26 18:30:44,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 340 [2023-08-26 18:30:44,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 78 transitions, 743 flow. Second operand has 12 states, 12 states have (on average 114.66666666666667) internal successors, (1376), 12 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:44,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:44,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 340 [2023-08-26 18:30:44,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:46,306 INFO L124 PetriNetUnfolderBase]: 14503/21274 cut-off events. [2023-08-26 18:30:46,307 INFO L125 PetriNetUnfolderBase]: For 54720/54821 co-relation queries the response was YES. [2023-08-26 18:30:46,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76302 conditions, 21274 events. 14503/21274 cut-off events. For 54720/54821 co-relation queries the response was YES. Maximal size of possible extension queue 1153. Compared 144221 event pairs, 622 based on Foata normal form. 375/21649 useless extension candidates. Maximal degree in co-relation 76278. Up to 8120 conditions per place. [2023-08-26 18:30:46,395 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 36 selfloop transitions, 8 changer transitions 78/125 dead transitions. [2023-08-26 18:30:46,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 125 transitions, 1136 flow [2023-08-26 18:30:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:30:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:30:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1212 transitions. [2023-08-26 18:30:46,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3564705882352941 [2023-08-26 18:30:46,398 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1212 transitions. [2023-08-26 18:30:46,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1212 transitions. [2023-08-26 18:30:46,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:46,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1212 transitions. [2023-08-26 18:30:46,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.2) internal successors, (1212), 10 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:46,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 340.0) internal successors, (3740), 11 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:46,410 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 340.0) internal successors, (3740), 11 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:46,410 INFO L175 Difference]: Start difference. First operand has 99 places, 78 transitions, 743 flow. Second operand 10 states and 1212 transitions. [2023-08-26 18:30:46,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 125 transitions, 1136 flow [2023-08-26 18:30:47,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 125 transitions, 1048 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-08-26 18:30:47,684 INFO L231 Difference]: Finished difference. Result has 96 places, 33 transitions, 179 flow [2023-08-26 18:30:47,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=179, PETRI_PLACES=96, PETRI_TRANSITIONS=33} [2023-08-26 18:30:47,685 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 18 predicate places. [2023-08-26 18:30:47,685 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 33 transitions, 179 flow [2023-08-26 18:30:47,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 114.66666666666667) internal successors, (1376), 12 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:47,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:47,699 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] [2023-08-26 18:30:47,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:30:47,699 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:47,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1988368873, now seen corresponding path program 1 times [2023-08-26 18:30:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:47,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539005973] [2023-08-26 18:30:47,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:48,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:48,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539005973] [2023-08-26 18:30:48,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539005973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:48,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:48,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:30:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39693301] [2023-08-26 18:30:48,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:48,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:30:48,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:30:48,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:30:48,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 340 [2023-08-26 18:30:48,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 33 transitions, 179 flow. Second operand has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:48,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:48,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 340 [2023-08-26 18:30:48,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:49,054 INFO L124 PetriNetUnfolderBase]: 1123/1780 cut-off events. [2023-08-26 18:30:49,054 INFO L125 PetriNetUnfolderBase]: For 2663/2664 co-relation queries the response was YES. [2023-08-26 18:30:49,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5133 conditions, 1780 events. 1123/1780 cut-off events. For 2663/2664 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8138 event pairs, 508 based on Foata normal form. 16/1778 useless extension candidates. Maximal degree in co-relation 5115. Up to 1229 conditions per place. [2023-08-26 18:30:49,062 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 49 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2023-08-26 18:30:49,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 62 transitions, 402 flow [2023-08-26 18:30:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:30:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:30:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 817 transitions. [2023-08-26 18:30:49,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34327731092436975 [2023-08-26 18:30:49,064 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 817 transitions. [2023-08-26 18:30:49,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 817 transitions. [2023-08-26 18:30:49,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:49,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 817 transitions. [2023-08-26 18:30:49,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:49,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 340.0) internal successors, (2720), 8 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:49,067 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 340.0) internal successors, (2720), 8 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:49,067 INFO L175 Difference]: Start difference. First operand has 96 places, 33 transitions, 179 flow. Second operand 7 states and 817 transitions. [2023-08-26 18:30:49,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 62 transitions, 402 flow [2023-08-26 18:30:49,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 323 flow, removed 11 selfloop flow, removed 18 redundant places. [2023-08-26 18:30:49,073 INFO L231 Difference]: Finished difference. Result has 70 places, 40 transitions, 188 flow [2023-08-26 18:30:49,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=70, PETRI_TRANSITIONS=40} [2023-08-26 18:30:49,073 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -8 predicate places. [2023-08-26 18:30:49,073 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 40 transitions, 188 flow [2023-08-26 18:30:49,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:49,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:49,074 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] [2023-08-26 18:30:49,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:30:49,074 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:49,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash 753246573, now seen corresponding path program 2 times [2023-08-26 18:30:49,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:49,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406958428] [2023-08-26 18:30:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:49,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406958428] [2023-08-26 18:30:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406958428] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:49,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:49,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:30:49,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589309876] [2023-08-26 18:30:49,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:49,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:30:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:30:49,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:30:49,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 340 [2023-08-26 18:30:49,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 40 transitions, 188 flow. Second operand has 10 states, 10 states have (on average 111.8) internal successors, (1118), 10 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:49,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:49,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 340 [2023-08-26 18:30:49,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:50,411 INFO L124 PetriNetUnfolderBase]: 1465/2323 cut-off events. [2023-08-26 18:30:50,411 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2023-08-26 18:30:50,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 2323 events. 1465/2323 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11435 event pairs, 432 based on Foata normal form. 16/2315 useless extension candidates. Maximal degree in co-relation 5860. Up to 1246 conditions per place. [2023-08-26 18:30:50,420 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 47 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2023-08-26 18:30:50,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 402 flow [2023-08-26 18:30:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:30:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:30:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 935 transitions. [2023-08-26 18:30:50,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2023-08-26 18:30:50,423 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 935 transitions. [2023-08-26 18:30:50,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 935 transitions. [2023-08-26 18:30:50,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:50,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 935 transitions. [2023-08-26 18:30:50,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:50,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 340.0) internal successors, (3060), 9 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:50,428 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 340.0) internal successors, (3060), 9 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:50,428 INFO L175 Difference]: Start difference. First operand has 70 places, 40 transitions, 188 flow. Second operand 8 states and 935 transitions. [2023-08-26 18:30:50,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 402 flow [2023-08-26 18:30:50,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 67 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:30:50,430 INFO L231 Difference]: Finished difference. Result has 79 places, 46 transitions, 272 flow [2023-08-26 18:30:50,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=272, PETRI_PLACES=79, PETRI_TRANSITIONS=46} [2023-08-26 18:30:50,430 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2023-08-26 18:30:50,430 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 46 transitions, 272 flow [2023-08-26 18:30:50,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.8) internal successors, (1118), 10 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:50,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:50,431 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] [2023-08-26 18:30:50,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:30:50,431 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:50,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash 293360429, now seen corresponding path program 3 times [2023-08-26 18:30:50,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:50,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641960051] [2023-08-26 18:30:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:50,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641960051] [2023-08-26 18:30:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641960051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:51,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:30:51,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742278183] [2023-08-26 18:30:51,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:51,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:30:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:30:51,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:30:51,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 340 [2023-08-26 18:30:51,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 46 transitions, 272 flow. Second operand has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:51,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:51,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 340 [2023-08-26 18:30:51,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:51,732 INFO L124 PetriNetUnfolderBase]: 1622/2567 cut-off events. [2023-08-26 18:30:51,732 INFO L125 PetriNetUnfolderBase]: For 1511/1511 co-relation queries the response was YES. [2023-08-26 18:30:51,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 2567 events. 1622/2567 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13140 event pairs, 384 based on Foata normal form. 16/2551 useless extension candidates. Maximal degree in co-relation 6868. Up to 1287 conditions per place. [2023-08-26 18:30:51,741 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 46 selfloop transitions, 22 changer transitions 0/71 dead transitions. [2023-08-26 18:30:51,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 71 transitions, 492 flow [2023-08-26 18:30:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:30:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:30:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1037 transitions. [2023-08-26 18:30:51,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3388888888888889 [2023-08-26 18:30:51,744 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1037 transitions. [2023-08-26 18:30:51,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1037 transitions. [2023-08-26 18:30:51,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:51,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1037 transitions. [2023-08-26 18:30:51,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:51,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 340.0) internal successors, (3400), 10 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:51,747 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 340.0) internal successors, (3400), 10 states have internal predecessors, (3400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:51,747 INFO L175 Difference]: Start difference. First operand has 79 places, 46 transitions, 272 flow. Second operand 9 states and 1037 transitions. [2023-08-26 18:30:51,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 71 transitions, 492 flow [2023-08-26 18:30:51,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 71 transitions, 470 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 18:30:51,750 INFO L231 Difference]: Finished difference. Result has 87 places, 51 transitions, 353 flow [2023-08-26 18:30:51,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=353, PETRI_PLACES=87, PETRI_TRANSITIONS=51} [2023-08-26 18:30:51,750 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2023-08-26 18:30:51,750 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 51 transitions, 353 flow [2023-08-26 18:30:51,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:51,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:51,751 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] [2023-08-26 18:30:51,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:30:51,751 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:51,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash -704341963, now seen corresponding path program 4 times [2023-08-26 18:30:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:51,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023158723] [2023-08-26 18:30:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:51,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:52,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023158723] [2023-08-26 18:30:52,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023158723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:52,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:52,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:30:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827338628] [2023-08-26 18:30:52,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:30:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:30:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:30:52,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 340 [2023-08-26 18:30:52,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 51 transitions, 353 flow. Second operand has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:52,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:52,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 340 [2023-08-26 18:30:52,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:53,115 INFO L124 PetriNetUnfolderBase]: 1602/2551 cut-off events. [2023-08-26 18:30:53,115 INFO L125 PetriNetUnfolderBase]: For 2198/2198 co-relation queries the response was YES. [2023-08-26 18:30:53,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7147 conditions, 2551 events. 1602/2551 cut-off events. For 2198/2198 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 13103 event pairs, 366 based on Foata normal form. 8/2514 useless extension candidates. Maximal degree in co-relation 7130. Up to 1539 conditions per place. [2023-08-26 18:30:53,127 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 43 selfloop transitions, 24 changer transitions 0/70 dead transitions. [2023-08-26 18:30:53,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 70 transitions, 542 flow [2023-08-26 18:30:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:30:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:30:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1143 transitions. [2023-08-26 18:30:53,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3361764705882353 [2023-08-26 18:30:53,129 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1143 transitions. [2023-08-26 18:30:53,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1143 transitions. [2023-08-26 18:30:53,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:53,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1143 transitions. [2023-08-26 18:30:53,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.3) internal successors, (1143), 10 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 340.0) internal successors, (3740), 11 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,132 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 340.0) internal successors, (3740), 11 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,132 INFO L175 Difference]: Start difference. First operand has 87 places, 51 transitions, 353 flow. Second operand 10 states and 1143 transitions. [2023-08-26 18:30:53,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 70 transitions, 542 flow [2023-08-26 18:30:53,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 70 transitions, 516 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-26 18:30:53,136 INFO L231 Difference]: Finished difference. Result has 92 places, 52 transitions, 400 flow [2023-08-26 18:30:53,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=400, PETRI_PLACES=92, PETRI_TRANSITIONS=52} [2023-08-26 18:30:53,136 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 14 predicate places. [2023-08-26 18:30:53,136 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 52 transitions, 400 flow [2023-08-26 18:30:53,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:53,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:53,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:30:53,137 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:53,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1268980096, now seen corresponding path program 1 times [2023-08-26 18:30:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320195429] [2023-08-26 18:30:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:53,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320195429] [2023-08-26 18:30:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320195429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:53,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:53,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:30:53,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675940159] [2023-08-26 18:30:53,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:53,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:30:53,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:53,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:30:53,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:30:53,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 340 [2023-08-26 18:30:53,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 52 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:53,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 340 [2023-08-26 18:30:53,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:53,385 INFO L124 PetriNetUnfolderBase]: 1186/1973 cut-off events. [2023-08-26 18:30:53,385 INFO L125 PetriNetUnfolderBase]: For 2486/2486 co-relation queries the response was YES. [2023-08-26 18:30:53,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5402 conditions, 1973 events. 1186/1973 cut-off events. For 2486/2486 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10859 event pairs, 376 based on Foata normal form. 25/1972 useless extension candidates. Maximal degree in co-relation 5384. Up to 1816 conditions per place. [2023-08-26 18:30:53,393 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 62 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2023-08-26 18:30:53,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 77 transitions, 728 flow [2023-08-26 18:30:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:30:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:30:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-08-26 18:30:53,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2023-08-26 18:30:53,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-08-26 18:30:53,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-08-26 18:30:53,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:53,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-08-26 18:30:53,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,400 INFO L175 Difference]: Start difference. First operand has 92 places, 52 transitions, 400 flow. Second operand 3 states and 468 transitions. [2023-08-26 18:30:53,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 77 transitions, 728 flow [2023-08-26 18:30:53,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 77 transitions, 653 flow, removed 4 selfloop flow, removed 8 redundant places. [2023-08-26 18:30:53,402 INFO L231 Difference]: Finished difference. Result has 87 places, 56 transitions, 377 flow [2023-08-26 18:30:53,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=377, PETRI_PLACES=87, PETRI_TRANSITIONS=56} [2023-08-26 18:30:53,402 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2023-08-26 18:30:53,402 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 56 transitions, 377 flow [2023-08-26 18:30:53,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:53,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:53,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:30:53,403 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:53,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1972788179, now seen corresponding path program 1 times [2023-08-26 18:30:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:53,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471222686] [2023-08-26 18:30:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471222686] [2023-08-26 18:30:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471222686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:53,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:30:53,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277495383] [2023-08-26 18:30:53,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:53,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:30:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:53,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:30:53,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:30:53,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 340 [2023-08-26 18:30:53,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 56 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:53,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 340 [2023-08-26 18:30:53,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:53,647 INFO L124 PetriNetUnfolderBase]: 834/1477 cut-off events. [2023-08-26 18:30:53,647 INFO L125 PetriNetUnfolderBase]: For 2310/2402 co-relation queries the response was YES. [2023-08-26 18:30:53,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 1477 events. 834/1477 cut-off events. For 2310/2402 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8023 event pairs, 92 based on Foata normal form. 96/1549 useless extension candidates. Maximal degree in co-relation 5033. Up to 979 conditions per place. [2023-08-26 18:30:53,653 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 78 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2023-08-26 18:30:53,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 97 transitions, 879 flow [2023-08-26 18:30:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:30:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:30:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2023-08-26 18:30:53,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45808823529411763 [2023-08-26 18:30:53,654 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 623 transitions. [2023-08-26 18:30:53,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 623 transitions. [2023-08-26 18:30:53,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:53,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 623 transitions. [2023-08-26 18:30:53,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,657 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,658 INFO L175 Difference]: Start difference. First operand has 87 places, 56 transitions, 377 flow. Second operand 4 states and 623 transitions. [2023-08-26 18:30:53,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 97 transitions, 879 flow [2023-08-26 18:30:53,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 97 transitions, 874 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:30:53,662 INFO L231 Difference]: Finished difference. Result has 90 places, 60 transitions, 424 flow [2023-08-26 18:30:53,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=90, PETRI_TRANSITIONS=60} [2023-08-26 18:30:53,663 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 12 predicate places. [2023-08-26 18:30:53,663 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 60 transitions, 424 flow [2023-08-26 18:30:53,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:53,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:53,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 18:30:53,664 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:53,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash 190141385, now seen corresponding path program 1 times [2023-08-26 18:30:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:53,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573055223] [2023-08-26 18:30:53,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:53,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573055223] [2023-08-26 18:30:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573055223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:53,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:53,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:30:53,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774935098] [2023-08-26 18:30:53,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:53,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:30:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:53,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:30:53,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:30:53,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 340 [2023-08-26 18:30:53,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 60 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:53,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 340 [2023-08-26 18:30:53,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:53,894 INFO L124 PetriNetUnfolderBase]: 604/1113 cut-off events. [2023-08-26 18:30:53,894 INFO L125 PetriNetUnfolderBase]: For 3120/3330 co-relation queries the response was YES. [2023-08-26 18:30:53,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 1113 events. 604/1113 cut-off events. For 3120/3330 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6078 event pairs, 30 based on Foata normal form. 126/1215 useless extension candidates. Maximal degree in co-relation 4589. Up to 590 conditions per place. [2023-08-26 18:30:53,900 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 86 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2023-08-26 18:30:53,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 1020 flow [2023-08-26 18:30:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:30:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:30:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 775 transitions. [2023-08-26 18:30:53,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2023-08-26 18:30:53,901 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 775 transitions. [2023-08-26 18:30:53,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 775 transitions. [2023-08-26 18:30:53,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:53,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 775 transitions. [2023-08-26 18:30:53,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,903 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,903 INFO L175 Difference]: Start difference. First operand has 90 places, 60 transitions, 424 flow. Second operand 5 states and 775 transitions. [2023-08-26 18:30:53,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 1020 flow [2023-08-26 18:30:53,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 109 transitions, 1002 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 18:30:53,907 INFO L231 Difference]: Finished difference. Result has 93 places, 64 transitions, 474 flow [2023-08-26 18:30:53,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=93, PETRI_TRANSITIONS=64} [2023-08-26 18:30:53,908 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2023-08-26 18:30:53,908 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 64 transitions, 474 flow [2023-08-26 18:30:53,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:53,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:53,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:53,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 18:30:53,909 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:53,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1572031891, now seen corresponding path program 1 times [2023-08-26 18:30:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:53,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091820847] [2023-08-26 18:30:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:30:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:30:54,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:30:54,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091820847] [2023-08-26 18:30:54,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091820847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:30:54,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:30:54,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:30:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434644798] [2023-08-26 18:30:54,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:30:54,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:30:54,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:30:54,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:30:54,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:30:54,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 340 [2023-08-26 18:30:54,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 64 transitions, 474 flow. Second operand has 6 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:54,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:30:54,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 340 [2023-08-26 18:30:54,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:30:54,178 INFO L124 PetriNetUnfolderBase]: 560/1015 cut-off events. [2023-08-26 18:30:54,179 INFO L125 PetriNetUnfolderBase]: For 3561/3771 co-relation queries the response was YES. [2023-08-26 18:30:54,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 1015 events. 560/1015 cut-off events. For 3561/3771 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5526 event pairs, 24 based on Foata normal form. 90/1081 useless extension candidates. Maximal degree in co-relation 4399. Up to 378 conditions per place. [2023-08-26 18:30:54,184 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 82 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2023-08-26 18:30:54,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 109 transitions, 1046 flow [2023-08-26 18:30:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:30:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:30:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions. [2023-08-26 18:30:54,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2023-08-26 18:30:54,185 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 918 transitions. [2023-08-26 18:30:54,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 918 transitions. [2023-08-26 18:30:54,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:30:54,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 918 transitions. [2023-08-26 18:30:54,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:54,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:54,188 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:54,188 INFO L175 Difference]: Start difference. First operand has 93 places, 64 transitions, 474 flow. Second operand 6 states and 918 transitions. [2023-08-26 18:30:54,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 109 transitions, 1046 flow [2023-08-26 18:30:54,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 109 transitions, 976 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 18:30:54,198 INFO L231 Difference]: Finished difference. Result has 94 places, 64 transitions, 466 flow [2023-08-26 18:30:54,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=94, PETRI_TRANSITIONS=64} [2023-08-26 18:30:54,199 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, 16 predicate places. [2023-08-26 18:30:54,199 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 64 transitions, 466 flow [2023-08-26 18:30:54,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:30:54,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:30:54,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:54,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 18:30:54,199 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-08-26 18:30:54,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:30:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash -187679548, now seen corresponding path program 1 times [2023-08-26 18:30:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:30:54,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257542403] [2023-08-26 18:30:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:30:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:30:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:30:54,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:30:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:30:54,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:30:54,318 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:30:54,319 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONASSERT (54 of 55 remaining) [2023-08-26 18:30:54,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2023-08-26 18:30:54,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2023-08-26 18:30:54,321 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2023-08-26 18:30:54,322 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2023-08-26 18:30:54,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2023-08-26 18:30:54,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2023-08-26 18:30:54,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 18:30:54,325 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:30:54,328 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:30:54,328 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:30:54,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:30:54 BasicIcfg [2023-08-26 18:30:54,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:30:54,378 INFO L158 Benchmark]: Toolchain (without parser) took 47065.98ms. Allocated memory was 329.3MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 304.5MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-08-26 18:30:54,378 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 329.3MB. Free memory is still 306.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:30:54,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.05ms. Allocated memory is still 329.3MB. Free memory was 303.9MB in the beginning and 280.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:30:54,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 329.3MB. Free memory was 280.9MB in the beginning and 278.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:30:54,379 INFO L158 Benchmark]: Boogie Preprocessor took 41.41ms. Allocated memory is still 329.3MB. Free memory was 278.3MB in the beginning and 276.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:30:54,379 INFO L158 Benchmark]: RCFGBuilder took 840.28ms. Allocated memory is still 329.3MB. Free memory was 276.2MB in the beginning and 272.4MB in the end (delta: 3.8MB). Peak memory consumption was 57.7MB. Max. memory is 16.0GB. [2023-08-26 18:30:54,379 INFO L158 Benchmark]: TraceAbstraction took 45743.79ms. Allocated memory was 329.3MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 271.4MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-26 18:30:54,380 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.15ms. Allocated memory is still 329.3MB. Free memory is still 306.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 400.05ms. Allocated memory is still 329.3MB. Free memory was 303.9MB in the beginning and 280.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 329.3MB. Free memory was 280.9MB in the beginning and 278.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.41ms. Allocated memory is still 329.3MB. Free memory was 278.3MB in the beginning and 276.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 840.28ms. Allocated memory is still 329.3MB. Free memory was 276.2MB in the beginning and 272.4MB in the end (delta: 3.8MB). Peak memory consumption was 57.7MB. Max. memory is 16.0GB. * TraceAbstraction took 45743.79ms. Allocated memory was 329.3MB in the beginning and 4.6GB in the end (delta: 4.2GB). Free memory was 271.4MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 2.6GB. 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: 6.2s, 189 PlacesBefore, 78 PlacesAfterwards, 179 TransitionsBefore, 66 TransitionsAfterwards, 6106 CoEnabledTransitionPairs, 8 FixpointIterations, 70 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 157 TotalNumberOfCompositions, 25199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9569, independent: 9031, independent conditional: 0, independent unconditional: 9031, dependent: 538, dependent conditional: 0, dependent unconditional: 538, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2864, independent: 2777, independent conditional: 0, independent unconditional: 2777, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9569, independent: 6254, independent conditional: 0, independent unconditional: 6254, dependent: 451, dependent conditional: 0, dependent unconditional: 451, unknown: 2864, unknown conditional: 0, unknown unconditional: 2864] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 413, Positive conditional cache size: 0, Positive unconditional cache size: 413, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=-3, t2721={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] EXPR 1 \read(a) [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L863] FCALL, FORK 0 pthread_create(&t2722, ((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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=-2, t2721={7:0}, t2722={8:0}, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L790] 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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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=0, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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(&t2723, ((void *)0), P2, ((void *)0))=-1, t2721={7:0}, t2722={8:0}, t2723={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=0, t2721={7:0}, t2722={8:0}, t2723={5:0}, t2724={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L805] 2 y = 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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y 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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L820] 3 z = 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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z 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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L835] 4 a = 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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721={7:0}, t2722={8:0}, t2723={5:0}, t2724={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] 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", "thin002_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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_buff0_thd4=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$r_buff1_thd4=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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] - 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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 232 locations, 55 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: 45.6s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1353 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1353 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2644 IncrementalHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 17 mSDtfsCounter, 2644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=14, InterpolantAutomatonStates: 140, 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, 6.3s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 5131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:30:54,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...