/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/mix017_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:11:41,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:11:41,592 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:11:41,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:11:41,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:11:41,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:11:41,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:11:41,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:11:41,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:11:41,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:11:41,633 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:11:41,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:11:41,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:11:41,635 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:11:41,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:11:41,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:11:41,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:11:41,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:11:41,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:11:41,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:11:41,636 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:11:41,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:11:41,637 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:11:41,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:11:41,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:11:41,638 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:11:41,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:11:41,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:11:41,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:11:41,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:11:41,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:11:41,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:11:41,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:11:41,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:11:41,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:11:41,641 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:11:41,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:11:41,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:11:41,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:11:41,980 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:11:41,981 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:11:41,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-08-26 18:11:43,077 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:11:43,394 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:11:43,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-08-26 18:11:43,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd3262d35/9635ff8eb63f4f36b1c05e72cd3cc1db/FLAGddf883046 [2023-08-26 18:11:43,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd3262d35/9635ff8eb63f4f36b1c05e72cd3cc1db [2023-08-26 18:11:43,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:11:43,435 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:11:43,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:11:43,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:11:43,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:11:43,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:11:43" (1/1) ... [2023-08-26 18:11:43,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e3c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:43, skipping insertion in model container [2023-08-26 18:11:43,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:11:43" (1/1) ... [2023-08-26 18:11:43,505 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:11:43,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:11:43,907 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:11:43,933 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:11:43,934 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:11:43,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:11:44,025 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:11:44,026 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:11:44,032 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:11:44,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44 WrapperNode [2023-08-26 18:11:44,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:11:44,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:11:44,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:11:44,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:11:44,039 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:11:44" (1/1) ... [2023-08-26 18:11:44,068 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:11:44" (1/1) ... [2023-08-26 18:11:44,109 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 172 [2023-08-26 18:11:44,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:11:44,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:11:44,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:11:44,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:11:44,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:11:44,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:11:44,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:11:44,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:11:44,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (1/1) ... [2023-08-26 18:11:44,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:11:44,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:11:44,202 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:11:44,225 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:11:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:11:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:11:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:11:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:11:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:11:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:11:44,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:11:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:11:44,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:11:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:11:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:11:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:11:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:11:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:11:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:11:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:11:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:11:44,247 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:11:44,388 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:11:44,389 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:11:44,778 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:11:44,885 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:11:44,886 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:11:44,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:11:44 BoogieIcfgContainer [2023-08-26 18:11:44,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:11:44,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:11:44,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:11:44,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:11:44,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:11:43" (1/3) ... [2023-08-26 18:11:44,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa1ae03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:11:44, skipping insertion in model container [2023-08-26 18:11:44,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:11:44" (2/3) ... [2023-08-26 18:11:44,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa1ae03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:11:44, skipping insertion in model container [2023-08-26 18:11:44,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:11:44" (3/3) ... [2023-08-26 18:11:44,897 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2023-08-26 18:11:44,916 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:11:44,916 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:11:44,917 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:11:44,978 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:11:45,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 18:11:45,092 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 18:11:45,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:11:45,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-26 18:11:45,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 18:11:45,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-26 18:11:45,110 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:11:45,120 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 18:11:45,124 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 18:11:45,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-26 18:11:45,197 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 18:11:45,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:11:45,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-26 18:11:45,202 INFO L119 LiptonReduction]: Number of co-enabled transitions 3078 [2023-08-26 18:11:49,494 INFO L134 LiptonReduction]: Checked pairs total: 7251 [2023-08-26 18:11:49,494 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-26 18:11:49,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:11:49,510 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;@3144ceb4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:11:49,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:11:49,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:11:49,512 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:11:49,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:11:49,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:49,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:11:49,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:11:49,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash 632, now seen corresponding path program 1 times [2023-08-26 18:11:49,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:49,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179923378] [2023-08-26 18:11:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:49,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:49,607 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:11:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179923378] [2023-08-26 18:11:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179923378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:49,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:11:49,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821428082] [2023-08-26 18:11:49,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:49,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:11:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:49,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:11:49,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:11:49,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-08-26 18:11:49,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:49,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:49,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-08-26 18:11:49,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:50,173 INFO L124 PetriNetUnfolderBase]: 3113/4402 cut-off events. [2023-08-26 18:11:50,174 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 18:11:50,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8796 conditions, 4402 events. 3113/4402 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 21942 event pairs, 3113 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 8784. Up to 4291 conditions per place. [2023-08-26 18:11:50,208 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-26 18:11:50,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 114 flow [2023-08-26 18:11:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:11:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:11:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-26 18:11:50,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2023-08-26 18:11:50,226 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-26 18:11:50,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-26 18:11:50,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:50,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-26 18:11:50,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:50,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:50,238 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:50,240 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 2 states and 287 transitions. [2023-08-26 18:11:50,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 114 flow [2023-08-26 18:11:50,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:11:50,245 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 62 flow [2023-08-26 18:11:50,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-26 18:11:50,250 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2023-08-26 18:11:50,250 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 62 flow [2023-08-26 18:11:50,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:50,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:50,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:50,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:11:50,251 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:11:50,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1641626857, now seen corresponding path program 1 times [2023-08-26 18:11:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:50,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990086455] [2023-08-26 18:11:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:11:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990086455] [2023-08-26 18:11:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990086455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:50,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:50,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:11:50,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919867225] [2023-08-26 18:11:50,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:50,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:11:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:50,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:11:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:11:50,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-08-26 18:11:50,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:50,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:50,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-08-26 18:11:50,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:51,093 INFO L124 PetriNetUnfolderBase]: 2594/3775 cut-off events. [2023-08-26 18:11:51,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:11:51,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7467 conditions, 3775 events. 2594/3775 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19562 event pairs, 518 based on Foata normal form. 0/3591 useless extension candidates. Maximal degree in co-relation 7464. Up to 2797 conditions per place. [2023-08-26 18:11:51,115 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-26 18:11:51,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 150 flow [2023-08-26 18:11:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:11:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:11:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-26 18:11:51,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2023-08-26 18:11:51,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-26 18:11:51,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-26 18:11:51,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:51,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-26 18:11:51,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,126 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 62 flow. Second operand 3 states and 413 transitions. [2023-08-26 18:11:51,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 150 flow [2023-08-26 18:11:51,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:11:51,129 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2023-08-26 18:11:51,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-26 18:11:51,130 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -10 predicate places. [2023-08-26 18:11:51,131 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 62 flow [2023-08-26 18:11:51,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:51,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:51,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:11:51,136 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:11:51,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1350351770, now seen corresponding path program 1 times [2023-08-26 18:11:51,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:51,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182500902] [2023-08-26 18:11:51,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:51,389 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:11:51,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:51,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182500902] [2023-08-26 18:11:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182500902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:51,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:11:51,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821234157] [2023-08-26 18:11:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:51,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:11:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:51,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:11:51,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:11:51,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 280 [2023-08-26 18:11:51,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:51,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 280 [2023-08-26 18:11:51,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:51,683 INFO L124 PetriNetUnfolderBase]: 1853/2710 cut-off events. [2023-08-26 18:11:51,683 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-26 18:11:51,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5519 conditions, 2710 events. 1853/2710 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13004 event pairs, 737 based on Foata normal form. 72/2778 useless extension candidates. Maximal degree in co-relation 5515. Up to 1621 conditions per place. [2023-08-26 18:11:51,698 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 29 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-26 18:11:51,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 142 flow [2023-08-26 18:11:51,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:11:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:11:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 18:11:51,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845238095238095 [2023-08-26 18:11:51,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 18:11:51,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 18:11:51,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:51,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 18:11:51,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,703 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 62 flow. Second operand 3 states and 407 transitions. [2023-08-26 18:11:51,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 142 flow [2023-08-26 18:11:51,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:11:51,706 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 66 flow [2023-08-26 18:11:51,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-26 18:11:51,706 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -10 predicate places. [2023-08-26 18:11:51,707 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 66 flow [2023-08-26 18:11:51,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:51,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:51,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:11:51,708 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:11:51,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash -611253502, now seen corresponding path program 1 times [2023-08-26 18:11:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:51,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512481719] [2023-08-26 18:11:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:51,899 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:11:51,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:51,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512481719] [2023-08-26 18:11:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512481719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:11:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793305057] [2023-08-26 18:11:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:51,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:11:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:51,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:11:51,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:11:51,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 280 [2023-08-26 18:11:51,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:51,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:51,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 280 [2023-08-26 18:11:51,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:52,212 INFO L124 PetriNetUnfolderBase]: 1760/2592 cut-off events. [2023-08-26 18:11:52,213 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-08-26 18:11:52,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 2592 events. 1760/2592 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12552 event pairs, 263 based on Foata normal form. 180/2769 useless extension candidates. Maximal degree in co-relation 5580. Up to 1204 conditions per place. [2023-08-26 18:11:52,224 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 44 selfloop transitions, 6 changer transitions 1/54 dead transitions. [2023-08-26 18:11:52,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 238 flow [2023-08-26 18:11:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:11:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:11:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-08-26 18:11:52,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47232142857142856 [2023-08-26 18:11:52,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-08-26 18:11:52,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-08-26 18:11:52,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:52,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-08-26 18:11:52,228 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:11:52,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:52,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:52,231 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 66 flow. Second operand 4 states and 529 transitions. [2023-08-26 18:11:52,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 238 flow [2023-08-26 18:11:52,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:11:52,233 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 104 flow [2023-08-26 18:11:52,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-26 18:11:52,234 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2023-08-26 18:11:52,234 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 104 flow [2023-08-26 18:11:52,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:52,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:52,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:52,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:11:52,235 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:11:52,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 18565911, now seen corresponding path program 1 times [2023-08-26 18:11:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498096429] [2023-08-26 18:11:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:52,459 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:11:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498096429] [2023-08-26 18:11:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498096429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:52,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:11:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748058410] [2023-08-26 18:11:52,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:52,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:11:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:52,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:11:52,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:11:52,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 280 [2023-08-26 18:11:52,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:52,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:52,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 280 [2023-08-26 18:11:52,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:52,735 INFO L124 PetriNetUnfolderBase]: 1056/1632 cut-off events. [2023-08-26 18:11:52,735 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2023-08-26 18:11:52,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4476 conditions, 1632 events. 1056/1632 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7491 event pairs, 121 based on Foata normal form. 132/1761 useless extension candidates. Maximal degree in co-relation 4469. Up to 568 conditions per place. [2023-08-26 18:11:52,744 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 55 selfloop transitions, 10 changer transitions 1/69 dead transitions. [2023-08-26 18:11:52,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 348 flow [2023-08-26 18:11:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:11:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:11:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-26 18:11:52,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4735714285714286 [2023-08-26 18:11:52,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-26 18:11:52,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-26 18:11:52,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:52,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-26 18:11:52,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:52,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:52,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:52,752 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 104 flow. Second operand 5 states and 663 transitions. [2023-08-26 18:11:52,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 348 flow [2023-08-26 18:11:52,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 337 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:11:52,758 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 156 flow [2023-08-26 18:11:52,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-26 18:11:52,760 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-08-26 18:11:52,760 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 156 flow [2023-08-26 18:11:52,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:52,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:52,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:52,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:11:52,761 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:11:52,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1545653863, now seen corresponding path program 1 times [2023-08-26 18:11:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195723098] [2023-08-26 18:11:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:53,014 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:11:53,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:53,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195723098] [2023-08-26 18:11:53,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195723098] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:53,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:53,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:11:53,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005161726] [2023-08-26 18:11:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:53,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:11:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:53,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:11:53,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:11:53,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 280 [2023-08-26 18:11:53,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:53,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 280 [2023-08-26 18:11:53,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:53,265 INFO L124 PetriNetUnfolderBase]: 636/1018 cut-off events. [2023-08-26 18:11:53,265 INFO L125 PetriNetUnfolderBase]: For 1039/1039 co-relation queries the response was YES. [2023-08-26 18:11:53,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3231 conditions, 1018 events. 636/1018 cut-off events. For 1039/1039 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4263 event pairs, 119 based on Foata normal form. 56/1071 useless extension candidates. Maximal degree in co-relation 3223. Up to 343 conditions per place. [2023-08-26 18:11:53,271 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 64 selfloop transitions, 14 changer transitions 1/82 dead transitions. [2023-08-26 18:11:53,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 464 flow [2023-08-26 18:11:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:11:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:11:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions. [2023-08-26 18:11:53,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2023-08-26 18:11:53,274 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 795 transitions. [2023-08-26 18:11:53,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions. [2023-08-26 18:11:53,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:53,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions. [2023-08-26 18:11:53,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,279 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,279 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 156 flow. Second operand 6 states and 795 transitions. [2023-08-26 18:11:53,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 464 flow [2023-08-26 18:11:53,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 82 transitions, 434 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-26 18:11:53,287 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 206 flow [2023-08-26 18:11:53,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-26 18:11:53,287 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2023-08-26 18:11:53,287 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 206 flow [2023-08-26 18:11:53,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:53,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:53,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:11:53,288 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:11:53,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 292085547, now seen corresponding path program 1 times [2023-08-26 18:11:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604004459] [2023-08-26 18:11:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:53,487 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:11:53,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:53,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604004459] [2023-08-26 18:11:53,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604004459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:53,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:53,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:11:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990659752] [2023-08-26 18:11:53,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:53,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:11:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:11:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:11:53,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-08-26 18:11:53,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:53,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-08-26 18:11:53,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:53,832 INFO L124 PetriNetUnfolderBase]: 1562/2388 cut-off events. [2023-08-26 18:11:53,832 INFO L125 PetriNetUnfolderBase]: For 3030/3030 co-relation queries the response was YES. [2023-08-26 18:11:53,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7558 conditions, 2388 events. 1562/2388 cut-off events. For 3030/3030 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 10901 event pairs, 146 based on Foata normal form. 10/2398 useless extension candidates. Maximal degree in co-relation 7549. Up to 1283 conditions per place. [2023-08-26 18:11:53,846 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 75 selfloop transitions, 10 changer transitions 29/114 dead transitions. [2023-08-26 18:11:53,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 114 transitions, 800 flow [2023-08-26 18:11:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:11:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:11:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 781 transitions. [2023-08-26 18:11:53,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648809523809524 [2023-08-26 18:11:53,849 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 781 transitions. [2023-08-26 18:11:53,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 781 transitions. [2023-08-26 18:11:53,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:53,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 781 transitions. [2023-08-26 18:11:53,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,854 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,854 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 206 flow. Second operand 6 states and 781 transitions. [2023-08-26 18:11:53,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 114 transitions, 800 flow [2023-08-26 18:11:53,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 114 transitions, 684 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-08-26 18:11:53,878 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 225 flow [2023-08-26 18:11:53,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-08-26 18:11:53,878 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-26 18:11:53,878 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 225 flow [2023-08-26 18:11:53,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:53,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:53,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:11:53,879 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:11:53,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2036354031, now seen corresponding path program 2 times [2023-08-26 18:11:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:53,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88043989] [2023-08-26 18:11:53,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:54,059 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:11:54,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:54,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88043989] [2023-08-26 18:11:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88043989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:54,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:54,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:11:54,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397975328] [2023-08-26 18:11:54,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:54,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:11:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:54,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:11:54,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:11:54,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 280 [2023-08-26 18:11:54,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:54,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:54,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 280 [2023-08-26 18:11:54,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:54,367 INFO L124 PetriNetUnfolderBase]: 1481/2389 cut-off events. [2023-08-26 18:11:54,367 INFO L125 PetriNetUnfolderBase]: For 2549/2565 co-relation queries the response was YES. [2023-08-26 18:11:54,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8055 conditions, 2389 events. 1481/2389 cut-off events. For 2549/2565 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12407 event pairs, 235 based on Foata normal form. 14/2401 useless extension candidates. Maximal degree in co-relation 8044. Up to 1243 conditions per place. [2023-08-26 18:11:54,384 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 60 selfloop transitions, 2 changer transitions 28/94 dead transitions. [2023-08-26 18:11:54,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 94 transitions, 659 flow [2023-08-26 18:11:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:11:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:11:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-26 18:11:54,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2023-08-26 18:11:54,386 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-26 18:11:54,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-26 18:11:54,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:54,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-26 18:11:54,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:54,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:54,391 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:54,391 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 225 flow. Second operand 4 states and 539 transitions. [2023-08-26 18:11:54,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 94 transitions, 659 flow [2023-08-26 18:11:54,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 659 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:11:54,408 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 237 flow [2023-08-26 18:11:54,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-26 18:11:54,410 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2023-08-26 18:11:54,410 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 237 flow [2023-08-26 18:11:54,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:54,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:54,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:54,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:11:54,411 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:11:54,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1305688541, now seen corresponding path program 3 times [2023-08-26 18:11:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:54,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171768079] [2023-08-26 18:11:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:54,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:54,650 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:11:54,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171768079] [2023-08-26 18:11:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171768079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:54,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:54,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:11:54,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411946882] [2023-08-26 18:11:54,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:54,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:11:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:54,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:11:54,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:11:54,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 280 [2023-08-26 18:11:54,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 237 flow. Second operand has 7 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:11:54,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:54,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 280 [2023-08-26 18:11:54,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:54,986 INFO L124 PetriNetUnfolderBase]: 1223/1994 cut-off events. [2023-08-26 18:11:54,987 INFO L125 PetriNetUnfolderBase]: For 2788/2919 co-relation queries the response was YES. [2023-08-26 18:11:54,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6860 conditions, 1994 events. 1223/1994 cut-off events. For 2788/2919 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10637 event pairs, 192 based on Foata normal form. 121/2048 useless extension candidates. Maximal degree in co-relation 6846. Up to 702 conditions per place. [2023-08-26 18:11:54,995 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 47 selfloop transitions, 18 changer transitions 10/79 dead transitions. [2023-08-26 18:11:54,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 504 flow [2023-08-26 18:11:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:11:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:11:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2023-08-26 18:11:54,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2023-08-26 18:11:54,998 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2023-08-26 18:11:54,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2023-08-26 18:11:54,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:54,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2023-08-26 18:11:55,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:55,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:55,004 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:55,004 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 237 flow. Second operand 7 states and 903 transitions. [2023-08-26 18:11:55,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 504 flow [2023-08-26 18:11:55,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 491 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:11:55,031 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 247 flow [2023-08-26 18:11:55,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2023-08-26 18:11:55,031 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2023-08-26 18:11:55,032 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 247 flow [2023-08-26 18:11:55,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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:11:55,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:55,032 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:11:55,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:11:55,033 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:11:55,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -958589439, now seen corresponding path program 1 times [2023-08-26 18:11:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614944138] [2023-08-26 18:11:55,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:55,202 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:11:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:55,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614944138] [2023-08-26 18:11:55,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614944138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:55,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:55,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:11:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144350600] [2023-08-26 18:11:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:55,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:11:55,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:55,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:11:55,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:11:55,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 280 [2023-08-26 18:11:55,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:55,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:55,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 280 [2023-08-26 18:11:55,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:55,409 INFO L124 PetriNetUnfolderBase]: 818/1383 cut-off events. [2023-08-26 18:11:55,409 INFO L125 PetriNetUnfolderBase]: For 2887/2887 co-relation queries the response was YES. [2023-08-26 18:11:55,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5172 conditions, 1383 events. 818/1383 cut-off events. For 2887/2887 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6670 event pairs, 220 based on Foata normal form. 1/1368 useless extension candidates. Maximal degree in co-relation 5157. Up to 825 conditions per place. [2023-08-26 18:11:55,415 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 36 selfloop transitions, 1 changer transitions 44/83 dead transitions. [2023-08-26 18:11:55,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 700 flow [2023-08-26 18:11:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:11:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:11:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-26 18:11:55,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48035714285714287 [2023-08-26 18:11:55,417 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-26 18:11:55,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-26 18:11:55,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:55,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-26 18:11:55,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:55,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:55,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:55,422 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 247 flow. Second operand 4 states and 538 transitions. [2023-08-26 18:11:55,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 700 flow [2023-08-26 18:11:55,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 467 flow, removed 36 selfloop flow, removed 13 redundant places. [2023-08-26 18:11:55,437 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 141 flow [2023-08-26 18:11:55,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-26 18:11:55,438 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-26 18:11:55,439 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 141 flow [2023-08-26 18:11:55,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:55,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:55,439 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:11:55,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:11:55,439 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:11:55,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:55,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1828582075, now seen corresponding path program 2 times [2023-08-26 18:11:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:55,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28164681] [2023-08-26 18:11:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:55,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:11:56,709 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:11:56,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:11:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28164681] [2023-08-26 18:11:56,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28164681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:11:56,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:11:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:11:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801309647] [2023-08-26 18:11:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:11:56,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:11:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:11:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:11:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:11:56,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-08-26 18:11:56,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:56,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:11:56,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-08-26 18:11:56,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:11:56,987 INFO L124 PetriNetUnfolderBase]: 396/706 cut-off events. [2023-08-26 18:11:56,988 INFO L125 PetriNetUnfolderBase]: For 663/663 co-relation queries the response was YES. [2023-08-26 18:11:56,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 706 events. 396/706 cut-off events. For 663/663 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3275 event pairs, 66 based on Foata normal form. 1/666 useless extension candidates. Maximal degree in co-relation 2106. Up to 299 conditions per place. [2023-08-26 18:11:56,990 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 39 selfloop transitions, 4 changer transitions 28/74 dead transitions. [2023-08-26 18:11:56,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 433 flow [2023-08-26 18:11:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:11:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:11:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-26 18:11:56,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-26 18:11:56,993 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-26 18:11:56,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-26 18:11:56,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:11:56,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-26 18:11:56,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:56,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:56,999 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:56,999 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 141 flow. Second operand 7 states and 840 transitions. [2023-08-26 18:11:56,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 433 flow [2023-08-26 18:11:57,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 418 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 18:11:57,001 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 145 flow [2023-08-26 18:11:57,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-08-26 18:11:57,001 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2023-08-26 18:11:57,002 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 145 flow [2023-08-26 18:11:57,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:11:57,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:11:57,002 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:11:57,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:11:57,003 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:11:57,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:11:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1764279997, now seen corresponding path program 3 times [2023-08-26 18:11:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:11:57,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413411681] [2023-08-26 18:11:57,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:11:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:11:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:11:57,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:11:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:11:57,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:11:57,105 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:11:57,106 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:11:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:11:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:11:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:11:57,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:11:57,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:11:57,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:11:57,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:11:57,109 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-08-26 18:11:57,114 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:11:57,114 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:11:57,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:11:57 BasicIcfg [2023-08-26 18:11:57,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:11:57,203 INFO L158 Benchmark]: Toolchain (without parser) took 13768.27ms. Allocated memory was 371.2MB in the beginning and 645.9MB in the end (delta: 274.7MB). Free memory was 345.3MB in the beginning and 481.1MB in the end (delta: -135.7MB). Peak memory consumption was 141.4MB. Max. memory is 16.0GB. [2023-08-26 18:11:57,204 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 371.2MB. Free memory was 348.1MB in the beginning and 348.1MB in the end (delta: 23.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:11:57,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.47ms. Allocated memory is still 371.2MB. Free memory was 344.6MB in the beginning and 320.7MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:11:57,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.11ms. Allocated memory is still 371.2MB. Free memory was 320.7MB in the beginning and 317.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:11:57,204 INFO L158 Benchmark]: Boogie Preprocessor took 40.70ms. Allocated memory is still 371.2MB. Free memory was 317.6MB in the beginning and 315.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:11:57,204 INFO L158 Benchmark]: RCFGBuilder took 736.36ms. Allocated memory is still 371.2MB. Free memory was 315.6MB in the beginning and 272.4MB in the end (delta: 43.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-26 18:11:57,205 INFO L158 Benchmark]: TraceAbstraction took 12312.61ms. Allocated memory was 371.2MB in the beginning and 645.9MB in the end (delta: 274.7MB). Free memory was 272.4MB in the beginning and 481.1MB in the end (delta: -208.6MB). Peak memory consumption was 68.0MB. Max. memory is 16.0GB. [2023-08-26 18:11:57,206 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.14ms. Allocated memory is still 371.2MB. Free memory was 348.1MB in the beginning and 348.1MB in the end (delta: 23.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 595.47ms. Allocated memory is still 371.2MB. Free memory was 344.6MB in the beginning and 320.7MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 76.11ms. Allocated memory is still 371.2MB. Free memory was 320.7MB in the beginning and 317.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.70ms. Allocated memory is still 371.2MB. Free memory was 317.6MB in the beginning and 315.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 736.36ms. Allocated memory is still 371.2MB. Free memory was 315.6MB in the beginning and 272.4MB in the end (delta: 43.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 12312.61ms. Allocated memory was 371.2MB in the beginning and 645.9MB in the end (delta: 274.7MB). Free memory was 272.4MB in the beginning and 481.1MB in the end (delta: -208.6MB). Peak memory consumption was 68.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 147 PlacesBefore, 48 PlacesAfterwards, 137 TransitionsBefore, 36 TransitionsAfterwards, 3078 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 7251 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3668, independent: 3477, independent conditional: 0, independent unconditional: 3477, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1738, independent: 1698, independent conditional: 0, independent unconditional: 1698, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3668, independent: 1779, independent conditional: 0, independent unconditional: 1779, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 1738, unknown conditional: 0, unknown unconditional: 1738] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-3, t445={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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-2, t445={5:0}, t446={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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=-1, t445={5:0}, t446={6:0}, t447={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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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$$choice2=1, 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] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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$$choice2=1, 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] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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$$choice2=1, 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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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$$choice2=1, 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] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L844] 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) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 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 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=1, 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] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, 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] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, 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] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 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", "mix017_pso.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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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: 871]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 873]: 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, 174 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: 12.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 888 IncrementalHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 8 mSDtfsCounter, 888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:11:57,228 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...