/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/mix051_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:17:40,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:17:40,964 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:17:40,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:17:40,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:17:40,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:17:40,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:17:40,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:17:40,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:17:40,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:17:40,997 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:17:40,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:17:40,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:17:40,999 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:17:40,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:17:40,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:17:40,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:17:40,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:17:40,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:17:41,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:17:41,000 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:17:41,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:17:41,000 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:17:41,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:17:41,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:17:41,001 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:17:41,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:17:41,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:17:41,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:17:41,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:17:41,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:17:41,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:17:41,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:17:41,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:17:41,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:17:41,003 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:17:41,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:17:41,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:17:41,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:17:41,275 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:17:41,276 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:17:41,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:17:42,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:17:42,543 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:17:42,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:17:42,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7d9e7c1/eb88cdc7d4f2476b81217943ae4d2d36/FLAGd160cb755 [2023-08-26 18:17:42,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7d9e7c1/eb88cdc7d4f2476b81217943ae4d2d36 [2023-08-26 18:17:42,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:17:42,566 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:17:42,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:17:42,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:17:42,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:17:42,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:17:42" (1/1) ... [2023-08-26 18:17:42,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd3023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:42, skipping insertion in model container [2023-08-26 18:17:42,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:17:42" (1/1) ... [2023-08-26 18:17:42,619 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:17:42,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:17:42,921 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:17:42,945 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:17:42,946 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:17:42,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:17:42,996 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:17:42,996 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:17:43,001 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:17:43,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43 WrapperNode [2023-08-26 18:17:43,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:17:43,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:17:43,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:17:43,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:17:43,007 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:17:43" (1/1) ... [2023-08-26 18:17:43,052 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:17:43" (1/1) ... [2023-08-26 18:17:43,080 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-08-26 18:17:43,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:17:43,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:17:43,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:17:43,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:17:43,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:17:43,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:17:43,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:17:43,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:17:43,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (1/1) ... [2023-08-26 18:17:43,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:17:43,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:17:43,155 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:43,166 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:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:17:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:17:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:17:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:17:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:17:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:17:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:17:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:17:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:17:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:17:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:17:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:17:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:17:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:17:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:17:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:17:43,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:17:43,184 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:43,296 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:17:43,298 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:17:43,485 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:17:43,621 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:17:43,621 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:17:43,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:17:43 BoogieIcfgContainer [2023-08-26 18:17:43,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:17:43,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:17:43,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:17:43,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:17:43,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:17:42" (1/3) ... [2023-08-26 18:17:43,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745377cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:17:43, skipping insertion in model container [2023-08-26 18:17:43,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:17:43" (2/3) ... [2023-08-26 18:17:43,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745377cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:17:43, skipping insertion in model container [2023-08-26 18:17:43,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:17:43" (3/3) ... [2023-08-26 18:17:43,630 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:17:43,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:17:43,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:17:43,644 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:17:43,693 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:17:43,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 296 flow [2023-08-26 18:17:43,772 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-08-26 18:17:43,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:17:43,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-26 18:17:43,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 138 transitions, 296 flow [2023-08-26 18:17:43,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 134 transitions, 280 flow [2023-08-26 18:17:43,787 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:17:43,792 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 134 transitions, 280 flow [2023-08-26 18:17:43,797 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 134 transitions, 280 flow [2023-08-26 18:17:43,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 134 transitions, 280 flow [2023-08-26 18:17:43,836 INFO L124 PetriNetUnfolderBase]: 3/134 cut-off events. [2023-08-26 18:17:43,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:17:43,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 3/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-26 18:17:43,838 INFO L119 LiptonReduction]: Number of co-enabled transitions 2972 [2023-08-26 18:17:47,290 INFO L134 LiptonReduction]: Checked pairs total: 7722 [2023-08-26 18:17:47,291 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-26 18:17:47,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:17:47,306 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;@262a2f01, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:17:47,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:17:47,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:17:47,307 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 18:17:47,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:17:47,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:47,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:17:47,308 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:47,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 584, now seen corresponding path program 1 times [2023-08-26 18:17:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:47,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250116602] [2023-08-26 18:17:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:47,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:47,395 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:47,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:47,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250116602] [2023-08-26 18:17:47,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250116602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:47,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:47,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:17:47,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445433231] [2023-08-26 18:17:47,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:47,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:17:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:47,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:17:47,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:17:47,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 273 [2023-08-26 18:17:47,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:47,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:47,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 273 [2023-08-26 18:17:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:47,861 INFO L124 PetriNetUnfolderBase]: 3632/5024 cut-off events. [2023-08-26 18:17:47,861 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 18:17:47,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10117 conditions, 5024 events. 3632/5024 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 24789 event pairs, 3632 based on Foata normal form. 180/4525 useless extension candidates. Maximal degree in co-relation 10105. Up to 4990 conditions per place. [2023-08-26 18:17:47,883 INFO L140 encePairwiseOnDemand]: 264/273 looper letters, 25 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-26 18:17:47,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 118 flow [2023-08-26 18:17:47,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:17:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:17:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 284 transitions. [2023-08-26 18:17:47,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201465201465202 [2023-08-26 18:17:47,892 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 284 transitions. [2023-08-26 18:17:47,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 284 transitions. [2023-08-26 18:17:47,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:47,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 284 transitions. [2023-08-26 18:17:47,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call 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:47,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call 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:47,899 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call 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:47,900 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 2 states and 284 transitions. [2023-08-26 18:17:47,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 118 flow [2023-08-26 18:17:47,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:17:47,903 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-26 18:17:47,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-26 18:17:47,906 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-08-26 18:17:47,906 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-26 18:17:47,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:47,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:47,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:47,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:17:47,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:47,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash -690765276, now seen corresponding path program 1 times [2023-08-26 18:17:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:47,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839831611] [2023-08-26 18:17:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:48,193 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:48,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:48,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839831611] [2023-08-26 18:17:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839831611] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:48,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:48,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:17:48,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957956738] [2023-08-26 18:17:48,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:48,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:17:48,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:17:48,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:17:48,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 273 [2023-08-26 18:17:48,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call 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:48,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:48,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 273 [2023-08-26 18:17:48,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:48,489 INFO L124 PetriNetUnfolderBase]: 2891/4256 cut-off events. [2023-08-26 18:17:48,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:17:48,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8353 conditions, 4256 events. 2891/4256 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 23413 event pairs, 668 based on Foata normal form. 0/3964 useless extension candidates. Maximal degree in co-relation 8350. Up to 2980 conditions per place. [2023-08-26 18:17:48,503 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 31 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-08-26 18:17:48,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 162 flow [2023-08-26 18:17:48,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:17:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:17:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-26 18:17:48,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006105006105006 [2023-08-26 18:17:48,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-26 18:17:48,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-26 18:17:48,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:48,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-26 18:17:48,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call 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:48,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call 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:48,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call 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:48,513 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 410 transitions. [2023-08-26 18:17:48,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 162 flow [2023-08-26 18:17:48,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:17:48,516 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 62 flow [2023-08-26 18:17:48,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-08-26 18:17:48,517 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-08-26 18:17:48,518 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 62 flow [2023-08-26 18:17:48,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call 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:48,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:48,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:48,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:17:48,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:48,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1396759250, now seen corresponding path program 1 times [2023-08-26 18:17:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278386099] [2023-08-26 18:17:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:48,712 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:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278386099] [2023-08-26 18:17:48,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278386099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:48,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:17:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886712602] [2023-08-26 18:17:48,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:48,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:17:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:48,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:17:48,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:17:48,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 273 [2023-08-26 18:17:48,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:48,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:48,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 273 [2023-08-26 18:17:48,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:49,103 INFO L124 PetriNetUnfolderBase]: 3033/4526 cut-off events. [2023-08-26 18:17:49,103 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2023-08-26 18:17:49,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9183 conditions, 4526 events. 3033/4526 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 24746 event pairs, 621 based on Foata normal form. 192/4702 useless extension candidates. Maximal degree in co-relation 9179. Up to 3353 conditions per place. [2023-08-26 18:17:49,119 INFO L140 encePairwiseOnDemand]: 268/273 looper letters, 37 selfloop transitions, 3 changer transitions 21/63 dead transitions. [2023-08-26 18:17:49,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 63 transitions, 272 flow [2023-08-26 18:17:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:17:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:17:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-26 18:17:49,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747252747252747 [2023-08-26 18:17:49,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-26 18:17:49,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-26 18:17:49,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:49,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-26 18:17:49,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:49,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call 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:49,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call 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:49,125 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 62 flow. Second operand 5 states and 648 transitions. [2023-08-26 18:17:49,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 63 transitions, 272 flow [2023-08-26 18:17:49,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 63 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:17:49,127 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 85 flow [2023-08-26 18:17:49,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-08-26 18:17:49,128 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2023-08-26 18:17:49,128 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 85 flow [2023-08-26 18:17:49,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:49,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:49,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:49,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:17:49,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:49,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -349887294, now seen corresponding path program 1 times [2023-08-26 18:17:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824586382] [2023-08-26 18:17:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:49,254 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:49,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824586382] [2023-08-26 18:17:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824586382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:49,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:49,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:17:49,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197925331] [2023-08-26 18:17:49,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:49,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:17:49,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:49,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:17:49,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:17:49,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-08-26 18:17:49,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call 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:49,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:49,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-08-26 18:17:49,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:49,431 INFO L124 PetriNetUnfolderBase]: 1743/2567 cut-off events. [2023-08-26 18:17:49,431 INFO L125 PetriNetUnfolderBase]: For 678/679 co-relation queries the response was YES. [2023-08-26 18:17:49,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6105 conditions, 2567 events. 1743/2567 cut-off events. For 678/679 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12331 event pairs, 412 based on Foata normal form. 45/2608 useless extension candidates. Maximal degree in co-relation 6098. Up to 2292 conditions per place. [2023-08-26 18:17:49,441 INFO L140 encePairwiseOnDemand]: 267/273 looper letters, 35 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-08-26 18:17:49,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 212 flow [2023-08-26 18:17:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:17:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:17:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-26 18:17:49,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-08-26 18:17:49,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-26 18:17:49,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-26 18:17:49,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:49,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-26 18:17:49,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:49,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call 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:49,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call 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:49,446 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 85 flow. Second operand 3 states and 396 transitions. [2023-08-26 18:17:49,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 212 flow [2023-08-26 18:17:49,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:17:49,450 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 113 flow [2023-08-26 18:17:49,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-26 18:17:49,451 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2023-08-26 18:17:49,451 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 113 flow [2023-08-26 18:17:49,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call 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:49,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:49,451 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:49,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:17:49,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:49,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:49,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1810138177, now seen corresponding path program 1 times [2023-08-26 18:17:49,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:49,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826835279] [2023-08-26 18:17:49,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:49,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:49,596 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:49,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826835279] [2023-08-26 18:17:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826835279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:49,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:49,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:17:49,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068436105] [2023-08-26 18:17:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:49,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:17:49,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:49,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:17:49,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:17:49,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 273 [2023-08-26 18:17:49,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call 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:49,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:49,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 273 [2023-08-26 18:17:49,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:50,093 INFO L124 PetriNetUnfolderBase]: 4737/6874 cut-off events. [2023-08-26 18:17:50,093 INFO L125 PetriNetUnfolderBase]: For 2885/2885 co-relation queries the response was YES. [2023-08-26 18:17:50,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18399 conditions, 6874 events. 4737/6874 cut-off events. For 2885/2885 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 34660 event pairs, 1555 based on Foata normal form. 236/7110 useless extension candidates. Maximal degree in co-relation 18392. Up to 4435 conditions per place. [2023-08-26 18:17:50,123 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 48 selfloop transitions, 8 changer transitions 23/79 dead transitions. [2023-08-26 18:17:50,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 79 transitions, 429 flow [2023-08-26 18:17:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:17:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:17:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2023-08-26 18:17:50,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-26 18:17:50,126 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2023-08-26 18:17:50,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2023-08-26 18:17:50,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:50,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2023-08-26 18:17:50,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:50,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call 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:50,131 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call 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:50,131 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 113 flow. Second operand 5 states and 630 transitions. [2023-08-26 18:17:50,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 79 transitions, 429 flow [2023-08-26 18:17:50,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:17:50,134 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 186 flow [2023-08-26 18:17:50,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-26 18:17:50,134 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-26 18:17:50,134 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 186 flow [2023-08-26 18:17:50,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call 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:50,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:50,135 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:50,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:17:50,135 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:50,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1634745609, now seen corresponding path program 1 times [2023-08-26 18:17:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:50,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014734155] [2023-08-26 18:17:50,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:17:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:50,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014734155] [2023-08-26 18:17:50,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014734155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:50,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:50,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:17:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212950134] [2023-08-26 18:17:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:50,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:17:50,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:17:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:17:50,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-08-26 18:17:50,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call 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:50,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:50,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-08-26 18:17:50,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:50,428 INFO L124 PetriNetUnfolderBase]: 1637/2611 cut-off events. [2023-08-26 18:17:50,428 INFO L125 PetriNetUnfolderBase]: For 3548/3744 co-relation queries the response was YES. [2023-08-26 18:17:50,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8329 conditions, 2611 events. 1637/2611 cut-off events. For 3548/3744 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13698 event pairs, 307 based on Foata normal form. 204/2715 useless extension candidates. Maximal degree in co-relation 8319. Up to 1586 conditions per place. [2023-08-26 18:17:50,440 INFO L140 encePairwiseOnDemand]: 267/273 looper letters, 53 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2023-08-26 18:17:50,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 448 flow [2023-08-26 18:17:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:17:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:17:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-08-26 18:17:50,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48443223443223443 [2023-08-26 18:17:50,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-08-26 18:17:50,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-08-26 18:17:50,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:50,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-08-26 18:17:50,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call 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:50,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call 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:50,445 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call 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:50,445 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 186 flow. Second operand 4 states and 529 transitions. [2023-08-26 18:17:50,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 448 flow [2023-08-26 18:17:50,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 422 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-26 18:17:50,451 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 220 flow [2023-08-26 18:17:50,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-08-26 18:17:50,451 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-26 18:17:50,451 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 220 flow [2023-08-26 18:17:50,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call 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:50,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:50,452 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:50,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:17:50,452 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:50,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash 511766580, now seen corresponding path program 1 times [2023-08-26 18:17:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764087074] [2023-08-26 18:17:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:50,536 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:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764087074] [2023-08-26 18:17:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764087074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:50,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:17:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593748372] [2023-08-26 18:17:50,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:50,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:17:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:17:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:17:50,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-08-26 18:17:50,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call 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:50,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-08-26 18:17:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:50,729 INFO L124 PetriNetUnfolderBase]: 1020/1653 cut-off events. [2023-08-26 18:17:50,729 INFO L125 PetriNetUnfolderBase]: For 2859/3079 co-relation queries the response was YES. [2023-08-26 18:17:50,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 1653 events. 1020/1653 cut-off events. For 2859/3079 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8305 event pairs, 161 based on Foata normal form. 190/1766 useless extension candidates. Maximal degree in co-relation 5964. Up to 644 conditions per place. [2023-08-26 18:17:50,737 INFO L140 encePairwiseOnDemand]: 267/273 looper letters, 63 selfloop transitions, 13 changer transitions 0/83 dead transitions. [2023-08-26 18:17:50,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 83 transitions, 552 flow [2023-08-26 18:17:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:17:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:17:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-26 18:17:50,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-08-26 18:17:50,739 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-26 18:17:50,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-26 18:17:50,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:50,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-26 18:17:50,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call 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:50,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call 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:50,742 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call 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:50,742 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 220 flow. Second operand 5 states and 660 transitions. [2023-08-26 18:17:50,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 83 transitions, 552 flow [2023-08-26 18:17:50,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 534 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 18:17:50,746 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 270 flow [2023-08-26 18:17:50,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-26 18:17:50,747 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-26 18:17:50,747 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 270 flow [2023-08-26 18:17:50,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call 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:50,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:50,747 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:50,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:17:50,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:50,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1041871432, now seen corresponding path program 1 times [2023-08-26 18:17:50,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:50,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159017842] [2023-08-26 18:17:50,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:50,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:50,855 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:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159017842] [2023-08-26 18:17:50,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159017842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:50,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:50,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:17:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997000735] [2023-08-26 18:17:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:50,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:17:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:17:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:17:50,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 273 [2023-08-26 18:17:50,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:50,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:50,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 273 [2023-08-26 18:17:50,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:51,138 INFO L124 PetriNetUnfolderBase]: 1789/2793 cut-off events. [2023-08-26 18:17:51,138 INFO L125 PetriNetUnfolderBase]: For 5683/5683 co-relation queries the response was YES. [2023-08-26 18:17:51,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10470 conditions, 2793 events. 1789/2793 cut-off events. For 5683/5683 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13527 event pairs, 91 based on Foata normal form. 17/2810 useless extension candidates. Maximal degree in co-relation 10459. Up to 1214 conditions per place. [2023-08-26 18:17:51,149 INFO L140 encePairwiseOnDemand]: 264/273 looper letters, 100 selfloop transitions, 18 changer transitions 16/134 dead transitions. [2023-08-26 18:17:51,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 134 transitions, 1074 flow [2023-08-26 18:17:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:17:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:17:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-08-26 18:17:51,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45054945054945056 [2023-08-26 18:17:51,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-08-26 18:17:51,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-08-26 18:17:51,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:51,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-08-26 18:17:51,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call 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:51,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call 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:51,156 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call 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:51,156 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 270 flow. Second operand 7 states and 861 transitions. [2023-08-26 18:17:51,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 134 transitions, 1074 flow [2023-08-26 18:17:51,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 134 transitions, 960 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-26 18:17:51,173 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 384 flow [2023-08-26 18:17:51,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=384, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2023-08-26 18:17:51,173 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-08-26 18:17:51,173 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 384 flow [2023-08-26 18:17:51,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:51,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:51,174 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:51,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:17:51,174 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:51,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1528087200, now seen corresponding path program 2 times [2023-08-26 18:17:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:51,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950132438] [2023-08-26 18:17:51,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:51,281 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:51,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:51,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950132438] [2023-08-26 18:17:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950132438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:51,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:51,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:17:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995941796] [2023-08-26 18:17:51,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:51,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:17:51,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:17:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:17:51,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2023-08-26 18:17:51,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call 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:51,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:51,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2023-08-26 18:17:51,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:51,511 INFO L124 PetriNetUnfolderBase]: 1218/1940 cut-off events. [2023-08-26 18:17:51,511 INFO L125 PetriNetUnfolderBase]: For 5302/5585 co-relation queries the response was YES. [2023-08-26 18:17:51,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7523 conditions, 1940 events. 1218/1940 cut-off events. For 5302/5585 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10237 event pairs, 145 based on Foata normal form. 152/2023 useless extension candidates. Maximal degree in co-relation 7507. Up to 756 conditions per place. [2023-08-26 18:17:51,520 INFO L140 encePairwiseOnDemand]: 267/273 looper letters, 68 selfloop transitions, 17 changer transitions 3/102 dead transitions. [2023-08-26 18:17:51,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 102 transitions, 831 flow [2023-08-26 18:17:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:17:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:17:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2023-08-26 18:17:51,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47557997557997556 [2023-08-26 18:17:51,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2023-08-26 18:17:51,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2023-08-26 18:17:51,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:51,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2023-08-26 18:17:51,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call 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:51,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call 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:51,526 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call 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:51,526 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 384 flow. Second operand 6 states and 779 transitions. [2023-08-26 18:17:51,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 102 transitions, 831 flow [2023-08-26 18:17:51,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 773 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-08-26 18:17:51,551 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 398 flow [2023-08-26 18:17:51,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-08-26 18:17:51,552 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-08-26 18:17:51,552 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 398 flow [2023-08-26 18:17:51,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call 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:51,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:51,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:51,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:17:51,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:51,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1411387406, now seen corresponding path program 1 times [2023-08-26 18:17:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324405132] [2023-08-26 18:17:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:51,701 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:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324405132] [2023-08-26 18:17:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324405132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:51,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:51,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:17:51,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843959477] [2023-08-26 18:17:51,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:51,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:17:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:51,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:17:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:17:51,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 273 [2023-08-26 18:17:51,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:51,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:51,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 273 [2023-08-26 18:17:51,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:52,053 INFO L124 PetriNetUnfolderBase]: 2166/3340 cut-off events. [2023-08-26 18:17:52,053 INFO L125 PetriNetUnfolderBase]: For 9642/9642 co-relation queries the response was YES. [2023-08-26 18:17:52,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14366 conditions, 3340 events. 2166/3340 cut-off events. For 9642/9642 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16867 event pairs, 205 based on Foata normal form. 1/3341 useless extension candidates. Maximal degree in co-relation 14351. Up to 1407 conditions per place. [2023-08-26 18:17:52,064 INFO L140 encePairwiseOnDemand]: 264/273 looper letters, 63 selfloop transitions, 16 changer transitions 76/155 dead transitions. [2023-08-26 18:17:52,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 155 transitions, 1389 flow [2023-08-26 18:17:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:17:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:17:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-08-26 18:17:52,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44636316064887493 [2023-08-26 18:17:52,066 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-08-26 18:17:52,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-08-26 18:17:52,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:52,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-08-26 18:17:52,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call 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:52,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call 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:52,071 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call 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:52,071 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 398 flow. Second operand 7 states and 853 transitions. [2023-08-26 18:17:52,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 155 transitions, 1389 flow [2023-08-26 18:17:52,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 155 transitions, 1202 flow, removed 49 selfloop flow, removed 5 redundant places. [2023-08-26 18:17:52,116 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 377 flow [2023-08-26 18:17:52,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=377, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2023-08-26 18:17:52,117 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2023-08-26 18:17:52,117 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 377 flow [2023-08-26 18:17:52,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:52,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:52,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:52,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:17:52,118 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:52,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash 604783048, now seen corresponding path program 2 times [2023-08-26 18:17:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:52,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985567868] [2023-08-26 18:17:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:52,513 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:52,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985567868] [2023-08-26 18:17:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985567868] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:52,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:52,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:17:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789431319] [2023-08-26 18:17:52,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:52,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:17:52,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:17:52,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:17:52,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 273 [2023-08-26 18:17:52,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 377 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call 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:52,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:52,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 273 [2023-08-26 18:17:52,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:52,752 INFO L124 PetriNetUnfolderBase]: 1099/1851 cut-off events. [2023-08-26 18:17:52,752 INFO L125 PetriNetUnfolderBase]: For 4814/4885 co-relation queries the response was YES. [2023-08-26 18:17:52,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7163 conditions, 1851 events. 1099/1851 cut-off events. For 4814/4885 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10414 event pairs, 259 based on Foata normal form. 14/1815 useless extension candidates. Maximal degree in co-relation 7146. Up to 585 conditions per place. [2023-08-26 18:17:52,759 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 57 selfloop transitions, 4 changer transitions 37/111 dead transitions. [2023-08-26 18:17:52,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 949 flow [2023-08-26 18:17:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:17:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:17:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 942 transitions. [2023-08-26 18:17:52,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43131868131868134 [2023-08-26 18:17:52,761 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 942 transitions. [2023-08-26 18:17:52,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 942 transitions. [2023-08-26 18:17:52,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:52,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 942 transitions. [2023-08-26 18:17:52,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call 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:52,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call 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:52,765 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call 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:52,766 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 377 flow. Second operand 8 states and 942 transitions. [2023-08-26 18:17:52,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 949 flow [2023-08-26 18:17:52,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 111 transitions, 892 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-26 18:17:52,785 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 363 flow [2023-08-26 18:17:52,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=363, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2023-08-26 18:17:52,786 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2023-08-26 18:17:52,786 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 363 flow [2023-08-26 18:17:52,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call 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:52,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:52,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:52,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:17:52,787 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:52,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1342781330, now seen corresponding path program 3 times [2023-08-26 18:17:52,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:52,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448835321] [2023-08-26 18:17:52,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:52,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:17:52,921 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:52,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:17:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448835321] [2023-08-26 18:17:52,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448835321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:17:52,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:17:52,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:17:52,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050584553] [2023-08-26 18:17:52,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:17:52,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:17:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:17:52,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:17:52,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:17:52,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 273 [2023-08-26 18:17:52,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call 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:52,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:17:52,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 273 [2023-08-26 18:17:52,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:17:53,094 INFO L124 PetriNetUnfolderBase]: 1167/1966 cut-off events. [2023-08-26 18:17:53,094 INFO L125 PetriNetUnfolderBase]: For 5094/5158 co-relation queries the response was YES. [2023-08-26 18:17:53,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7762 conditions, 1966 events. 1167/1966 cut-off events. For 5094/5158 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10741 event pairs, 377 based on Foata normal form. 1/1926 useless extension candidates. Maximal degree in co-relation 7743. Up to 1057 conditions per place. [2023-08-26 18:17:53,100 INFO L140 encePairwiseOnDemand]: 269/273 looper letters, 37 selfloop transitions, 4 changer transitions 38/83 dead transitions. [2023-08-26 18:17:53,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 674 flow [2023-08-26 18:17:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:17:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:17:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-26 18:17:53,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652014652014652 [2023-08-26 18:17:53,101 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-26 18:17:53,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-26 18:17:53,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:17:53,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-26 18:17:53,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:17:53,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call 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:53,104 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call 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:53,104 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 363 flow. Second operand 4 states and 508 transitions. [2023-08-26 18:17:53,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 674 flow [2023-08-26 18:17:53,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 654 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-26 18:17:53,128 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 266 flow [2023-08-26 18:17:53,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-08-26 18:17:53,128 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2023-08-26 18:17:53,128 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 266 flow [2023-08-26 18:17:53,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call 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:53,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:17:53,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:53,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:17:53,129 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:17:53,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:17:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2040152266, now seen corresponding path program 4 times [2023-08-26 18:17:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:17:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136197781] [2023-08-26 18:17:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:17:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:17:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:17:53,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:17:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:17:53,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:17:53,204 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:17:53,205 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:17:53,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:17:53,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:17:53,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:17:53,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:17:53,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:17:53,209 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:17:53,212 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:17:53,212 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:17:53,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:17:53 BasicIcfg [2023-08-26 18:17:53,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:17:53,288 INFO L158 Benchmark]: Toolchain (without parser) took 10721.23ms. Allocated memory was 352.3MB in the beginning and 887.1MB in the end (delta: 534.8MB). Free memory was 327.6MB in the beginning and 500.6MB in the end (delta: -172.9MB). Peak memory consumption was 363.4MB. Max. memory is 16.0GB. [2023-08-26 18:17:53,288 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 352.3MB. Free memory is still 327.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:17:53,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.43ms. Allocated memory is still 352.3MB. Free memory was 327.1MB in the beginning and 304.1MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:17:53,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.84ms. Allocated memory is still 352.3MB. Free memory was 304.1MB in the beginning and 302.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:17:53,288 INFO L158 Benchmark]: Boogie Preprocessor took 38.10ms. Allocated memory is still 352.3MB. Free memory was 302.0MB in the beginning and 299.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:17:53,288 INFO L158 Benchmark]: RCFGBuilder took 502.64ms. Allocated memory is still 352.3MB. Free memory was 299.9MB in the beginning and 316.6MB in the end (delta: -16.6MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. [2023-08-26 18:17:53,289 INFO L158 Benchmark]: TraceAbstraction took 9662.76ms. Allocated memory was 352.3MB in the beginning and 887.1MB in the end (delta: 534.8MB). Free memory was 315.6MB in the beginning and 500.6MB in the end (delta: -184.9MB). Peak memory consumption was 352.8MB. Max. memory is 16.0GB. [2023-08-26 18:17:53,289 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.12ms. Allocated memory is still 352.3MB. Free memory is still 327.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 434.43ms. Allocated memory is still 352.3MB. Free memory was 327.1MB in the beginning and 304.1MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.84ms. Allocated memory is still 352.3MB. Free memory was 304.1MB in the beginning and 302.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.10ms. Allocated memory is still 352.3MB. Free memory was 302.0MB in the beginning and 299.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 502.64ms. Allocated memory is still 352.3MB. Free memory was 299.9MB in the beginning and 316.6MB in the end (delta: -16.6MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. * TraceAbstraction took 9662.76ms. Allocated memory was 352.3MB in the beginning and 887.1MB in the end (delta: 534.8MB). Free memory was 315.6MB in the beginning and 500.6MB in the end (delta: -184.9MB). Peak memory consumption was 352.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 144 PlacesBefore, 49 PlacesAfterwards, 134 TransitionsBefore, 37 TransitionsAfterwards, 2972 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 135 TotalNumberOfCompositions, 7722 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4025, independent: 3833, independent conditional: 0, independent unconditional: 3833, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1633, independent: 1603, independent conditional: 0, independent unconditional: 1603, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4025, independent: 2230, independent conditional: 0, independent unconditional: 2230, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1633, unknown conditional: 0, unknown unconditional: 1633] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-3, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-2, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 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", "mix051_pso.opt_rmo.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1148 IncrementalHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 25 mSDtfsCounter, 1148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=9, InterpolantAutomatonStates: 59, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:53,311 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...