/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/mix053_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:18:07,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:18:07,416 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:18:07,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:18:07,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:18:07,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:18:07,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:18:07,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:18:07,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:18:07,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:18:07,447 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:18:07,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:18:07,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:18:07,449 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:18:07,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:18:07,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:18:07,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:18:07,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:18:07,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:18:07,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:18:07,450 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:18:07,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:18:07,450 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:18:07,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:18:07,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:18:07,451 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:18:07,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:18:07,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:18:07,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:18:07,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:18:07,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:18:07,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:18:07,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:18:07,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:18:07,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:18:07,465 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:18:07,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:18:07,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:18:07,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:18:07,889 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:18:07,889 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:18:07,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-08-26 18:18:08,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:18:09,163 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:18:09,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-08-26 18:18:09,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba15d548/47dd711a478848de9317141957c39da0/FLAG2e8727438 [2023-08-26 18:18:09,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba15d548/47dd711a478848de9317141957c39da0 [2023-08-26 18:18:09,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:18:09,228 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:18:09,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:18:09,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:18:09,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:18:09,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f82018a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09, skipping insertion in model container [2023-08-26 18:18:09,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,316 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:18:09,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:18:09,605 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:18:09,628 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:18:09,629 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:18:09,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:18:09,688 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:18:09,688 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:18:09,693 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:18:09,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09 WrapperNode [2023-08-26 18:18:09,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:18:09,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:18:09,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:18:09,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:18:09,699 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:18:09" (1/1) ... [2023-08-26 18:18:09,726 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:18:09" (1/1) ... [2023-08-26 18:18:09,754 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-08-26 18:18:09,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:18:09,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:18:09,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:18:09,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:18:09,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:18:09,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:18:09,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:18:09,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:18:09,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (1/1) ... [2023-08-26 18:18:09,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:18:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:18:09,816 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:18:09,835 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:18:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:18:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:18:09,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:18:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:18:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:18:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:18:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:18:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:18:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:18:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:18:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:18:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:18:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:18:09,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:18:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:18:09,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:18:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:18:09,855 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:18:09,982 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:18:09,983 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:18:10,168 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:18:10,259 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:18:10,259 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:18:10,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:18:10 BoogieIcfgContainer [2023-08-26 18:18:10,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:18:10,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:18:10,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:18:10,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:18:10,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:18:09" (1/3) ... [2023-08-26 18:18:10,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cde7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:18:10, skipping insertion in model container [2023-08-26 18:18:10,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:09" (2/3) ... [2023-08-26 18:18:10,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cde7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:18:10, skipping insertion in model container [2023-08-26 18:18:10,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:18:10" (3/3) ... [2023-08-26 18:18:10,265 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2023-08-26 18:18:10,276 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:18:10,276 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:18:10,276 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:18:10,318 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:18:10,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 298 flow [2023-08-26 18:18:10,403 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2023-08-26 18:18:10,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:10,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 3/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 18:18:10,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 139 transitions, 298 flow [2023-08-26 18:18:10,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 135 transitions, 282 flow [2023-08-26 18:18:10,416 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:18:10,425 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 135 transitions, 282 flow [2023-08-26 18:18:10,428 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 135 transitions, 282 flow [2023-08-26 18:18:10,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 135 transitions, 282 flow [2023-08-26 18:18:10,473 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2023-08-26 18:18:10,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:10,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 3/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 18:18:10,476 INFO L119 LiptonReduction]: Number of co-enabled transitions 3266 [2023-08-26 18:18:14,758 INFO L134 LiptonReduction]: Checked pairs total: 9345 [2023-08-26 18:18:14,758 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-26 18:18:14,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:18:14,772 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;@85684e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:18:14,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:18:14,774 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:18:14,774 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:18:14,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:14,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:14,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:18:14,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:14,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2023-08-26 18:18:14,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:14,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525128803] [2023-08-26 18:18:14,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:14,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:14,858 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:18:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525128803] [2023-08-26 18:18:14,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525128803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:18:14,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938673803] [2023-08-26 18:18:14,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:14,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:18:14,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:14,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:18:14,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:18:14,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 281 [2023-08-26 18:18:14,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:18:14,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:14,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 281 [2023-08-26 18:18:14,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:15,417 INFO L124 PetriNetUnfolderBase]: 3625/5086 cut-off events. [2023-08-26 18:18:15,417 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-26 18:18:15,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10220 conditions, 5086 events. 3625/5086 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 25535 event pairs, 3625 based on Foata normal form. 0/4494 useless extension candidates. Maximal degree in co-relation 10208. Up to 4977 conditions per place. [2023-08-26 18:18:15,442 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 24 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-26 18:18:15,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 116 flow [2023-08-26 18:18:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:18:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:18:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 280 transitions. [2023-08-26 18:18:15,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498220640569395 [2023-08-26 18:18:15,453 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 280 transitions. [2023-08-26 18:18:15,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 280 transitions. [2023-08-26 18:18:15,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:15,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 280 transitions. [2023-08-26 18:18:15,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have 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:18:15,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have 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:18:15,461 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have 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:18:15,462 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 84 flow. Second operand 2 states and 280 transitions. [2023-08-26 18:18:15,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 116 flow [2023-08-26 18:18:15,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:18:15,467 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-26 18:18:15,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-26 18:18:15,471 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-08-26 18:18:15,471 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-26 18:18:15,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:18:15,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:15,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:15,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:18:15,472 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:15,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 265660912, now seen corresponding path program 1 times [2023-08-26 18:18:15,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:15,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246958417] [2023-08-26 18:18:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:15,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:15,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:18:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246958417] [2023-08-26 18:18:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246958417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:15,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:15,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:18:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151042793] [2023-08-26 18:18:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:18:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:15,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:18:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:18:15,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 281 [2023-08-26 18:18:15,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have 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:18:15,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:15,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 281 [2023-08-26 18:18:15,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:16,114 INFO L124 PetriNetUnfolderBase]: 2855/4235 cut-off events. [2023-08-26 18:18:16,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:16,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8308 conditions, 4235 events. 2855/4235 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 23602 event pairs, 545 based on Foata normal form. 0/4027 useless extension candidates. Maximal degree in co-relation 8305. Up to 3103 conditions per place. [2023-08-26 18:18:16,134 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-26 18:18:16,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 166 flow [2023-08-26 18:18:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:18:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:18:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 18:18:16,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48279952550415184 [2023-08-26 18:18:16,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 18:18:16,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 18:18:16,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:16,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 18:18:16,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have 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:18:16,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:18:16,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:18:16,146 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 407 transitions. [2023-08-26 18:18:16,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 166 flow [2023-08-26 18:18:16,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:18:16,149 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-26 18:18:16,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-26 18:18:16,149 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-26 18:18:16,150 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-26 18:18:16,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have 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:18:16,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:16,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:16,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:18:16,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:16,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2091603587, now seen corresponding path program 1 times [2023-08-26 18:18:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:16,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340624993] [2023-08-26 18:18:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:16,864 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:18:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340624993] [2023-08-26 18:18:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340624993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:16,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:16,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:18:16,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394480007] [2023-08-26 18:18:16,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:16,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:16,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:16,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:16,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:16,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 281 [2023-08-26 18:18:16,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have 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:18:16,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:16,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 281 [2023-08-26 18:18:16,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:17,703 INFO L124 PetriNetUnfolderBase]: 8646/11899 cut-off events. [2023-08-26 18:18:17,703 INFO L125 PetriNetUnfolderBase]: For 626/626 co-relation queries the response was YES. [2023-08-26 18:18:17,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24793 conditions, 11899 events. 8646/11899 cut-off events. For 626/626 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 61574 event pairs, 606 based on Foata normal form. 300/12199 useless extension candidates. Maximal degree in co-relation 24789. Up to 8939 conditions per place. [2023-08-26 18:18:17,755 INFO L140 encePairwiseOnDemand]: 270/281 looper letters, 52 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2023-08-26 18:18:17,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 282 flow [2023-08-26 18:18:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:18:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:18:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-26 18:18:17,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44661921708185054 [2023-08-26 18:18:17,757 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-26 18:18:17,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-26 18:18:17,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:17,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-26 18:18:17,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have 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:18:17,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:17,760 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:17,760 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 4 states and 502 transitions. [2023-08-26 18:18:17,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 282 flow [2023-08-26 18:18:17,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:17,762 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 137 flow [2023-08-26 18:18:17,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-08-26 18:18:17,762 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2023-08-26 18:18:17,762 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 137 flow [2023-08-26 18:18:17,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have 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:18:17,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:17,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:17,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:18:17,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:17,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash 415200150, now seen corresponding path program 1 times [2023-08-26 18:18:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212126780] [2023-08-26 18:18:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:18,040 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:18:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:18,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212126780] [2023-08-26 18:18:18,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212126780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:18,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:18,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620957909] [2023-08-26 18:18:18,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:18,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:18,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:18,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:18,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:18,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 281 [2023-08-26 18:18:18,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have 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:18:18,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:18,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 281 [2023-08-26 18:18:18,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:18,847 INFO L124 PetriNetUnfolderBase]: 8657/11916 cut-off events. [2023-08-26 18:18:18,847 INFO L125 PetriNetUnfolderBase]: For 3790/3790 co-relation queries the response was YES. [2023-08-26 18:18:18,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32627 conditions, 11916 events. 8657/11916 cut-off events. For 3790/3790 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 58644 event pairs, 2075 based on Foata normal form. 30/11946 useless extension candidates. Maximal degree in co-relation 32621. Up to 11385 conditions per place. [2023-08-26 18:18:18,900 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 61 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2023-08-26 18:18:18,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 77 transitions, 444 flow [2023-08-26 18:18:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:18:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:18:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-26 18:18:18,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44928825622775803 [2023-08-26 18:18:18,903 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-26 18:18:18,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-26 18:18:18,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:18,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-26 18:18:18,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have 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:18:18,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:18,906 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:18,906 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 137 flow. Second operand 4 states and 505 transitions. [2023-08-26 18:18:18,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 77 transitions, 444 flow [2023-08-26 18:18:18,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:18:18,908 INFO L231 Difference]: Finished difference. Result has 46 places, 51 transitions, 277 flow [2023-08-26 18:18:18,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=46, PETRI_TRANSITIONS=51} [2023-08-26 18:18:18,910 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2023-08-26 18:18:18,910 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 51 transitions, 277 flow [2023-08-26 18:18:18,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have 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:18:18,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:18,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:18,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:18:18,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:18,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1876265151, now seen corresponding path program 1 times [2023-08-26 18:18:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:18,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230295624] [2023-08-26 18:18:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:19,262 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:18:19,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:19,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230295624] [2023-08-26 18:18:19,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230295624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:19,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:19,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968205172] [2023-08-26 18:18:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:19,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:19,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 18:18:19,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 51 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:18:19,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:19,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 18:18:19,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:20,112 INFO L124 PetriNetUnfolderBase]: 7144/10215 cut-off events. [2023-08-26 18:18:20,112 INFO L125 PetriNetUnfolderBase]: For 10725/10779 co-relation queries the response was YES. [2023-08-26 18:18:20,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32187 conditions, 10215 events. 7144/10215 cut-off events. For 10725/10779 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 55276 event pairs, 1752 based on Foata normal form. 70/10150 useless extension candidates. Maximal degree in co-relation 32178. Up to 7400 conditions per place. [2023-08-26 18:18:20,206 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 60 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2023-08-26 18:18:20,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 594 flow [2023-08-26 18:18:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:18:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:18:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-08-26 18:18:20,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886120996441283 [2023-08-26 18:18:20,207 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-08-26 18:18:20,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-08-26 18:18:20,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:20,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-08-26 18:18:20,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:20,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:20,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:20,211 INFO L175 Difference]: Start difference. First operand has 46 places, 51 transitions, 277 flow. Second operand 4 states and 527 transitions. [2023-08-26 18:18:20,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 594 flow [2023-08-26 18:18:20,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 594 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:18:20,219 INFO L231 Difference]: Finished difference. Result has 51 places, 58 transitions, 399 flow [2023-08-26 18:18:20,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=51, PETRI_TRANSITIONS=58} [2023-08-26 18:18:20,221 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2023-08-26 18:18:20,221 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 58 transitions, 399 flow [2023-08-26 18:18:20,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have 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:18:20,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:20,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:20,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:18:20,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:20,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1876128193, now seen corresponding path program 1 times [2023-08-26 18:18:20,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:20,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523101020] [2023-08-26 18:18:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:20,969 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:18:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523101020] [2023-08-26 18:18:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523101020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448385690] [2023-08-26 18:18:20,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:20,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:20,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:20,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:20,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 281 [2023-08-26 18:18:20,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have 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:18:20,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:20,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 281 [2023-08-26 18:18:20,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:21,946 INFO L124 PetriNetUnfolderBase]: 9078/12475 cut-off events. [2023-08-26 18:18:21,946 INFO L125 PetriNetUnfolderBase]: For 17257/17257 co-relation queries the response was YES. [2023-08-26 18:18:21,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43678 conditions, 12475 events. 9078/12475 cut-off events. For 17257/17257 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 62164 event pairs, 1383 based on Foata normal form. 30/12505 useless extension candidates. Maximal degree in co-relation 43666. Up to 9257 conditions per place. [2023-08-26 18:18:22,011 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 61 selfloop transitions, 36 changer transitions 0/97 dead transitions. [2023-08-26 18:18:22,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 97 transitions, 756 flow [2023-08-26 18:18:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:18:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:18:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-08-26 18:18:22,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44395017793594305 [2023-08-26 18:18:22,013 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-08-26 18:18:22,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-08-26 18:18:22,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:22,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-08-26 18:18:22,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:22,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:22,016 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:22,016 INFO L175 Difference]: Start difference. First operand has 51 places, 58 transitions, 399 flow. Second operand 4 states and 499 transitions. [2023-08-26 18:18:22,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 97 transitions, 756 flow [2023-08-26 18:18:22,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 97 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:22,026 INFO L231 Difference]: Finished difference. Result has 55 places, 70 transitions, 625 flow [2023-08-26 18:18:22,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=625, PETRI_PLACES=55, PETRI_TRANSITIONS=70} [2023-08-26 18:18:22,027 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-08-26 18:18:22,027 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 70 transitions, 625 flow [2023-08-26 18:18:22,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have 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:18:22,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:22,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:22,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:18:22,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:22,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1876199803, now seen corresponding path program 2 times [2023-08-26 18:18:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:22,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289364870] [2023-08-26 18:18:22,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:22,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:22,381 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:18:22,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:22,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289364870] [2023-08-26 18:18:22,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289364870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:22,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:22,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:22,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092981481] [2023-08-26 18:18:22,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:22,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:22,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:22,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:22,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:22,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 281 [2023-08-26 18:18:22,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 70 transitions, 625 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have 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:18:22,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:22,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 281 [2023-08-26 18:18:22,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:23,255 INFO L124 PetriNetUnfolderBase]: 7943/11215 cut-off events. [2023-08-26 18:18:23,256 INFO L125 PetriNetUnfolderBase]: For 30944/31687 co-relation queries the response was YES. [2023-08-26 18:18:23,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46243 conditions, 11215 events. 7943/11215 cut-off events. For 30944/31687 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 60390 event pairs, 1995 based on Foata normal form. 323/11423 useless extension candidates. Maximal degree in co-relation 46230. Up to 9113 conditions per place. [2023-08-26 18:18:23,314 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 80 selfloop transitions, 14 changer transitions 0/107 dead transitions. [2023-08-26 18:18:23,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 107 transitions, 1056 flow [2023-08-26 18:18:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:18:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:18:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-26 18:18:23,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45907473309608543 [2023-08-26 18:18:23,316 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-26 18:18:23,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-26 18:18:23,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:23,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-26 18:18:23,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:18:23,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:23,318 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:23,318 INFO L175 Difference]: Start difference. First operand has 55 places, 70 transitions, 625 flow. Second operand 4 states and 516 transitions. [2023-08-26 18:18:23,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 107 transitions, 1056 flow [2023-08-26 18:18:23,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 107 transitions, 1045 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:23,332 INFO L231 Difference]: Finished difference. Result has 59 places, 82 transitions, 805 flow [2023-08-26 18:18:23,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=805, PETRI_PLACES=59, PETRI_TRANSITIONS=82} [2023-08-26 18:18:23,332 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-08-26 18:18:23,333 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 82 transitions, 805 flow [2023-08-26 18:18:23,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have 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:18:23,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:23,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:23,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:18:23,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:23,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -13710377, now seen corresponding path program 3 times [2023-08-26 18:18:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:23,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220494779] [2023-08-26 18:18:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:23,654 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:18:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:23,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220494779] [2023-08-26 18:18:23,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220494779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:23,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:23,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092345929] [2023-08-26 18:18:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:23,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:23,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:23,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:23,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 281 [2023-08-26 18:18:23,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 82 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:23,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:23,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 281 [2023-08-26 18:18:23,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:24,606 INFO L124 PetriNetUnfolderBase]: 9546/13103 cut-off events. [2023-08-26 18:18:24,606 INFO L125 PetriNetUnfolderBase]: For 40964/40964 co-relation queries the response was YES. [2023-08-26 18:18:24,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57698 conditions, 13103 events. 9546/13103 cut-off events. For 40964/40964 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 64984 event pairs, 2139 based on Foata normal form. 68/13171 useless extension candidates. Maximal degree in co-relation 57682. Up to 10437 conditions per place. [2023-08-26 18:18:24,673 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 118 selfloop transitions, 49 changer transitions 0/167 dead transitions. [2023-08-26 18:18:24,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 167 transitions, 1763 flow [2023-08-26 18:18:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-08-26 18:18:24,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4460260972716489 [2023-08-26 18:18:24,676 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-08-26 18:18:24,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-08-26 18:18:24,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:24,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-08-26 18:18:24,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have 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:18:24,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:24,679 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:24,679 INFO L175 Difference]: Start difference. First operand has 59 places, 82 transitions, 805 flow. Second operand 6 states and 752 transitions. [2023-08-26 18:18:24,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 167 transitions, 1763 flow [2023-08-26 18:18:24,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 167 transitions, 1735 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:24,707 INFO L231 Difference]: Finished difference. Result has 66 places, 106 transitions, 1224 flow [2023-08-26 18:18:24,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1224, PETRI_PLACES=66, PETRI_TRANSITIONS=106} [2023-08-26 18:18:24,708 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2023-08-26 18:18:24,708 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 106 transitions, 1224 flow [2023-08-26 18:18:24,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:24,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:24,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:24,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:18:24,708 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:24,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash 375249737, now seen corresponding path program 1 times [2023-08-26 18:18:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:24,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122025952] [2023-08-26 18:18:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:25,391 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:18:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:25,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122025952] [2023-08-26 18:18:25,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122025952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:25,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:25,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:25,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730014367] [2023-08-26 18:18:25,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:25,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:25,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:25,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:25,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 281 [2023-08-26 18:18:25,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 106 transitions, 1224 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:18:25,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:25,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 281 [2023-08-26 18:18:25,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:26,735 INFO L124 PetriNetUnfolderBase]: 10537/14492 cut-off events. [2023-08-26 18:18:26,735 INFO L125 PetriNetUnfolderBase]: For 63423/63423 co-relation queries the response was YES. [2023-08-26 18:18:26,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68924 conditions, 14492 events. 10537/14492 cut-off events. For 63423/63423 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 73692 event pairs, 919 based on Foata normal form. 120/14612 useless extension candidates. Maximal degree in co-relation 68905. Up to 8949 conditions per place. [2023-08-26 18:18:26,800 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 122 selfloop transitions, 84 changer transitions 0/206 dead transitions. [2023-08-26 18:18:26,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 206 transitions, 2417 flow [2023-08-26 18:18:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-26 18:18:26,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44187425860023727 [2023-08-26 18:18:26,804 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-26 18:18:26,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-26 18:18:26,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:26,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-26 18:18:26,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have 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:18:26,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:26,817 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:26,817 INFO L175 Difference]: Start difference. First operand has 66 places, 106 transitions, 1224 flow. Second operand 6 states and 745 transitions. [2023-08-26 18:18:26,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 206 transitions, 2417 flow [2023-08-26 18:18:26,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 206 transitions, 2335 flow, removed 33 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:26,973 INFO L231 Difference]: Finished difference. Result has 75 places, 151 transitions, 2059 flow [2023-08-26 18:18:26,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2059, PETRI_PLACES=75, PETRI_TRANSITIONS=151} [2023-08-26 18:18:26,974 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2023-08-26 18:18:26,974 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 151 transitions, 2059 flow [2023-08-26 18:18:26,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:18:26,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:26,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:26,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:18:26,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:26,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:26,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2078088214, now seen corresponding path program 1 times [2023-08-26 18:18:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619781965] [2023-08-26 18:18:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:27,573 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:18:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619781965] [2023-08-26 18:18:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619781965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281643498] [2023-08-26 18:18:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:27,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:27,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 281 [2023-08-26 18:18:27,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 151 transitions, 2059 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have 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:18:27,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:27,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 281 [2023-08-26 18:18:27,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:29,333 INFO L124 PetriNetUnfolderBase]: 11623/16034 cut-off events. [2023-08-26 18:18:29,333 INFO L125 PetriNetUnfolderBase]: For 106272/106272 co-relation queries the response was YES. [2023-08-26 18:18:29,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87721 conditions, 16034 events. 11623/16034 cut-off events. For 106272/106272 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 82952 event pairs, 1453 based on Foata normal form. 112/16146 useless extension candidates. Maximal degree in co-relation 87697. Up to 10808 conditions per place. [2023-08-26 18:18:29,486 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 159 selfloop transitions, 74 changer transitions 0/233 dead transitions. [2023-08-26 18:18:29,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 233 transitions, 3146 flow [2023-08-26 18:18:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2023-08-26 18:18:29,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4428063040162684 [2023-08-26 18:18:29,489 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2023-08-26 18:18:29,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2023-08-26 18:18:29,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:29,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2023-08-26 18:18:29,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have 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:18:29,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have 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:18:29,494 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have 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:18:29,494 INFO L175 Difference]: Start difference. First operand has 75 places, 151 transitions, 2059 flow. Second operand 7 states and 871 transitions. [2023-08-26 18:18:29,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 233 transitions, 3146 flow [2023-08-26 18:18:29,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 233 transitions, 3062 flow, removed 42 selfloop flow, removed 0 redundant places. [2023-08-26 18:18:29,683 INFO L231 Difference]: Finished difference. Result has 83 places, 164 transitions, 2393 flow [2023-08-26 18:18:29,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2393, PETRI_PLACES=83, PETRI_TRANSITIONS=164} [2023-08-26 18:18:29,684 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2023-08-26 18:18:29,684 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 164 transitions, 2393 flow [2023-08-26 18:18:29,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have 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:18:29,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:29,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:29,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:18:29,684 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:29,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2080019824, now seen corresponding path program 2 times [2023-08-26 18:18:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:29,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694231308] [2023-08-26 18:18:29,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:29,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:30,113 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:18:30,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694231308] [2023-08-26 18:18:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694231308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379476406] [2023-08-26 18:18:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:30,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:30,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:30,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 281 [2023-08-26 18:18:30,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 164 transitions, 2393 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:30,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:30,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 281 [2023-08-26 18:18:30,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:31,794 INFO L124 PetriNetUnfolderBase]: 10442/15037 cut-off events. [2023-08-26 18:18:31,795 INFO L125 PetriNetUnfolderBase]: For 133579/134691 co-relation queries the response was YES. [2023-08-26 18:18:31,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88406 conditions, 15037 events. 10442/15037 cut-off events. For 133579/134691 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 88770 event pairs, 1779 based on Foata normal form. 409/15063 useless extension candidates. Maximal degree in co-relation 88379. Up to 9748 conditions per place. [2023-08-26 18:18:31,896 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 137 selfloop transitions, 48 changer transitions 0/221 dead transitions. [2023-08-26 18:18:31,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 221 transitions, 3340 flow [2023-08-26 18:18:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-26 18:18:31,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46120996441281137 [2023-08-26 18:18:31,914 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-26 18:18:31,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-26 18:18:31,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:31,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-26 18:18:31,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:18:31,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have 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:18:31,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have 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:18:31,930 INFO L175 Difference]: Start difference. First operand has 83 places, 164 transitions, 2393 flow. Second operand 5 states and 648 transitions. [2023-08-26 18:18:31,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 221 transitions, 3340 flow [2023-08-26 18:18:32,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 221 transitions, 3173 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-08-26 18:18:32,348 INFO L231 Difference]: Finished difference. Result has 85 places, 183 transitions, 2721 flow [2023-08-26 18:18:32,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2721, PETRI_PLACES=85, PETRI_TRANSITIONS=183} [2023-08-26 18:18:32,349 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2023-08-26 18:18:32,349 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 183 transitions, 2721 flow [2023-08-26 18:18:32,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:32,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:32,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:32,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:18:32,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:32,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 795388804, now seen corresponding path program 3 times [2023-08-26 18:18:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421934015] [2023-08-26 18:18:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:33,047 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:18:33,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:33,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421934015] [2023-08-26 18:18:33,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421934015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:33,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:33,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:33,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647171705] [2023-08-26 18:18:33,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:33,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:33,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:33,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:33,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:33,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 281 [2023-08-26 18:18:33,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 183 transitions, 2721 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have 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:18:33,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:33,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 281 [2023-08-26 18:18:33,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:35,126 INFO L124 PetriNetUnfolderBase]: 14255/19804 cut-off events. [2023-08-26 18:18:35,126 INFO L125 PetriNetUnfolderBase]: For 161486/161486 co-relation queries the response was YES. [2023-08-26 18:18:35,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113798 conditions, 19804 events. 14255/19804 cut-off events. For 161486/161486 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 109192 event pairs, 1119 based on Foata normal form. 144/19948 useless extension candidates. Maximal degree in co-relation 113769. Up to 9979 conditions per place. [2023-08-26 18:18:35,302 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 156 selfloop transitions, 134 changer transitions 0/290 dead transitions. [2023-08-26 18:18:35,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 290 transitions, 4338 flow [2023-08-26 18:18:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 859 transitions. [2023-08-26 18:18:35,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4367056431113371 [2023-08-26 18:18:35,304 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 859 transitions. [2023-08-26 18:18:35,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 859 transitions. [2023-08-26 18:18:35,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:35,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 859 transitions. [2023-08-26 18:18:35,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have 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:18:35,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have 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:18:35,309 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have 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:18:35,309 INFO L175 Difference]: Start difference. First operand has 85 places, 183 transitions, 2721 flow. Second operand 7 states and 859 transitions. [2023-08-26 18:18:35,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 290 transitions, 4338 flow [2023-08-26 18:18:35,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 290 transitions, 4256 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:35,802 INFO L231 Difference]: Finished difference. Result has 95 places, 226 transitions, 3877 flow [2023-08-26 18:18:35,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3877, PETRI_PLACES=95, PETRI_TRANSITIONS=226} [2023-08-26 18:18:35,803 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 46 predicate places. [2023-08-26 18:18:35,803 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 226 transitions, 3877 flow [2023-08-26 18:18:35,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have 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:18:35,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:35,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:35,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:18:35,804 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:35,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2140793464, now seen corresponding path program 4 times [2023-08-26 18:18:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:35,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645608651] [2023-08-26 18:18:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:35,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:36,198 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:18:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645608651] [2023-08-26 18:18:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645608651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761833487] [2023-08-26 18:18:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:36,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:36,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:36,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:36,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 281 [2023-08-26 18:18:36,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 226 transitions, 3877 flow. Second operand has 7 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have 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:18:36,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:36,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 281 [2023-08-26 18:18:36,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:38,509 INFO L124 PetriNetUnfolderBase]: 12892/18905 cut-off events. [2023-08-26 18:18:38,509 INFO L125 PetriNetUnfolderBase]: For 251974/253734 co-relation queries the response was YES. [2023-08-26 18:18:38,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121333 conditions, 18905 events. 12892/18905 cut-off events. For 251974/253734 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 120592 event pairs, 1461 based on Foata normal form. 948/19343 useless extension candidates. Maximal degree in co-relation 121300. Up to 9185 conditions per place. [2023-08-26 18:18:38,723 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 145 selfloop transitions, 84 changer transitions 0/274 dead transitions. [2023-08-26 18:18:38,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 274 transitions, 4809 flow [2023-08-26 18:18:38,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-26 18:18:38,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45373665480427045 [2023-08-26 18:18:38,725 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-26 18:18:38,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-26 18:18:38,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:38,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-26 18:18:38,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have 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:18:38,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:38,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:38,729 INFO L175 Difference]: Start difference. First operand has 95 places, 226 transitions, 3877 flow. Second operand 6 states and 765 transitions. [2023-08-26 18:18:38,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 274 transitions, 4809 flow [2023-08-26 18:18:39,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 274 transitions, 4742 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-08-26 18:18:39,615 INFO L231 Difference]: Finished difference. Result has 100 places, 233 transitions, 4204 flow [2023-08-26 18:18:39,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=3816, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4204, PETRI_PLACES=100, PETRI_TRANSITIONS=233} [2023-08-26 18:18:39,616 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2023-08-26 18:18:39,616 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 233 transitions, 4204 flow [2023-08-26 18:18:39,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have 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:18:39,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:39,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:39,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:18:39,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:39,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 854054630, now seen corresponding path program 1 times [2023-08-26 18:18:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:39,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009230983] [2023-08-26 18:18:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009230983] [2023-08-26 18:18:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009230983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106347038] [2023-08-26 18:18:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:39,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:39,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 281 [2023-08-26 18:18:39,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 233 transitions, 4204 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:39,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:39,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 281 [2023-08-26 18:18:39,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:42,411 INFO L124 PetriNetUnfolderBase]: 10362/15360 cut-off events. [2023-08-26 18:18:42,412 INFO L125 PetriNetUnfolderBase]: For 325058/333849 co-relation queries the response was YES. [2023-08-26 18:18:42,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102460 conditions, 15360 events. 10362/15360 cut-off events. For 325058/333849 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 101805 event pairs, 1410 based on Foata normal form. 3069/17941 useless extension candidates. Maximal degree in co-relation 102425. Up to 9624 conditions per place. [2023-08-26 18:18:42,541 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 417 selfloop transitions, 10 changer transitions 29/508 dead transitions. [2023-08-26 18:18:42,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 508 transitions, 10192 flow [2023-08-26 18:18:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-26 18:18:42,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583629893238434 [2023-08-26 18:18:42,543 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-26 18:18:42,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-26 18:18:42,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:42,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-26 18:18:42,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have 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:18:42,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have 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:18:42,546 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have 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:18:42,546 INFO L175 Difference]: Start difference. First operand has 100 places, 233 transitions, 4204 flow. Second operand 5 states and 644 transitions. [2023-08-26 18:18:42,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 508 transitions, 10192 flow [2023-08-26 18:18:42,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 508 transitions, 9989 flow, removed 35 selfloop flow, removed 3 redundant places. [2023-08-26 18:18:42,904 INFO L231 Difference]: Finished difference. Result has 104 places, 227 transitions, 3932 flow [2023-08-26 18:18:42,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=3793, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3932, PETRI_PLACES=104, PETRI_TRANSITIONS=227} [2023-08-26 18:18:42,904 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 55 predicate places. [2023-08-26 18:18:42,904 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 227 transitions, 3932 flow [2023-08-26 18:18:42,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:42,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:42,905 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:18:42,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:18:42,905 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:42,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1726652695, now seen corresponding path program 1 times [2023-08-26 18:18:42,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:42,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345872810] [2023-08-26 18:18:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:42,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:43,007 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:18:43,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:43,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345872810] [2023-08-26 18:18:43,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345872810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:43,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216291777] [2023-08-26 18:18:43,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:43,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:43,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:43,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:43,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 281 [2023-08-26 18:18:43,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 227 transitions, 3932 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have 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:18:43,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:43,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 281 [2023-08-26 18:18:43,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:44,653 INFO L124 PetriNetUnfolderBase]: 8194/12382 cut-off events. [2023-08-26 18:18:44,653 INFO L125 PetriNetUnfolderBase]: For 271969/279498 co-relation queries the response was YES. [2023-08-26 18:18:44,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86617 conditions, 12382 events. 8194/12382 cut-off events. For 271969/279498 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 82283 event pairs, 458 based on Foata normal form. 2635/14663 useless extension candidates. Maximal degree in co-relation 86581. Up to 5590 conditions per place. [2023-08-26 18:18:44,805 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 463 selfloop transitions, 19 changer transitions 56/584 dead transitions. [2023-08-26 18:18:44,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 584 transitions, 11549 flow [2023-08-26 18:18:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-08-26 18:18:44,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45907473309608543 [2023-08-26 18:18:44,808 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-08-26 18:18:44,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-08-26 18:18:44,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:44,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-08-26 18:18:44,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have 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:18:44,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have 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:18:44,811 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have 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:18:44,812 INFO L175 Difference]: Start difference. First operand has 104 places, 227 transitions, 3932 flow. Second operand 7 states and 903 transitions. [2023-08-26 18:18:44,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 584 transitions, 11549 flow [2023-08-26 18:18:44,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 584 transitions, 11429 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-26 18:18:44,993 INFO L231 Difference]: Finished difference. Result has 109 places, 199 transitions, 3336 flow [2023-08-26 18:18:44,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=3166, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3336, PETRI_PLACES=109, PETRI_TRANSITIONS=199} [2023-08-26 18:18:44,993 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places. [2023-08-26 18:18:44,993 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 199 transitions, 3336 flow [2023-08-26 18:18:44,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have 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:18:44,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:44,994 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:18:44,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:18:44,994 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:44,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash -388442478, now seen corresponding path program 1 times [2023-08-26 18:18:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:44,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939849978] [2023-08-26 18:18:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:44,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:45,070 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:18:45,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:45,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939849978] [2023-08-26 18:18:45,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939849978] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:45,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:45,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:18:45,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303390037] [2023-08-26 18:18:45,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:45,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:18:45,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:45,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:18:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:18:45,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 281 [2023-08-26 18:18:45,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 199 transitions, 3336 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:18:45,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:45,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 281 [2023-08-26 18:18:45,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:47,179 INFO L124 PetriNetUnfolderBase]: 10944/17097 cut-off events. [2023-08-26 18:18:47,180 INFO L125 PetriNetUnfolderBase]: For 283549/286776 co-relation queries the response was YES. [2023-08-26 18:18:47,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126233 conditions, 17097 events. 10944/17097 cut-off events. For 283549/286776 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 121235 event pairs, 2700 based on Foata normal form. 433/17103 useless extension candidates. Maximal degree in co-relation 126195. Up to 8467 conditions per place. [2023-08-26 18:18:47,276 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 142 selfloop transitions, 17 changer transitions 103/286 dead transitions. [2023-08-26 18:18:47,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 286 transitions, 5078 flow [2023-08-26 18:18:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:18:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:18:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-08-26 18:18:47,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4804270462633452 [2023-08-26 18:18:47,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-08-26 18:18:47,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-08-26 18:18:47,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:47,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-08-26 18:18:47,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:18:47,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:18:47,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:18:47,280 INFO L175 Difference]: Start difference. First operand has 109 places, 199 transitions, 3336 flow. Second operand 3 states and 405 transitions. [2023-08-26 18:18:47,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 286 transitions, 5078 flow [2023-08-26 18:18:48,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 286 transitions, 4980 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-26 18:18:48,442 INFO L231 Difference]: Finished difference. Result has 109 places, 149 transitions, 2308 flow [2023-08-26 18:18:48,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=3286, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2308, PETRI_PLACES=109, PETRI_TRANSITIONS=149} [2023-08-26 18:18:48,443 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places. [2023-08-26 18:18:48,443 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 149 transitions, 2308 flow [2023-08-26 18:18:48,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have 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:18:48,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:48,443 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:18:48,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:18:48,443 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:48,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -435726611, now seen corresponding path program 1 times [2023-08-26 18:18:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:48,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437357396] [2023-08-26 18:18:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:48,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:48,556 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:18:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:48,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437357396] [2023-08-26 18:18:48,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437357396] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:48,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:48,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:48,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988976000] [2023-08-26 18:18:48,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:48,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:48,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:48,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:48,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 281 [2023-08-26 18:18:48,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 149 transitions, 2308 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have 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:18:48,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:48,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 281 [2023-08-26 18:18:48,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:50,038 INFO L124 PetriNetUnfolderBase]: 6806/10641 cut-off events. [2023-08-26 18:18:50,038 INFO L125 PetriNetUnfolderBase]: For 196018/200371 co-relation queries the response was YES. [2023-08-26 18:18:50,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70149 conditions, 10641 events. 6806/10641 cut-off events. For 196018/200371 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 73769 event pairs, 326 based on Foata normal form. 1459/11827 useless extension candidates. Maximal degree in co-relation 70110. Up to 4389 conditions per place. [2023-08-26 18:18:50,089 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 326 selfloop transitions, 26 changer transitions 64/445 dead transitions. [2023-08-26 18:18:50,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 445 transitions, 8052 flow [2023-08-26 18:18:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:18:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:18:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1158 transitions. [2023-08-26 18:18:50,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4578884934756821 [2023-08-26 18:18:50,092 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1158 transitions. [2023-08-26 18:18:50,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1158 transitions. [2023-08-26 18:18:50,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:50,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1158 transitions. [2023-08-26 18:18:50,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.66666666666666) internal successors, (1158), 9 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have 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:18:50,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have 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:18:50,097 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have 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:18:50,097 INFO L175 Difference]: Start difference. First operand has 109 places, 149 transitions, 2308 flow. Second operand 9 states and 1158 transitions. [2023-08-26 18:18:50,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 445 transitions, 8052 flow [2023-08-26 18:18:50,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 445 transitions, 7613 flow, removed 40 selfloop flow, removed 6 redundant places. [2023-08-26 18:18:50,456 INFO L231 Difference]: Finished difference. Result has 114 places, 142 transitions, 2084 flow [2023-08-26 18:18:50,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2084, PETRI_PLACES=114, PETRI_TRANSITIONS=142} [2023-08-26 18:18:50,457 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 65 predicate places. [2023-08-26 18:18:50,457 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 142 transitions, 2084 flow [2023-08-26 18:18:50,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have 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:18:50,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:50,457 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:18:50,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:18:50,457 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:50,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1711920249, now seen corresponding path program 1 times [2023-08-26 18:18:50,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:50,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061592365] [2023-08-26 18:18:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:50,569 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:18:50,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:50,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061592365] [2023-08-26 18:18:50,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061592365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:50,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:50,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:18:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831861683] [2023-08-26 18:18:50,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:50,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:18:50,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:50,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:18:50,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:18:50,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 281 [2023-08-26 18:18:50,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 142 transitions, 2084 flow. Second operand has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have 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:18:50,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:50,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 281 [2023-08-26 18:18:50,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:51,830 INFO L124 PetriNetUnfolderBase]: 6636/10372 cut-off events. [2023-08-26 18:18:51,830 INFO L125 PetriNetUnfolderBase]: For 160668/164264 co-relation queries the response was YES. [2023-08-26 18:18:51,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71684 conditions, 10372 events. 6636/10372 cut-off events. For 160668/164264 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 72242 event pairs, 309 based on Foata normal form. 961/11073 useless extension candidates. Maximal degree in co-relation 71644. Up to 4105 conditions per place. [2023-08-26 18:18:51,892 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 283 selfloop transitions, 31 changer transitions 97/439 dead transitions. [2023-08-26 18:18:51,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 439 transitions, 7582 flow [2023-08-26 18:18:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:18:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:18:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1391 transitions. [2023-08-26 18:18:51,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4500161759948237 [2023-08-26 18:18:51,895 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1391 transitions. [2023-08-26 18:18:51,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1391 transitions. [2023-08-26 18:18:51,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:51,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1391 transitions. [2023-08-26 18:18:51,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.45454545454545) internal successors, (1391), 11 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have 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:18:51,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 281.0) internal successors, (3372), 12 states have internal predecessors, (3372), 0 states have call successors, (0), 0 states have 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:18:51,900 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 281.0) internal successors, (3372), 12 states have internal predecessors, (3372), 0 states have call successors, (0), 0 states have 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:18:51,900 INFO L175 Difference]: Start difference. First operand has 114 places, 142 transitions, 2084 flow. Second operand 11 states and 1391 transitions. [2023-08-26 18:18:51,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 439 transitions, 7582 flow [2023-08-26 18:18:52,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 439 transitions, 7261 flow, removed 96 selfloop flow, removed 6 redundant places. [2023-08-26 18:18:52,988 INFO L231 Difference]: Finished difference. Result has 121 places, 127 transitions, 1716 flow [2023-08-26 18:18:52,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1784, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1716, PETRI_PLACES=121, PETRI_TRANSITIONS=127} [2023-08-26 18:18:52,988 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 72 predicate places. [2023-08-26 18:18:52,988 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 127 transitions, 1716 flow [2023-08-26 18:18:52,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have 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:18:52,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:52,989 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] [2023-08-26 18:18:52,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:18:52,989 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:52,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1296143718, now seen corresponding path program 1 times [2023-08-26 18:18:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843144504] [2023-08-26 18:18:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:53,107 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:18:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:53,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843144504] [2023-08-26 18:18:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843144504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:53,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:53,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546461183] [2023-08-26 18:18:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:53,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:53,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 281 [2023-08-26 18:18:53,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 127 transitions, 1716 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have 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:18:53,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:53,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 281 [2023-08-26 18:18:53,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:53,966 INFO L124 PetriNetUnfolderBase]: 4098/6588 cut-off events. [2023-08-26 18:18:53,966 INFO L125 PetriNetUnfolderBase]: For 75646/75774 co-relation queries the response was YES. [2023-08-26 18:18:53,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45877 conditions, 6588 events. 4098/6588 cut-off events. For 75646/75774 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 42148 event pairs, 629 based on Foata normal form. 45/6607 useless extension candidates. Maximal degree in co-relation 45834. Up to 2860 conditions per place. [2023-08-26 18:18:53,996 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 91 selfloop transitions, 1 changer transitions 133/232 dead transitions. [2023-08-26 18:18:53,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 232 transitions, 3449 flow [2023-08-26 18:18:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:18:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:18:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-08-26 18:18:53,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46708185053380785 [2023-08-26 18:18:53,998 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-08-26 18:18:53,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-08-26 18:18:53,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:53,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-08-26 18:18:53,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:18:54,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:54,000 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:18:54,000 INFO L175 Difference]: Start difference. First operand has 121 places, 127 transitions, 1716 flow. Second operand 4 states and 525 transitions. [2023-08-26 18:18:54,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 232 transitions, 3449 flow [2023-08-26 18:18:54,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 232 transitions, 3160 flow, removed 55 selfloop flow, removed 12 redundant places. [2023-08-26 18:18:54,180 INFO L231 Difference]: Finished difference. Result has 113 places, 77 transitions, 919 flow [2023-08-26 18:18:54,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=919, PETRI_PLACES=113, PETRI_TRANSITIONS=77} [2023-08-26 18:18:54,180 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 64 predicate places. [2023-08-26 18:18:54,180 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 77 transitions, 919 flow [2023-08-26 18:18:54,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have 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:18:54,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:54,181 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] [2023-08-26 18:18:54,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:18:54,181 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:54,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 87488572, now seen corresponding path program 2 times [2023-08-26 18:18:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169728366] [2023-08-26 18:18:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:54,589 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:18:54,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:54,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169728366] [2023-08-26 18:18:54,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169728366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:54,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:54,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17629125] [2023-08-26 18:18:54,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:54,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:54,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:54,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:54,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 281 [2023-08-26 18:18:54,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 77 transitions, 919 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:18:54,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:54,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 281 [2023-08-26 18:18:54,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:55,138 INFO L124 PetriNetUnfolderBase]: 2261/3693 cut-off events. [2023-08-26 18:18:55,138 INFO L125 PetriNetUnfolderBase]: For 32202/32202 co-relation queries the response was YES. [2023-08-26 18:18:55,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22645 conditions, 3693 events. 2261/3693 cut-off events. For 32202/32202 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20567 event pairs, 277 based on Foata normal form. 1/3694 useless extension candidates. Maximal degree in co-relation 22604. Up to 2219 conditions per place. [2023-08-26 18:18:55,152 INFO L140 encePairwiseOnDemand]: 271/281 looper letters, 54 selfloop transitions, 7 changer transitions 109/170 dead transitions. [2023-08-26 18:18:55,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 170 transitions, 2117 flow [2023-08-26 18:18:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 718 transitions. [2023-08-26 18:18:55,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258600237247924 [2023-08-26 18:18:55,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 718 transitions. [2023-08-26 18:18:55,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 718 transitions. [2023-08-26 18:18:55,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:55,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 718 transitions. [2023-08-26 18:18:55,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have 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:18:55,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:55,157 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:55,157 INFO L175 Difference]: Start difference. First operand has 113 places, 77 transitions, 919 flow. Second operand 6 states and 718 transitions. [2023-08-26 18:18:55,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 170 transitions, 2117 flow [2023-08-26 18:18:55,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 170 transitions, 1947 flow, removed 43 selfloop flow, removed 16 redundant places. [2023-08-26 18:18:55,209 INFO L231 Difference]: Finished difference. Result has 99 places, 49 transitions, 451 flow [2023-08-26 18:18:55,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=99, PETRI_TRANSITIONS=49} [2023-08-26 18:18:55,210 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 50 predicate places. [2023-08-26 18:18:55,210 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 49 transitions, 451 flow [2023-08-26 18:18:55,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have 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:18:55,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:55,210 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] [2023-08-26 18:18:55,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:18:55,210 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:55,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1985490126, now seen corresponding path program 3 times [2023-08-26 18:18:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:55,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744737221] [2023-08-26 18:18:55,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:55,893 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:18:55,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744737221] [2023-08-26 18:18:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744737221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:55,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:18:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026850884] [2023-08-26 18:18:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:55,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:18:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:55,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:18:55,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:18:55,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 281 [2023-08-26 18:18:55,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 49 transitions, 451 flow. Second operand has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have 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:18:55,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:55,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 281 [2023-08-26 18:18:55,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:56,126 INFO L124 PetriNetUnfolderBase]: 611/1027 cut-off events. [2023-08-26 18:18:56,126 INFO L125 PetriNetUnfolderBase]: For 6152/6158 co-relation queries the response was YES. [2023-08-26 18:18:56,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5323 conditions, 1027 events. 611/1027 cut-off events. For 6152/6158 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4523 event pairs, 68 based on Foata normal form. 1/1025 useless extension candidates. Maximal degree in co-relation 5290. Up to 527 conditions per place. [2023-08-26 18:18:56,130 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 51 selfloop transitions, 5 changer transitions 33/92 dead transitions. [2023-08-26 18:18:56,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 914 flow [2023-08-26 18:18:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:18:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:18:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-08-26 18:18:56,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42408066429418745 [2023-08-26 18:18:56,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-08-26 18:18:56,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-08-26 18:18:56,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:56,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-08-26 18:18:56,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have 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:18:56,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:56,134 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have 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:18:56,134 INFO L175 Difference]: Start difference. First operand has 99 places, 49 transitions, 451 flow. Second operand 6 states and 715 transitions. [2023-08-26 18:18:56,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 914 flow [2023-08-26 18:18:56,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 716 flow, removed 50 selfloop flow, removed 27 redundant places. [2023-08-26 18:18:56,146 INFO L231 Difference]: Finished difference. Result has 69 places, 47 transitions, 303 flow [2023-08-26 18:18:56,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2023-08-26 18:18:56,146 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2023-08-26 18:18:56,146 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 303 flow [2023-08-26 18:18:56,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have 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:18:56,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:56,146 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] [2023-08-26 18:18:56,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:18:56,147 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:18:56,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash -157698074, now seen corresponding path program 4 times [2023-08-26 18:18:56,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:56,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018372012] [2023-08-26 18:18:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:18:56,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:18:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:18:56,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:18:56,208 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:18:56,208 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:18:56,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:18:56,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:18:56,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:18:56,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:18:56,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:18:56,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:18:56,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:18:56,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:18:56,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:18:56,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:18:56,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:18:56,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:18:56,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:18:56,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:18:56,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 18:18:56,212 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:56,215 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:18:56,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:18:56,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:18:56 BasicIcfg [2023-08-26 18:18:56,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:18:56,299 INFO L158 Benchmark]: Toolchain (without parser) took 47071.17ms. Allocated memory was 367.0MB in the beginning and 8.3GB in the end (delta: 7.9GB). Free memory was 339.5MB in the beginning and 6.6GB in the end (delta: -6.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-26 18:18:56,299 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 367.0MB. Free memory was 343.0MB in the beginning and 342.9MB in the end (delta: 144.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:18:56,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.28ms. Allocated memory is still 367.0MB. Free memory was 338.9MB in the beginning and 315.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:56,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.98ms. Allocated memory is still 367.0MB. Free memory was 315.3MB in the beginning and 312.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:56,300 INFO L158 Benchmark]: Boogie Preprocessor took 31.15ms. Allocated memory is still 367.0MB. Free memory was 312.8MB in the beginning and 310.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:56,300 INFO L158 Benchmark]: RCFGBuilder took 473.48ms. Allocated memory was 367.0MB in the beginning and 450.9MB in the end (delta: 83.9MB). Free memory was 310.8MB in the beginning and 414.1MB in the end (delta: -103.3MB). Peak memory consumption was 38.2MB. Max. memory is 16.0GB. [2023-08-26 18:18:56,300 INFO L158 Benchmark]: TraceAbstraction took 46037.13ms. Allocated memory was 450.9MB in the beginning and 8.3GB in the end (delta: 7.8GB). Free memory was 413.0MB in the beginning and 6.6GB in the end (delta: -6.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-26 18:18:56,301 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 367.0MB. Free memory was 343.0MB in the beginning and 342.9MB in the end (delta: 144.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 463.28ms. Allocated memory is still 367.0MB. Free memory was 338.9MB in the beginning and 315.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.98ms. Allocated memory is still 367.0MB. Free memory was 315.3MB in the beginning and 312.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.15ms. Allocated memory is still 367.0MB. Free memory was 312.8MB in the beginning and 310.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 473.48ms. Allocated memory was 367.0MB in the beginning and 450.9MB in the end (delta: 83.9MB). Free memory was 310.8MB in the beginning and 414.1MB in the end (delta: -103.3MB). Peak memory consumption was 38.2MB. Max. memory is 16.0GB. * TraceAbstraction took 46037.13ms. Allocated memory was 450.9MB in the beginning and 8.3GB in the end (delta: 7.8GB). Free memory was 413.0MB in the beginning and 6.6GB in the end (delta: -6.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 145 PlacesBefore, 49 PlacesAfterwards, 135 TransitionsBefore, 36 TransitionsAfterwards, 3266 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 142 TotalNumberOfCompositions, 9345 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4108, independent: 3882, independent conditional: 0, independent unconditional: 3882, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1797, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4108, independent: 2134, independent conditional: 0, independent unconditional: 2134, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 1797, unknown conditional: 0, unknown unconditional: 1797] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-3, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=-2, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1436, ((void *)0), P3, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix053_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 846]: 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: 842]: 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: 844]: 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, 173 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 45.9s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 33.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 805 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 805 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2331 IncrementalHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 64 mSDtfsCounter, 2331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4204occurred in iteration=13, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 3250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:18:56,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...