/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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:16:57,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:16:57,589 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:16:57,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:16:57,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:16:57,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:16:57,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:16:57,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:16:57,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:16:57,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:16:57,626 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:16:57,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:16:57,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:16:57,627 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:16:57,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:16:57,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:16:57,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:16:57,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:16:57,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:16:57,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:16:57,629 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:16:57,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:16:57,630 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:16:57,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:16:57,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:16:57,631 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:16:57,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:16:57,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:16:57,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:16:57,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:16:57,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:16:57,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:16:57,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:16:57,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:16:57,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:16:57,633 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:16:57,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:16:57,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:16:57,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:16:57,944 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:16:57,944 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:16:57,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 18:16:59,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:16:59,413 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:16:59,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 18:16:59,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc09e6ef/d8dec26cacd248679d449004706a493c/FLAG7fa0322c3 [2023-08-26 18:16:59,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc09e6ef/d8dec26cacd248679d449004706a493c [2023-08-26 18:16:59,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:16:59,466 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:16:59,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:16:59,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:16:59,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:16:59,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:16:59,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d749d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59, skipping insertion in model container [2023-08-26 18:16:59,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:16:59,526 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:16:59,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:16:59,856 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:16:59,888 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:16:59,889 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:16:59,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:16:59,983 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:16:59,983 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:16:59,989 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:16:59,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59 WrapperNode [2023-08-26 18:16:59,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:16:59,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:16:59,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:16:59,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:16:59,999 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:16:59" (1/1) ... [2023-08-26 18:17:00,030 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:16:59" (1/1) ... [2023-08-26 18:17:00,067 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-08-26 18:17:00,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:17:00,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:17:00,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:17:00,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:17:00,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:17:00,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:17:00,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:17:00,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:17:00,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (1/1) ... [2023-08-26 18:17:00,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:17:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:17:00,150 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:17:00,175 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:17:00,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:17:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:17:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:17:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:17:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:17:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:17:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:17:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:17:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:17:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:17:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:17:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:17:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:17:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:17:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:17:00,191 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:17:00,346 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:17:00,348 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:17:00,698 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:17:00,831 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:17:00,832 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:17:00,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:17:00 BoogieIcfgContainer [2023-08-26 18:17:00,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:17:00,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:17:00,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:17:00,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:17:00,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:16:59" (1/3) ... [2023-08-26 18:17:00,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7538d800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:17:00, skipping insertion in model container [2023-08-26 18:17:00,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:16:59" (2/3) ... [2023-08-26 18:17:00,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7538d800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:17:00, skipping insertion in model container [2023-08-26 18:17:00,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:17:00" (3/3) ... [2023-08-26 18:17:00,842 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 18:17:00,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:17:00,858 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 18:17:00,858 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:17:00,904 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:17:00,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 255 flow [2023-08-26 18:17:00,999 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events. [2023-08-26 18:17:01,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:17:01,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-26 18:17:01,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 120 transitions, 255 flow [2023-08-26 18:17:01,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 117 transitions, 243 flow [2023-08-26 18:17:01,014 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:17:01,025 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 117 transitions, 243 flow [2023-08-26 18:17:01,029 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 117 transitions, 243 flow [2023-08-26 18:17:01,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 243 flow [2023-08-26 18:17:01,066 INFO L124 PetriNetUnfolderBase]: 3/117 cut-off events. [2023-08-26 18:17:01,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:17:01,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-26 18:17:01,069 INFO L119 LiptonReduction]: Number of co-enabled transitions 2204 [2023-08-26 18:17:05,673 INFO L134 LiptonReduction]: Checked pairs total: 5758 [2023-08-26 18:17:05,674 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-26 18:17:05,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:17:05,690 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;@28be9a47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:17:05,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 18:17:05,692 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:17:05,692 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:17:05,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:17:05,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:05,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:17:05,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:05,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:05,698 INFO L85 PathProgramCache]: Analyzing trace with hash 536, now seen corresponding path program 1 times [2023-08-26 18:17:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:05,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819079704] [2023-08-26 18:17:05,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:05,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:17:05,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:05,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819079704] [2023-08-26 18:17:05,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819079704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:05,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:05,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:17:05,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236000524] [2023-08-26 18:17:05,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:17:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:17:05,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:17:05,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-26 18:17:05,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:05,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:05,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-26 18:17:05,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:06,075 INFO L124 PetriNetUnfolderBase]: 644/1000 cut-off events. [2023-08-26 18:17:06,076 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 18:17:06,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2012 conditions, 1000 events. 644/1000 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4564 event pairs, 644 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 2001. Up to 976 conditions per place. [2023-08-26 18:17:06,084 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 19 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-26 18:17:06,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 93 flow [2023-08-26 18:17:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:17:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:17:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2023-08-26 18:17:06,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495850622406639 [2023-08-26 18:17:06,096 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 239 transitions. [2023-08-26 18:17:06,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 239 transitions. [2023-08-26 18:17:06,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:06,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 239 transitions. [2023-08-26 18:17:06,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,107 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,108 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 239 transitions. [2023-08-26 18:17:06,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 93 flow [2023-08-26 18:17:06,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:17:06,112 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-26 18:17:06,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-26 18:17:06,116 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-26 18:17:06,117 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-26 18:17:06,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:06,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:06,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:17:06,118 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:06,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash -677423123, now seen corresponding path program 1 times [2023-08-26 18:17:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368313056] [2023-08-26 18:17:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:06,446 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:17:06,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368313056] [2023-08-26 18:17:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368313056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:06,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:06,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:17:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452833875] [2023-08-26 18:17:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:06,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:17:06,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:06,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:17:06,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:17:06,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-26 18:17:06,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:06,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-26 18:17:06,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:06,616 INFO L124 PetriNetUnfolderBase]: 511/909 cut-off events. [2023-08-26 18:17:06,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:17:06,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 909 events. 511/909 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4689 event pairs, 112 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 1723. Up to 580 conditions per place. [2023-08-26 18:17:06,623 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 23 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-08-26 18:17:06,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 122 flow [2023-08-26 18:17:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:17:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:17:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-26 18:17:06,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785615491009682 [2023-08-26 18:17:06,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-26 18:17:06,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-26 18:17:06,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:06,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-26 18:17:06,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,637 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 346 transitions. [2023-08-26 18:17:06,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 122 flow [2023-08-26 18:17:06,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:17:06,641 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-26 18:17:06,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-26 18:17:06,642 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-26 18:17:06,643 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-26 18:17:06,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:06,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:06,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:06,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:17:06,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:06,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1831459705, now seen corresponding path program 1 times [2023-08-26 18:17:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083719757] [2023-08-26 18:17:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:07,583 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:17:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083719757] [2023-08-26 18:17:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083719757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:07,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:17:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604482870] [2023-08-26 18:17:07,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:07,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:17:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:07,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:17:07,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:17:07,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 241 [2023-08-26 18:17:07,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:07,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:07,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 241 [2023-08-26 18:17:07,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:07,931 INFO L124 PetriNetUnfolderBase]: 1445/2202 cut-off events. [2023-08-26 18:17:07,931 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-08-26 18:17:07,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4587 conditions, 2202 events. 1445/2202 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10520 event pairs, 115 based on Foata normal form. 72/2274 useless extension candidates. Maximal degree in co-relation 4583. Up to 1639 conditions per place. [2023-08-26 18:17:07,946 INFO L140 encePairwiseOnDemand]: 231/241 looper letters, 38 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2023-08-26 18:17:07,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 49 transitions, 216 flow [2023-08-26 18:17:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:17:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:17:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-08-26 18:17:07,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346473029045643 [2023-08-26 18:17:07,948 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-08-26 18:17:07,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-08-26 18:17:07,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:07,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-08-26 18:17:07,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:07,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:07,955 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:07,955 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 4 states and 419 transitions. [2023-08-26 18:17:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 49 transitions, 216 flow [2023-08-26 18:17:07,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:17:07,959 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 118 flow [2023-08-26 18:17:07,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-08-26 18:17:07,959 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2023-08-26 18:17:07,960 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 118 flow [2023-08-26 18:17:07,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:07,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:07,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:07,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:17:07,961 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:07,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash 940674417, now seen corresponding path program 1 times [2023-08-26 18:17:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:07,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555322471] [2023-08-26 18:17:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:08,644 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:17:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555322471] [2023-08-26 18:17:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555322471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:08,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:17:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206368515] [2023-08-26 18:17:08,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:08,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:17:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:08,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:17:08,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:17:08,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 241 [2023-08-26 18:17:08,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:08,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:08,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 241 [2023-08-26 18:17:08,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:08,927 INFO L124 PetriNetUnfolderBase]: 1335/2040 cut-off events. [2023-08-26 18:17:08,927 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2023-08-26 18:17:08,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5611 conditions, 2040 events. 1335/2040 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8993 event pairs, 359 based on Foata normal form. 36/2076 useless extension candidates. Maximal degree in co-relation 5605. Up to 1133 conditions per place. [2023-08-26 18:17:08,941 INFO L140 encePairwiseOnDemand]: 232/241 looper letters, 39 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2023-08-26 18:17:08,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 279 flow [2023-08-26 18:17:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:17:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:17:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 409 transitions. [2023-08-26 18:17:08,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4242738589211618 [2023-08-26 18:17:08,944 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 409 transitions. [2023-08-26 18:17:08,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 409 transitions. [2023-08-26 18:17:08,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:08,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 409 transitions. [2023-08-26 18:17:08,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:08,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:08,947 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:08,947 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 118 flow. Second operand 4 states and 409 transitions. [2023-08-26 18:17:08,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 279 flow [2023-08-26 18:17:08,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 279 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:17:08,951 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 196 flow [2023-08-26 18:17:08,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-26 18:17:08,953 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-26 18:17:08,953 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 196 flow [2023-08-26 18:17:08,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:08,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:08,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:08,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:17:08,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:08,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1111538024, now seen corresponding path program 1 times [2023-08-26 18:17:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179780522] [2023-08-26 18:17:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:09,642 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:17:09,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179780522] [2023-08-26 18:17:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179780522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:09,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:17:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542307142] [2023-08-26 18:17:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:17:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:09,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:17:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:17:09,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 241 [2023-08-26 18:17:09,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:09,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:09,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 241 [2023-08-26 18:17:09,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:09,999 INFO L124 PetriNetUnfolderBase]: 1541/2348 cut-off events. [2023-08-26 18:17:09,999 INFO L125 PetriNetUnfolderBase]: For 2441/2441 co-relation queries the response was YES. [2023-08-26 18:17:10,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7567 conditions, 2348 events. 1541/2348 cut-off events. For 2441/2441 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10667 event pairs, 267 based on Foata normal form. 20/2368 useless extension candidates. Maximal degree in co-relation 7558. Up to 1647 conditions per place. [2023-08-26 18:17:10,019 INFO L140 encePairwiseOnDemand]: 232/241 looper letters, 84 selfloop transitions, 25 changer transitions 0/109 dead transitions. [2023-08-26 18:17:10,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 109 transitions, 814 flow [2023-08-26 18:17:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:17:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:17:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2023-08-26 18:17:10,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42738589211618255 [2023-08-26 18:17:10,022 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 618 transitions. [2023-08-26 18:17:10,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 618 transitions. [2023-08-26 18:17:10,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:10,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 618 transitions. [2023-08-26 18:17:10,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:10,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:10,027 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:10,027 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 196 flow. Second operand 6 states and 618 transitions. [2023-08-26 18:17:10,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 109 transitions, 814 flow [2023-08-26 18:17:10,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 109 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:17:10,039 INFO L231 Difference]: Finished difference. Result has 48 places, 59 transitions, 448 flow [2023-08-26 18:17:10,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=48, PETRI_TRANSITIONS=59} [2023-08-26 18:17:10,041 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-26 18:17:10,041 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 59 transitions, 448 flow [2023-08-26 18:17:10,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:10,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:10,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:10,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:17:10,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:10,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1089050624, now seen corresponding path program 2 times [2023-08-26 18:17:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:10,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139540434] [2023-08-26 18:17:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:10,860 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:17:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139540434] [2023-08-26 18:17:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139540434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:10,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:10,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:17:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538170596] [2023-08-26 18:17:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:10,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:17:10,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:10,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:17:10,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:17:10,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 241 [2023-08-26 18:17:10,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 59 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:10,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:10,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 241 [2023-08-26 18:17:10,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:11,284 INFO L124 PetriNetUnfolderBase]: 1673/2560 cut-off events. [2023-08-26 18:17:11,285 INFO L125 PetriNetUnfolderBase]: For 4916/4916 co-relation queries the response was YES. [2023-08-26 18:17:11,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9962 conditions, 2560 events. 1673/2560 cut-off events. For 4916/4916 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11959 event pairs, 179 based on Foata normal form. 36/2596 useless extension candidates. Maximal degree in co-relation 9948. Up to 1113 conditions per place. [2023-08-26 18:17:11,304 INFO L140 encePairwiseOnDemand]: 230/241 looper letters, 73 selfloop transitions, 35 changer transitions 0/108 dead transitions. [2023-08-26 18:17:11,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 108 transitions, 957 flow [2023-08-26 18:17:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:17:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:17:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2023-08-26 18:17:11,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42461964038727523 [2023-08-26 18:17:11,307 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 614 transitions. [2023-08-26 18:17:11,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 614 transitions. [2023-08-26 18:17:11,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:11,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 614 transitions. [2023-08-26 18:17:11,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:11,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:11,311 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:11,311 INFO L175 Difference]: Start difference. First operand has 48 places, 59 transitions, 448 flow. Second operand 6 states and 614 transitions. [2023-08-26 18:17:11,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 108 transitions, 957 flow [2023-08-26 18:17:11,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 951 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 18:17:11,320 INFO L231 Difference]: Finished difference. Result has 57 places, 76 transitions, 752 flow [2023-08-26 18:17:11,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=752, PETRI_PLACES=57, PETRI_TRANSITIONS=76} [2023-08-26 18:17:11,323 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-26 18:17:11,326 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 76 transitions, 752 flow [2023-08-26 18:17:11,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:11,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:11,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:11,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:17:11,326 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:11,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:11,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1866319375, now seen corresponding path program 1 times [2023-08-26 18:17:11,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:11,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536522916] [2023-08-26 18:17:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:11,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:12,019 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:17:12,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:12,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536522916] [2023-08-26 18:17:12,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536522916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:12,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:12,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:17:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788141324] [2023-08-26 18:17:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:17:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:17:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:17:12,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 241 [2023-08-26 18:17:12,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 76 transitions, 752 flow. Second operand has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:12,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:12,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 241 [2023-08-26 18:17:12,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:12,412 INFO L124 PetriNetUnfolderBase]: 1408/2328 cut-off events. [2023-08-26 18:17:12,412 INFO L125 PetriNetUnfolderBase]: For 8881/8989 co-relation queries the response was YES. [2023-08-26 18:17:12,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10504 conditions, 2328 events. 1408/2328 cut-off events. For 8881/8989 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13032 event pairs, 299 based on Foata normal form. 29/2225 useless extension candidates. Maximal degree in co-relation 10486. Up to 1415 conditions per place. [2023-08-26 18:17:12,436 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 77 selfloop transitions, 21 changer transitions 0/113 dead transitions. [2023-08-26 18:17:12,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 113 transitions, 1240 flow [2023-08-26 18:17:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:17:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:17:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-26 18:17:12,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44149377593360994 [2023-08-26 18:17:12,439 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-26 18:17:12,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-26 18:17:12,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:12,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-26 18:17:12,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:12,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:12,442 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:12,443 INFO L175 Difference]: Start difference. First operand has 57 places, 76 transitions, 752 flow. Second operand 5 states and 532 transitions. [2023-08-26 18:17:12,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 113 transitions, 1240 flow [2023-08-26 18:17:12,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 113 transitions, 1226 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-08-26 18:17:12,459 INFO L231 Difference]: Finished difference. Result has 63 places, 86 transitions, 927 flow [2023-08-26 18:17:12,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=927, PETRI_PLACES=63, PETRI_TRANSITIONS=86} [2023-08-26 18:17:12,460 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2023-08-26 18:17:12,460 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 86 transitions, 927 flow [2023-08-26 18:17:12,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:12,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:12,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:12,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:17:12,461 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:12,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1834152535, now seen corresponding path program 2 times [2023-08-26 18:17:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806168455] [2023-08-26 18:17:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:13,697 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:17:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806168455] [2023-08-26 18:17:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806168455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:13,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:17:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937255312] [2023-08-26 18:17:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:13,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:17:13,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:13,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:17:13,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:17:13,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 241 [2023-08-26 18:17:13,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 86 transitions, 927 flow. Second operand has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:13,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:13,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 241 [2023-08-26 18:17:13,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:14,312 INFO L124 PetriNetUnfolderBase]: 2022/3115 cut-off events. [2023-08-26 18:17:14,312 INFO L125 PetriNetUnfolderBase]: For 12278/12278 co-relation queries the response was YES. [2023-08-26 18:17:14,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14500 conditions, 3115 events. 2022/3115 cut-off events. For 12278/12278 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 15647 event pairs, 308 based on Foata normal form. 16/3131 useless extension candidates. Maximal degree in co-relation 14479. Up to 1469 conditions per place. [2023-08-26 18:17:14,340 INFO L140 encePairwiseOnDemand]: 230/241 looper letters, 90 selfloop transitions, 68 changer transitions 0/158 dead transitions. [2023-08-26 18:17:14,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 158 transitions, 1813 flow [2023-08-26 18:17:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:17:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:17:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 701 transitions. [2023-08-26 18:17:14,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4155305275637226 [2023-08-26 18:17:14,344 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 701 transitions. [2023-08-26 18:17:14,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 701 transitions. [2023-08-26 18:17:14,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:14,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 701 transitions. [2023-08-26 18:17:14,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:14,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:14,348 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:14,348 INFO L175 Difference]: Start difference. First operand has 63 places, 86 transitions, 927 flow. Second operand 7 states and 701 transitions. [2023-08-26 18:17:14,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 158 transitions, 1813 flow [2023-08-26 18:17:14,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 158 transitions, 1780 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-26 18:17:14,369 INFO L231 Difference]: Finished difference. Result has 72 places, 122 transitions, 1603 flow [2023-08-26 18:17:14,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1603, PETRI_PLACES=72, PETRI_TRANSITIONS=122} [2023-08-26 18:17:14,371 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2023-08-26 18:17:14,371 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 122 transitions, 1603 flow [2023-08-26 18:17:14,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:14,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:14,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:14,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:17:14,373 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:14,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 446667043, now seen corresponding path program 3 times [2023-08-26 18:17:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049206676] [2023-08-26 18:17:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:14,915 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:17:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:14,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049206676] [2023-08-26 18:17:14,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049206676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:14,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:14,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:17:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690850117] [2023-08-26 18:17:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:17:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:14,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:17:14,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:17:14,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 241 [2023-08-26 18:17:14,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 122 transitions, 1603 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:14,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:14,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 241 [2023-08-26 18:17:14,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:15,366 INFO L124 PetriNetUnfolderBase]: 1603/2674 cut-off events. [2023-08-26 18:17:15,366 INFO L125 PetriNetUnfolderBase]: For 18857/19014 co-relation queries the response was YES. [2023-08-26 18:17:15,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13708 conditions, 2674 events. 1603/2674 cut-off events. For 18857/19014 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15553 event pairs, 297 based on Foata normal form. 129/2685 useless extension candidates. Maximal degree in co-relation 13684. Up to 1349 conditions per place. [2023-08-26 18:17:15,387 INFO L140 encePairwiseOnDemand]: 236/241 looper letters, 95 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2023-08-26 18:17:15,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 144 transitions, 2042 flow [2023-08-26 18:17:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:17:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:17:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2023-08-26 18:17:15,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43568464730290457 [2023-08-26 18:17:15,390 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2023-08-26 18:17:15,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2023-08-26 18:17:15,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:15,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2023-08-26 18:17:15,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 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:17:15,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:15,393 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:15,393 INFO L175 Difference]: Start difference. First operand has 72 places, 122 transitions, 1603 flow. Second operand 5 states and 525 transitions. [2023-08-26 18:17:15,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 144 transitions, 2042 flow [2023-08-26 18:17:15,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 144 transitions, 1997 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 18:17:15,423 INFO L231 Difference]: Finished difference. Result has 75 places, 124 transitions, 1653 flow [2023-08-26 18:17:15,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1653, PETRI_PLACES=75, PETRI_TRANSITIONS=124} [2023-08-26 18:17:15,424 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 36 predicate places. [2023-08-26 18:17:15,424 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 124 transitions, 1653 flow [2023-08-26 18:17:15,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:15,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:15,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:15,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:17:15,424 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:15,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1334538537, now seen corresponding path program 1 times [2023-08-26 18:17:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:15,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173106019] [2023-08-26 18:17:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:15,559 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:17:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173106019] [2023-08-26 18:17:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173106019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:15,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:15,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:17:15,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860927118] [2023-08-26 18:17:15,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:15,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:17:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:15,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:17:15,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:17:15,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 241 [2023-08-26 18:17:15,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 124 transitions, 1653 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:15,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:15,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 241 [2023-08-26 18:17:15,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:15,901 INFO L124 PetriNetUnfolderBase]: 1102/1940 cut-off events. [2023-08-26 18:17:15,901 INFO L125 PetriNetUnfolderBase]: For 20263/20818 co-relation queries the response was YES. [2023-08-26 18:17:15,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10065 conditions, 1940 events. 1102/1940 cut-off events. For 20263/20818 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 11889 event pairs, 195 based on Foata normal form. 500/2351 useless extension candidates. Maximal degree in co-relation 10039. Up to 1089 conditions per place. [2023-08-26 18:17:15,917 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 137 selfloop transitions, 7 changer transitions 65/241 dead transitions. [2023-08-26 18:17:15,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 241 transitions, 3602 flow [2023-08-26 18:17:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:17:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:17:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-26 18:17:15,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4464730290456432 [2023-08-26 18:17:15,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-26 18:17:15,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-26 18:17:15,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:15,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-26 18:17:15,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:15,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:15,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:15,924 INFO L175 Difference]: Start difference. First operand has 75 places, 124 transitions, 1653 flow. Second operand 5 states and 538 transitions. [2023-08-26 18:17:15,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 241 transitions, 3602 flow [2023-08-26 18:17:15,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 241 transitions, 3528 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-26 18:17:15,950 INFO L231 Difference]: Finished difference. Result has 79 places, 116 transitions, 1502 flow [2023-08-26 18:17:15,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1502, PETRI_PLACES=79, PETRI_TRANSITIONS=116} [2023-08-26 18:17:15,952 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2023-08-26 18:17:15,952 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 116 transitions, 1502 flow [2023-08-26 18:17:15,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:15,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:15,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:15,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:17:15,953 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:15,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash 753832150, now seen corresponding path program 1 times [2023-08-26 18:17:15,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:15,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37828849] [2023-08-26 18:17:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:15,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:16,088 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:17:16,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37828849] [2023-08-26 18:17:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37828849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:16,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:16,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:17:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892081743] [2023-08-26 18:17:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:16,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:17:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:16,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:17:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:17:16,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 241 [2023-08-26 18:17:16,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 116 transitions, 1502 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 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:17:16,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:16,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 241 [2023-08-26 18:17:16,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:16,427 INFO L124 PetriNetUnfolderBase]: 816/1501 cut-off events. [2023-08-26 18:17:16,427 INFO L125 PetriNetUnfolderBase]: For 18075/19025 co-relation queries the response was YES. [2023-08-26 18:17:16,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8619 conditions, 1501 events. 816/1501 cut-off events. For 18075/19025 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9168 event pairs, 61 based on Foata normal form. 593/2034 useless extension candidates. Maximal degree in co-relation 8591. Up to 644 conditions per place. [2023-08-26 18:17:16,438 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 144 selfloop transitions, 13 changer transitions 67/253 dead transitions. [2023-08-26 18:17:16,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 253 transitions, 3783 flow [2023-08-26 18:17:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:17:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:17:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2023-08-26 18:17:16,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4457617071724956 [2023-08-26 18:17:16,441 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2023-08-26 18:17:16,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2023-08-26 18:17:16,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:16,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2023-08-26 18:17:16,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 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:17:16,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:16,446 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:16,446 INFO L175 Difference]: Start difference. First operand has 79 places, 116 transitions, 1502 flow. Second operand 7 states and 752 transitions. [2023-08-26 18:17:16,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 253 transitions, 3783 flow [2023-08-26 18:17:16,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 253 transitions, 3690 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-08-26 18:17:16,466 INFO L231 Difference]: Finished difference. Result has 85 places, 100 transitions, 1278 flow [2023-08-26 18:17:16,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1278, PETRI_PLACES=85, PETRI_TRANSITIONS=100} [2023-08-26 18:17:16,466 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2023-08-26 18:17:16,466 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 100 transitions, 1278 flow [2023-08-26 18:17:16,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 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:17:16,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:16,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:16,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:17:16,467 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:16,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1009975726, now seen corresponding path program 1 times [2023-08-26 18:17:16,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:16,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212053817] [2023-08-26 18:17:16,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:16,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:16,583 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:17:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212053817] [2023-08-26 18:17:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212053817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:17:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463907521] [2023-08-26 18:17:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:16,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:17:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:17:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:17:16,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 241 [2023-08-26 18:17:16,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 100 transitions, 1278 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:16,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:16,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 241 [2023-08-26 18:17:16,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:16,885 INFO L124 PetriNetUnfolderBase]: 994/1991 cut-off events. [2023-08-26 18:17:16,886 INFO L125 PetriNetUnfolderBase]: For 18160/18323 co-relation queries the response was YES. [2023-08-26 18:17:16,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12209 conditions, 1991 events. 994/1991 cut-off events. For 18160/18323 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 13562 event pairs, 275 based on Foata normal form. 46/1944 useless extension candidates. Maximal degree in co-relation 12179. Up to 985 conditions per place. [2023-08-26 18:17:16,899 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 54 selfloop transitions, 10 changer transitions 59/132 dead transitions. [2023-08-26 18:17:16,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 1811 flow [2023-08-26 18:17:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:17:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:17:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-26 18:17:16,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47579529737206083 [2023-08-26 18:17:16,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-26 18:17:16,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-26 18:17:16,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:16,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-26 18:17:16,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:16,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:16,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:16,904 INFO L175 Difference]: Start difference. First operand has 85 places, 100 transitions, 1278 flow. Second operand 3 states and 344 transitions. [2023-08-26 18:17:16,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 1811 flow [2023-08-26 18:17:16,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 132 transitions, 1750 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-26 18:17:16,952 INFO L231 Difference]: Finished difference. Result has 86 places, 61 transitions, 671 flow [2023-08-26 18:17:16,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=86, PETRI_TRANSITIONS=61} [2023-08-26 18:17:16,953 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2023-08-26 18:17:16,953 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 61 transitions, 671 flow [2023-08-26 18:17:16,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:16,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:16,954 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:17:16,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:17:16,954 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:16,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash -516797906, now seen corresponding path program 1 times [2023-08-26 18:17:16,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890610301] [2023-08-26 18:17:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:17,543 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:17:17,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890610301] [2023-08-26 18:17:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890610301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:17:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901857472] [2023-08-26 18:17:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:17,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:17:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:17,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:17:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:17:17,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 241 [2023-08-26 18:17:17,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 61 transitions, 671 flow. Second operand has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:17,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:17,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 241 [2023-08-26 18:17:17,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:17,969 INFO L124 PetriNetUnfolderBase]: 904/1748 cut-off events. [2023-08-26 18:17:17,969 INFO L125 PetriNetUnfolderBase]: For 13372/13372 co-relation queries the response was YES. [2023-08-26 18:17:17,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9666 conditions, 1748 events. 904/1748 cut-off events. For 13372/13372 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10494 event pairs, 139 based on Foata normal form. 7/1755 useless extension candidates. Maximal degree in co-relation 9634. Up to 776 conditions per place. [2023-08-26 18:17:17,981 INFO L140 encePairwiseOnDemand]: 231/241 looper letters, 67 selfloop transitions, 11 changer transitions 74/152 dead transitions. [2023-08-26 18:17:17,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 152 transitions, 1845 flow [2023-08-26 18:17:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:17:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:17:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 608 transitions. [2023-08-26 18:17:17,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42047026279391425 [2023-08-26 18:17:17,984 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 608 transitions. [2023-08-26 18:17:17,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 608 transitions. [2023-08-26 18:17:17,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:17,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 608 transitions. [2023-08-26 18:17:17,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 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:17:17,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:17,987 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:17,988 INFO L175 Difference]: Start difference. First operand has 86 places, 61 transitions, 671 flow. Second operand 6 states and 608 transitions. [2023-08-26 18:17:17,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 152 transitions, 1845 flow [2023-08-26 18:17:18,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 152 transitions, 1768 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 18:17:18,019 INFO L231 Difference]: Finished difference. Result has 86 places, 52 transitions, 570 flow [2023-08-26 18:17:18,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=86, PETRI_TRANSITIONS=52} [2023-08-26 18:17:18,020 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2023-08-26 18:17:18,020 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 52 transitions, 570 flow [2023-08-26 18:17:18,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:18,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:18,021 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:17:18,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:17:18,021 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:18,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -478481236, now seen corresponding path program 2 times [2023-08-26 18:17:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:18,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172164278] [2023-08-26 18:17:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:18,155 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:17:18,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:18,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172164278] [2023-08-26 18:17:18,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172164278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:18,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:18,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:17:18,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781659420] [2023-08-26 18:17:18,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:18,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:17:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:18,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:17:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:17:18,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 241 [2023-08-26 18:17:18,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 52 transitions, 570 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:18,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:18,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 241 [2023-08-26 18:17:18,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:18,287 INFO L124 PetriNetUnfolderBase]: 152/363 cut-off events. [2023-08-26 18:17:18,287 INFO L125 PetriNetUnfolderBase]: For 3172/3195 co-relation queries the response was YES. [2023-08-26 18:17:18,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 363 events. 152/363 cut-off events. For 3172/3195 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1763 event pairs, 25 based on Foata normal form. 44/402 useless extension candidates. Maximal degree in co-relation 1847. Up to 109 conditions per place. [2023-08-26 18:17:18,289 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 22 selfloop transitions, 10 changer transitions 46/82 dead transitions. [2023-08-26 18:17:18,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 82 transitions, 1048 flow [2023-08-26 18:17:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:17:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:17:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 730 transitions. [2023-08-26 18:17:18,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4327208061647896 [2023-08-26 18:17:18,293 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 730 transitions. [2023-08-26 18:17:18,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 730 transitions. [2023-08-26 18:17:18,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:18,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 730 transitions. [2023-08-26 18:17:18,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:18,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:18,298 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:18,298 INFO L175 Difference]: Start difference. First operand has 86 places, 52 transitions, 570 flow. Second operand 7 states and 730 transitions. [2023-08-26 18:17:18,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 82 transitions, 1048 flow [2023-08-26 18:17:18,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 82 transitions, 893 flow, removed 24 selfloop flow, removed 12 redundant places. [2023-08-26 18:17:18,304 INFO L231 Difference]: Finished difference. Result has 80 places, 29 transitions, 250 flow [2023-08-26 18:17:18,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=80, PETRI_TRANSITIONS=29} [2023-08-26 18:17:18,306 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 41 predicate places. [2023-08-26 18:17:18,306 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 29 transitions, 250 flow [2023-08-26 18:17:18,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:18,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:18,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:18,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:17:18,306 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:17:18,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1742208990, now seen corresponding path program 1 times [2023-08-26 18:17:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050820616] [2023-08-26 18:17:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:17:18,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:17:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:17:18,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:17:18,417 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:17:18,418 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 18:17:18,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 18:17:18,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 18:17:18,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 18:17:18,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 18:17:18,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 18:17:18,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 18:17:18,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 18:17:18,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 18:17:18,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 18:17:18,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 18:17:18,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 18:17:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:17:18,423 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:18,428 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:17:18,429 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:17:18,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:17:18 BasicIcfg [2023-08-26 18:17:18,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:17:18,486 INFO L158 Benchmark]: Toolchain (without parser) took 19020.25ms. Allocated memory was 392.2MB in the beginning and 985.7MB in the end (delta: 593.5MB). Free memory was 366.6MB in the beginning and 538.7MB in the end (delta: -172.0MB). Peak memory consumption was 422.3MB. Max. memory is 16.0GB. [2023-08-26 18:17:18,486 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 392.2MB. Free memory is still 368.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:17:18,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.87ms. Allocated memory is still 392.2MB. Free memory was 366.6MB in the beginning and 343.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:17:18,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.12ms. Allocated memory is still 392.2MB. Free memory was 343.6MB in the beginning and 340.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:17:18,487 INFO L158 Benchmark]: Boogie Preprocessor took 41.33ms. Allocated memory is still 392.2MB. Free memory was 340.9MB in the beginning and 338.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:17:18,487 INFO L158 Benchmark]: RCFGBuilder took 722.88ms. Allocated memory is still 392.2MB. Free memory was 338.9MB in the beginning and 354.2MB in the end (delta: -15.3MB). Peak memory consumption was 29.0MB. Max. memory is 16.0GB. [2023-08-26 18:17:18,487 INFO L158 Benchmark]: TraceAbstraction took 17649.08ms. Allocated memory was 392.2MB in the beginning and 985.7MB in the end (delta: 593.5MB). Free memory was 353.2MB in the beginning and 538.7MB in the end (delta: -185.5MB). Peak memory consumption was 408.0MB. Max. memory is 16.0GB. [2023-08-26 18:17:18,488 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.13ms. Allocated memory is still 392.2MB. Free memory is still 368.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 522.87ms. Allocated memory is still 392.2MB. Free memory was 366.6MB in the beginning and 343.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.12ms. Allocated memory is still 392.2MB. Free memory was 343.6MB in the beginning and 340.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.33ms. Allocated memory is still 392.2MB. Free memory was 340.9MB in the beginning and 338.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 722.88ms. Allocated memory is still 392.2MB. Free memory was 338.9MB in the beginning and 354.2MB in the end (delta: -15.3MB). Peak memory consumption was 29.0MB. Max. memory is 16.0GB. * TraceAbstraction took 17649.08ms. Allocated memory was 392.2MB in the beginning and 985.7MB in the end (delta: 593.5MB). Free memory was 353.2MB in the beginning and 538.7MB in the end (delta: -185.5MB). Peak memory consumption was 408.0MB. 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.6s, 124 PlacesBefore, 39 PlacesAfterwards, 117 TransitionsBefore, 29 TransitionsAfterwards, 2204 CoEnabledTransitionPairs, 6 FixpointIterations, 49 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 121 TotalNumberOfCompositions, 5758 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2671, independent: 2505, independent conditional: 0, independent unconditional: 2505, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1246, independent: 1203, independent conditional: 0, independent unconditional: 1203, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2671, independent: 1302, independent conditional: 0, independent unconditional: 1302, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 1246, unknown conditional: 0, unknown unconditional: 1246] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-2, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=-1, t1196={5:0}, t1197={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=0, t1196={5:0}, t1197={6:0}, t1198={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 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) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 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 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 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=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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=1, __unbuffered_p2_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 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) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 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 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L846] 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)) [L847] 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)) [L848] 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)) [L849] 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)) [L850] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L856] 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", "mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={54:53}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 824]: 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: 828]: 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: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1074 IncrementalHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 43 mSDtfsCounter, 1074 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1653occurred in iteration=9, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:17:18,506 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...