/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 -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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 11:59:26,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 11:59:26,211 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 11:59:26,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 11:59:26,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 11:59:26,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 11:59:26,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 11:59:26,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 11:59:26,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 11:59:26,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 11:59:26,242 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 11:59:26,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 11:59:26,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 11:59:26,243 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 11:59:26,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 11:59:26,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 11:59:26,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 11:59:26,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 11:59:26,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 11:59:26,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 11:59:26,244 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 11:59:26,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 11:59:26,245 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 11:59:26,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 11:59:26,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 11:59:26,245 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 11:59:26,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 11:59:26,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:59:26,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 11:59:26,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 11:59:26,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 11:59:26,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 11:59:26,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 11:59:26,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 11:59:26,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 11:59:26,247 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.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 11:59:26,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 11:59:26,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 11:59:26,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 11:59:26,524 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 11:59:26,524 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 11:59:26,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-26 11:59:27,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 11:59:27,674 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 11:59:27,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-26 11:59:27,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23adb5f5f/7b123af6289d49c4a7679c92abe0d6f5/FLAGa1111ab38 [2023-08-26 11:59:27,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23adb5f5f/7b123af6289d49c4a7679c92abe0d6f5 [2023-08-26 11:59:27,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 11:59:27,700 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 11:59:27,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 11:59:27,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 11:59:27,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 11:59:27,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:59:27" (1/1) ... [2023-08-26 11:59:27,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703fe0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:27, skipping insertion in model container [2023-08-26 11:59:27,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:59:27" (1/1) ... [2023-08-26 11:59:27,730 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 11:59:28,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:59:28,012 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 11:59:28,034 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 11:59:28,035 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 11:59:28,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:59:28,093 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 11:59:28,093 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 11:59:28,097 INFO L206 MainTranslator]: Completed translation [2023-08-26 11:59:28,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28 WrapperNode [2023-08-26 11:59:28,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 11:59:28,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 11:59:28,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 11:59:28,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 11:59:28,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,127 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2023-08-26 11:59:28,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 11:59:28,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 11:59:28,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 11:59:28,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 11:59:28,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 11:59:28,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 11:59:28,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 11:59:28,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 11:59:28,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (1/1) ... [2023-08-26 11:59:28,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:59:28,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:59:28,210 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 11:59:28,216 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 11:59:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 11:59:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 11:59:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 11:59:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 11:59:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 11:59:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 11:59:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 11:59:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 11:59:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 11:59:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 11:59:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 11:59:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 11:59:28,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 11:59:28,236 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 11:59:28,357 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 11:59:28,358 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 11:59:28,532 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 11:59:28,667 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 11:59:28,668 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 11:59:28,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:59:28 BoogieIcfgContainer [2023-08-26 11:59:28,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 11:59:28,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 11:59:28,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 11:59:28,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 11:59:28,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:59:27" (1/3) ... [2023-08-26 11:59:28,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1815ab0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:59:28, skipping insertion in model container [2023-08-26 11:59:28,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:59:28" (2/3) ... [2023-08-26 11:59:28,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1815ab0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:59:28, skipping insertion in model container [2023-08-26 11:59:28,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:59:28" (3/3) ... [2023-08-26 11:59:28,676 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-08-26 11:59:28,686 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 11:59:28,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 11:59:28,686 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 11:59:28,729 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 11:59:28,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 98 transitions, 206 flow [2023-08-26 11:59:28,799 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-08-26 11:59:28,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:28,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 11:59:28,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 98 transitions, 206 flow [2023-08-26 11:59:28,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 96 transitions, 198 flow [2023-08-26 11:59:28,809 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 11:59:28,820 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 96 transitions, 198 flow [2023-08-26 11:59:28,822 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 96 transitions, 198 flow [2023-08-26 11:59:28,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 198 flow [2023-08-26 11:59:28,848 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-08-26 11:59:28,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:28,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 11:59:28,850 INFO L119 LiptonReduction]: Number of co-enabled transitions 1264 [2023-08-26 11:59:31,470 INFO L134 LiptonReduction]: Checked pairs total: 3860 [2023-08-26 11:59:31,470 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-26 11:59:31,478 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 11:59:31,482 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;@7f6a6dc6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 11:59:31,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 11:59:31,483 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 11:59:31,483 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 11:59:31,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:31,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:31,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 11:59:31,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 11:59:31,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash 466, now seen corresponding path program 1 times [2023-08-26 11:59:31,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477470506] [2023-08-26 11:59:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477470506] [2023-08-26 11:59:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477470506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:31,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 11:59:31,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421723132] [2023-08-26 11:59:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:31,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 11:59:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:31,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 11:59:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 11:59:31,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 202 [2023-08-26 11:59:31,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:31,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 202 [2023-08-26 11:59:31,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:31,653 INFO L124 PetriNetUnfolderBase]: 184/325 cut-off events. [2023-08-26 11:59:31,653 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 11:59:31,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 325 events. 184/325 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1246 event pairs, 184 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 651. Up to 321 conditions per place. [2023-08-26 11:59:31,656 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-08-26 11:59:31,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 74 flow [2023-08-26 11:59:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 11:59:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 11:59:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2023-08-26 11:59:31,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777227722772277 [2023-08-26 11:59:31,664 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions. [2023-08-26 11:59:31,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions. [2023-08-26 11:59:31,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:31,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions. [2023-08-26 11:59:31,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,671 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,672 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 2 states and 193 transitions. [2023-08-26 11:59:31,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 74 flow [2023-08-26 11:59:31,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:59:31,674 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-08-26 11:59:31,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-26 11:59:31,677 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-08-26 11:59:31,678 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-08-26 11:59:31,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:31,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 11:59:31,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 11:59:31,678 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 11:59:31,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash 456622, now seen corresponding path program 1 times [2023-08-26 11:59:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:31,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474611847] [2023-08-26 11:59:31,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:59:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474611847] [2023-08-26 11:59:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474611847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:59:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860356643] [2023-08-26 11:59:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:31,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:59:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:59:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:59:31,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 202 [2023-08-26 11:59:31,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:31,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 202 [2023-08-26 11:59:31,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:31,953 INFO L124 PetriNetUnfolderBase]: 142/279 cut-off events. [2023-08-26 11:59:31,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:31,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 279 events. 142/279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1212 event pairs, 16 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 540. Up to 208 conditions per place. [2023-08-26 11:59:31,955 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 21 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2023-08-26 11:59:31,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 27 transitions, 110 flow [2023-08-26 11:59:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:59:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:59:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-08-26 11:59:31,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636963696369637 [2023-08-26 11:59:31,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-08-26 11:59:31,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-08-26 11:59:31,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:31,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-08-26 11:59:31,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,960 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 281 transitions. [2023-08-26 11:59:31,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 27 transitions, 110 flow [2023-08-26 11:59:31,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 11:59:31,961 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-26 11:59:31,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-26 11:59:31,961 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-08-26 11:59:31,961 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-26 11:59:31,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:31,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:31,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:31,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 11:59:31,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 11:59:31,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:31,962 INFO L85 PathProgramCache]: Analyzing trace with hash 845045590, now seen corresponding path program 1 times [2023-08-26 11:59:31,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:31,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845236938] [2023-08-26 11:59:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:31,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:32,064 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 11:59:32,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:32,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845236938] [2023-08-26 11:59:32,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845236938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:32,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:32,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:59:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379343809] [2023-08-26 11:59:32,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:32,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:59:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:59:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:59:32,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 202 [2023-08-26 11:59:32,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:32,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 202 [2023-08-26 11:59:32,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,110 INFO L124 PetriNetUnfolderBase]: 121/219 cut-off events. [2023-08-26 11:59:32,110 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 11:59:32,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 219 events. 121/219 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 725 event pairs, 41 based on Foata normal form. 8/226 useless extension candidates. Maximal degree in co-relation 472. Up to 157 conditions per place. [2023-08-26 11:59:32,112 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-26 11:59:32,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 92 flow [2023-08-26 11:59:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:59:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:59:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2023-08-26 11:59:32,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44554455445544555 [2023-08-26 11:59:32,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2023-08-26 11:59:32,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2023-08-26 11:59:32,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2023-08-26 11:59:32,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,116 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 3 states and 270 transitions. [2023-08-26 11:59:32,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 92 flow [2023-08-26 11:59:32,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:59:32,117 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 44 flow [2023-08-26 11:59:32,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-26 11:59:32,117 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-08-26 11:59:32,117 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 44 flow [2023-08-26 11:59:32,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:32,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:32,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 11:59:32,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 11:59:32,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash 324121102, now seen corresponding path program 1 times [2023-08-26 11:59:32,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:32,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478442511] [2023-08-26 11:59:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:32,223 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 11:59:32,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:32,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478442511] [2023-08-26 11:59:32,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478442511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:32,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:32,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:59:32,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367150703] [2023-08-26 11:59:32,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:32,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:59:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:32,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:59:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:59:32,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-08-26 11:59:32,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:32,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-08-26 11:59:32,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,295 INFO L124 PetriNetUnfolderBase]: 61/137 cut-off events. [2023-08-26 11:59:32,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:59:32,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 137 events. 61/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 475 event pairs, 27 based on Foata normal form. 20/153 useless extension candidates. Maximal degree in co-relation 294. Up to 58 conditions per place. [2023-08-26 11:59:32,296 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 26 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2023-08-26 11:59:32,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 142 flow [2023-08-26 11:59:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 11:59:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 11:59:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 353 transitions. [2023-08-26 11:59:32,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4368811881188119 [2023-08-26 11:59:32,297 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 353 transitions. [2023-08-26 11:59:32,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 353 transitions. [2023-08-26 11:59:32,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 353 transitions. [2023-08-26 11:59:32,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,300 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,300 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 44 flow. Second operand 4 states and 353 transitions. [2023-08-26 11:59:32,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 142 flow [2023-08-26 11:59:32,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:59:32,301 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 66 flow [2023-08-26 11:59:32,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-26 11:59:32,302 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-08-26 11:59:32,302 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 66 flow [2023-08-26 11:59:32,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:32,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:32,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 11:59:32,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 11:59:32,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1189703107, now seen corresponding path program 1 times [2023-08-26 11:59:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546731225] [2023-08-26 11:59:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:32,477 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 11:59:32,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:32,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546731225] [2023-08-26 11:59:32,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546731225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:32,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332216695] [2023-08-26 11:59:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:32,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:59:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:32,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:59:32,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:59:32,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-08-26 11:59:32,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:32,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-08-26 11:59:32,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,538 INFO L124 PetriNetUnfolderBase]: 24/68 cut-off events. [2023-08-26 11:59:32,541 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 11:59:32,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 68 events. 24/68 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 187. Up to 29 conditions per place. [2023-08-26 11:59:32,541 INFO L140 encePairwiseOnDemand]: 197/202 looper letters, 17 selfloop transitions, 6 changer transitions 1/26 dead transitions. [2023-08-26 11:59:32,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 135 flow [2023-08-26 11:59:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:59:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:59:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 426 transitions. [2023-08-26 11:59:32,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42178217821782177 [2023-08-26 11:59:32,543 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 426 transitions. [2023-08-26 11:59:32,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 426 transitions. [2023-08-26 11:59:32,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 426 transitions. [2023-08-26 11:59:32,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,546 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,546 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 66 flow. Second operand 5 states and 426 transitions. [2023-08-26 11:59:32,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 135 flow [2023-08-26 11:59:32,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 122 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 11:59:32,547 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 78 flow [2023-08-26 11:59:32,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2023-08-26 11:59:32,547 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-26 11:59:32,547 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 78 flow [2023-08-26 11:59:32,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:32,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:32,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 11:59:32,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 11:59:32,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:32,548 INFO L85 PathProgramCache]: Analyzing trace with hash 222602317, now seen corresponding path program 1 times [2023-08-26 11:59:32,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:32,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339360090] [2023-08-26 11:59:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:32,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:32,854 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 11:59:32,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339360090] [2023-08-26 11:59:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339360090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:59:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229631744] [2023-08-26 11:59:32,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:32,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:59:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:59:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:59:32,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-08-26 11:59:32,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:32,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-08-26 11:59:32,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:32,950 INFO L124 PetriNetUnfolderBase]: 23/81 cut-off events. [2023-08-26 11:59:32,951 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-26 11:59:32,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 81 events. 23/81 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 251 event pairs, 0 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 247. Up to 29 conditions per place. [2023-08-26 11:59:32,951 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 24 selfloop transitions, 6 changer transitions 12/44 dead transitions. [2023-08-26 11:59:32,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 298 flow [2023-08-26 11:59:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:59:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:59:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-08-26 11:59:32,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265676567656766 [2023-08-26 11:59:32,953 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-08-26 11:59:32,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-08-26 11:59:32,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:32,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-08-26 11:59:32,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,956 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,956 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 78 flow. Second operand 6 states and 517 transitions. [2023-08-26 11:59:32,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 298 flow [2023-08-26 11:59:32,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 44 transitions, 206 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-08-26 11:59:32,962 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 89 flow [2023-08-26 11:59:32,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2023-08-26 11:59:32,964 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-26 11:59:32,966 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 89 flow [2023-08-26 11:59:32,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:32,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:32,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:32,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 11:59:32,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 11:59:32,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash -260882535, now seen corresponding path program 2 times [2023-08-26 11:59:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:32,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729887306] [2023-08-26 11:59:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:59:33,111 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 11:59:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:59:33,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729887306] [2023-08-26 11:59:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729887306] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:59:33,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:59:33,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:59:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685006265] [2023-08-26 11:59:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:59:33,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:59:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:59:33,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:59:33,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:59:33,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 202 [2023-08-26 11:59:33,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:33,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:59:33,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 202 [2023-08-26 11:59:33,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:59:33,183 INFO L124 PetriNetUnfolderBase]: 37/111 cut-off events. [2023-08-26 11:59:33,184 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-08-26 11:59:33,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 111 events. 37/111 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 365 event pairs, 12 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 321. Up to 44 conditions per place. [2023-08-26 11:59:33,184 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 17 selfloop transitions, 1 changer transitions 21/39 dead transitions. [2023-08-26 11:59:33,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 232 flow [2023-08-26 11:59:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 11:59:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 11:59:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2023-08-26 11:59:33,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4319306930693069 [2023-08-26 11:59:33,185 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 349 transitions. [2023-08-26 11:59:33,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 349 transitions. [2023-08-26 11:59:33,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:59:33,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 349 transitions. [2023-08-26 11:59:33,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:33,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:33,187 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:33,187 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 89 flow. Second operand 4 states and 349 transitions. [2023-08-26 11:59:33,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 232 flow [2023-08-26 11:59:33,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 11:59:33,188 INFO L231 Difference]: Finished difference. Result has 34 places, 18 transitions, 67 flow [2023-08-26 11:59:33,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=34, PETRI_TRANSITIONS=18} [2023-08-26 11:59:33,189 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-08-26 11:59:33,189 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 67 flow [2023-08-26 11:59:33,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:59:33,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:59:33,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:59:33,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 11:59:33,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 11:59:33,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:59:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 660698991, now seen corresponding path program 3 times [2023-08-26 11:59:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:59:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263531276] [2023-08-26 11:59:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:59:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:59:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:59:33,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 11:59:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:59:33,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 11:59:33,259 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 11:59:33,260 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 11:59:33,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 11:59:33,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 11:59:33,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 11:59:33,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 11:59:33,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 11:59:33,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 11:59:33,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 11:59:33,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 11:59:33,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 11:59:33,262 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-26 11:59:33,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 11:59:33,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 11:59:33,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:59:33 BasicIcfg [2023-08-26 11:59:33,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 11:59:33,294 INFO L158 Benchmark]: Toolchain (without parser) took 5593.37ms. Allocated memory was 369.1MB in the beginning and 467.7MB in the end (delta: 98.6MB). Free memory was 343.7MB in the beginning and 404.6MB in the end (delta: -60.9MB). Peak memory consumption was 39.5MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,294 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 369.1MB. Free memory was 346.1MB in the beginning and 346.1MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:59:33,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.10ms. Allocated memory is still 369.1MB. Free memory was 343.7MB in the beginning and 321.0MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.74ms. Allocated memory is still 369.1MB. Free memory was 321.0MB in the beginning and 318.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,295 INFO L158 Benchmark]: Boogie Preprocessor took 27.48ms. Allocated memory is still 369.1MB. Free memory was 318.6MB in the beginning and 316.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,295 INFO L158 Benchmark]: RCFGBuilder took 513.58ms. Allocated memory is still 369.1MB. Free memory was 316.8MB in the beginning and 337.6MB in the end (delta: -20.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,295 INFO L158 Benchmark]: TraceAbstraction took 4622.25ms. Allocated memory was 369.1MB in the beginning and 467.7MB in the end (delta: 98.6MB). Free memory was 336.7MB in the beginning and 404.6MB in the end (delta: -67.8MB). Peak memory consumption was 33.5MB. Max. memory is 16.0GB. [2023-08-26 11:59:33,296 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.09ms. Allocated memory is still 369.1MB. Free memory was 346.1MB in the beginning and 346.1MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 397.10ms. Allocated memory is still 369.1MB. Free memory was 343.7MB in the beginning and 321.0MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.74ms. Allocated memory is still 369.1MB. Free memory was 321.0MB in the beginning and 318.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.48ms. Allocated memory is still 369.1MB. Free memory was 318.6MB in the beginning and 316.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 513.58ms. Allocated memory is still 369.1MB. Free memory was 316.8MB in the beginning and 337.6MB in the end (delta: -20.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 4622.25ms. Allocated memory was 369.1MB in the beginning and 467.7MB in the end (delta: 98.6MB). Free memory was 336.7MB in the beginning and 404.6MB in the end (delta: -67.8MB). Peak memory consumption was 33.5MB. 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: 2.6s, 100 PlacesBefore, 29 PlacesAfterwards, 96 TransitionsBefore, 23 TransitionsAfterwards, 1264 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 3860 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1986, independent: 1827, independent conditional: 0, independent unconditional: 1827, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 762, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1986, independent: 1099, independent conditional: 0, independent unconditional: 1099, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 762, unknown conditional: 0, unknown unconditional: 762] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-2, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 pthread_t t306; [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=-1, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 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", "mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 815]: 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: 813]: 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 5 procedures, 116 locations, 9 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: 4.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 296 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2 mSDtfsCounter, 296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=6, InterpolantAutomatonStates: 27, 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.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 11:59:33,310 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...