/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:14:23,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:14:23,830 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 15:14:23,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:14:23,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:14:23,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:14:23,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:14:23,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:14:23,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:14:23,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:14:23,865 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:14:23,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:14:23,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:14:23,867 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:14:23,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:14:23,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:14:23,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:14:23,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:14:23,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:14:23,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:14:23,868 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:14:23,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:14:23,869 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:14:23,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:14:23,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:14:23,870 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:14:23,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:14:23,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:14:23,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:14:23,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:14:23,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:14:23,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:14:23,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:14:23,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:14:23,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:14:23,872 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:14:24,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:14:24,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:14:24,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:14:24,149 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:14:24,150 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:14:24,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 15:14:25,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:14:25,329 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:14:25,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 15:14:25,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24db1327/41fb37c876f946dfaaaad6fa769b50cb/FLAG10f846f7b [2023-08-26 15:14:25,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24db1327/41fb37c876f946dfaaaad6fa769b50cb [2023-08-26 15:14:25,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:14:25,354 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:14:25,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:14:25,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:14:25,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:14:25,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6966e7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25, skipping insertion in model container [2023-08-26 15:14:25,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,401 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:14:25,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:14:25,695 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:14:25,716 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:14:25,717 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:14:25,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:14:25,779 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:14:25,780 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:14:25,785 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:14:25,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25 WrapperNode [2023-08-26 15:14:25,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:14:25,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:14:25,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:14:25,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:14:25,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,838 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2023-08-26 15:14:25,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:14:25,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:14:25,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:14:25,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:14:25,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:14:25,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:14:25,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:14:25,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:14:25,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (1/1) ... [2023-08-26 15:14:25,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:14:25,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:14:25,942 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 15:14:25,950 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 15:14:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:14:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:14:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:14:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:14:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:14:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:14:25,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:14:25,972 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:14:25,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:14:25,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:14:25,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:14:25,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:14:25,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:14:25,973 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 15:14:26,089 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:14:26,091 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:14:26,276 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:14:26,443 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:14:26,444 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:14:26,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:14:26 BoogieIcfgContainer [2023-08-26 15:14:26,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:14:26,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:14:26,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:14:26,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:14:26,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:14:25" (1/3) ... [2023-08-26 15:14:26,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107f8322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:14:26, skipping insertion in model container [2023-08-26 15:14:26,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:14:25" (2/3) ... [2023-08-26 15:14:26,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107f8322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:14:26, skipping insertion in model container [2023-08-26 15:14:26,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:14:26" (3/3) ... [2023-08-26 15:14:26,451 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 15:14:26,464 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:14:26,464 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 15:14:26,465 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:14:26,524 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:14:26,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 15:14:26,603 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 15:14:26,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:26,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-26 15:14:26,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 15:14:26,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 200 flow [2023-08-26 15:14:26,614 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:14:26,629 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 15:14:26,631 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 15:14:26,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 200 flow [2023-08-26 15:14:26,661 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 15:14:26,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:26,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-26 15:14:26,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 1342 [2023-08-26 15:14:29,131 INFO L134 LiptonReduction]: Checked pairs total: 3558 [2023-08-26 15:14:29,132 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-26 15:14:29,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:14:29,153 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;@213a1c35, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:14:29,154 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 15:14:29,154 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:14:29,155 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:14:29,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:29,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:29,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:14:29,156 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 15:14:29,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash 465, now seen corresponding path program 1 times [2023-08-26 15:14:29,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:29,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486427573] [2023-08-26 15:14:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:29,255 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 15:14:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486427573] [2023-08-26 15:14:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486427573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:29,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:29,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:14:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796883138] [2023-08-26 15:14:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:29,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:14:29,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:29,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:14:29,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:14:29,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-08-26 15:14:29,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:29,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-08-26 15:14:29,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:29,417 INFO L124 PetriNetUnfolderBase]: 264/464 cut-off events. [2023-08-26 15:14:29,417 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 15:14:29,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 464 events. 264/464 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1927 event pairs, 264 based on Foata normal form. 25/397 useless extension candidates. Maximal degree in co-relation 920. Up to 451 conditions per place. [2023-08-26 15:14:29,423 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2023-08-26 15:14:29,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 82 flow [2023-08-26 15:14:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:14:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:14:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2023-08-26 15:14:29,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4949748743718593 [2023-08-26 15:14:29,436 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2023-08-26 15:14:29,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2023-08-26 15:14:29,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:29,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2023-08-26 15:14:29,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,448 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,449 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 2 states and 197 transitions. [2023-08-26 15:14:29,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 82 flow [2023-08-26 15:14:29,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:29,452 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 44 flow [2023-08-26 15:14:29,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2023-08-26 15:14:29,456 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -5 predicate places. [2023-08-26 15:14:29,456 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 44 flow [2023-08-26 15:14:29,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:29,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:14:29,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:14:29,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:14:29,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 459600, now seen corresponding path program 1 times [2023-08-26 15:14:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987185302] [2023-08-26 15:14:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:29,669 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 15:14:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:29,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987185302] [2023-08-26 15:14:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987185302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:29,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:29,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:14:29,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234828422] [2023-08-26 15:14:29,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:29,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:14:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:29,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:14:29,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:14:29,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 199 [2023-08-26 15:14:29,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:29,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 199 [2023-08-26 15:14:29,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:29,768 INFO L124 PetriNetUnfolderBase]: 204/393 cut-off events. [2023-08-26 15:14:29,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:14:29,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 393 events. 204/393 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1812 event pairs, 24 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 756. Up to 292 conditions per place. [2023-08-26 15:14:29,770 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 23 selfloop transitions, 2 changer transitions 4/31 dead transitions. [2023-08-26 15:14:29,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 126 flow [2023-08-26 15:14:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:14:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:14:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-26 15:14:29,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824120603015075 [2023-08-26 15:14:29,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-26 15:14:29,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-26 15:14:29,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:29,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-26 15:14:29,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,775 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 44 flow. Second operand 3 states and 288 transitions. [2023-08-26 15:14:29,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 126 flow [2023-08-26 15:14:29,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:14:29,776 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 42 flow [2023-08-26 15:14:29,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2023-08-26 15:14:29,777 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-26 15:14:29,777 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 42 flow [2023-08-26 15:14:29,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:29,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:29,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:29,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:14:29,777 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 15:14:29,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash -97110296, now seen corresponding path program 1 times [2023-08-26 15:14:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001359034] [2023-08-26 15:14:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:29,919 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 15:14:29,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:29,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001359034] [2023-08-26 15:14:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001359034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:29,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:29,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:14:29,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817216394] [2023-08-26 15:14:29,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:29,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:29,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:29,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:29,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 199 [2023-08-26 15:14:29,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 42 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 15:14:29,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:29,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 199 [2023-08-26 15:14:29,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:30,006 INFO L124 PetriNetUnfolderBase]: 167/306 cut-off events. [2023-08-26 15:14:30,007 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-26 15:14:30,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 306 events. 167/306 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1147 event pairs, 53 based on Foata normal form. 24/329 useless extension candidates. Maximal degree in co-relation 655. Up to 197 conditions per place. [2023-08-26 15:14:30,008 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 19 selfloop transitions, 2 changer transitions 12/34 dead transitions. [2023-08-26 15:14:30,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 148 flow [2023-08-26 15:14:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:14:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:14:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2023-08-26 15:14:30,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472361809045226 [2023-08-26 15:14:30,010 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 445 transitions. [2023-08-26 15:14:30,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 445 transitions. [2023-08-26 15:14:30,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:30,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 445 transitions. [2023-08-26 15:14:30,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,013 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,013 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 42 flow. Second operand 5 states and 445 transitions. [2023-08-26 15:14:30,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 148 flow [2023-08-26 15:14:30,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:14:30,014 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 50 flow [2023-08-26 15:14:30,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, 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=5, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2023-08-26 15:14:30,015 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-26 15:14:30,015 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 50 flow [2023-08-26 15:14:30,015 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 15:14:30,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:30,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:30,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:14:30,015 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 15:14:30,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1172656127, now seen corresponding path program 1 times [2023-08-26 15:14:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:30,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099935070] [2023-08-26 15:14:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:30,104 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 15:14:30,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099935070] [2023-08-26 15:14:30,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099935070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:30,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:30,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:14:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112593088] [2023-08-26 15:14:30,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:30,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:30,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-08-26 15:14:30,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:30,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-08-26 15:14:30,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:30,188 INFO L124 PetriNetUnfolderBase]: 67/151 cut-off events. [2023-08-26 15:14:30,188 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 15:14:30,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 151 events. 67/151 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 515 event pairs, 14 based on Foata normal form. 20/170 useless extension candidates. Maximal degree in co-relation 335. Up to 75 conditions per place. [2023-08-26 15:14:30,189 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 21 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-26 15:14:30,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 178 flow [2023-08-26 15:14:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:14:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:14:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 436 transitions. [2023-08-26 15:14:30,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4381909547738693 [2023-08-26 15:14:30,190 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 436 transitions. [2023-08-26 15:14:30,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 436 transitions. [2023-08-26 15:14:30,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:30,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 436 transitions. [2023-08-26 15:14:30,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,193 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,193 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 50 flow. Second operand 5 states and 436 transitions. [2023-08-26 15:14:30,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 178 flow [2023-08-26 15:14:30,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 170 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 15:14:30,195 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 69 flow [2023-08-26 15:14:30,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-08-26 15:14:30,196 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-26 15:14:30,196 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 69 flow [2023-08-26 15:14:30,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:30,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:30,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:14:30,197 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 15:14:30,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1956524548, now seen corresponding path program 1 times [2023-08-26 15:14:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:30,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320897431] [2023-08-26 15:14:30,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:30,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:30,382 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 15:14:30,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:30,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320897431] [2023-08-26 15:14:30,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320897431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:30,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:30,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:14:30,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045596902] [2023-08-26 15:14:30,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:30,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:14:30,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:30,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:14:30,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:14:30,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 199 [2023-08-26 15:14:30,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:30,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 199 [2023-08-26 15:14:30,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:30,453 INFO L124 PetriNetUnfolderBase]: 24/70 cut-off events. [2023-08-26 15:14:30,456 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-26 15:14:30,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 70 events. 24/70 cut-off events. For 17/17 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/77 useless extension candidates. Maximal degree in co-relation 186. Up to 29 conditions per place. [2023-08-26 15:14:30,457 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 19 selfloop transitions, 5 changer transitions 8/34 dead transitions. [2023-08-26 15:14:30,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 175 flow [2023-08-26 15:14:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:14:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:14:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2023-08-26 15:14:30,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42546063651591287 [2023-08-26 15:14:30,458 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2023-08-26 15:14:30,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2023-08-26 15:14:30,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:30,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2023-08-26 15:14:30,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,462 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,462 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 69 flow. Second operand 6 states and 508 transitions. [2023-08-26 15:14:30,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 175 flow [2023-08-26 15:14:30,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 158 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 15:14:30,465 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 76 flow [2023-08-26 15:14:30,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-08-26 15:14:30,467 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-26 15:14:30,467 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 76 flow [2023-08-26 15:14:30,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:30,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:30,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:14:30,468 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 15:14:30,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1152185758, now seen corresponding path program 1 times [2023-08-26 15:14:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:30,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997932816] [2023-08-26 15:14:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:30,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:30,841 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 15:14:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997932816] [2023-08-26 15:14:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997932816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:30,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:14:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195779085] [2023-08-26 15:14:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:30,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:14:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:14:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:14:30,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 199 [2023-08-26 15:14:30,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 79.14285714285714) internal successors, (554), 7 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:30,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 199 [2023-08-26 15:14:30,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:30,980 INFO L124 PetriNetUnfolderBase]: 19/69 cut-off events. [2023-08-26 15:14:30,980 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-26 15:14:30,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 69 events. 19/69 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 173 event pairs, 0 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 188. Up to 25 conditions per place. [2023-08-26 15:14:30,980 INFO L140 encePairwiseOnDemand]: 192/199 looper letters, 21 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2023-08-26 15:14:30,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 234 flow [2023-08-26 15:14:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:14:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:14:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 650 transitions. [2023-08-26 15:14:30,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4082914572864322 [2023-08-26 15:14:30,982 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 650 transitions. [2023-08-26 15:14:30,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 650 transitions. [2023-08-26 15:14:30,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:30,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 650 transitions. [2023-08-26 15:14:30,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 81.25) internal successors, (650), 8 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 199.0) internal successors, (1791), 9 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,999 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 199.0) internal successors, (1791), 9 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:30,999 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 76 flow. Second operand 8 states and 650 transitions. [2023-08-26 15:14:30,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 234 flow [2023-08-26 15:14:31,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 202 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 15:14:31,000 INFO L231 Difference]: Finished difference. Result has 37 places, 19 transitions, 76 flow [2023-08-26 15:14:31,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=19} [2023-08-26 15:14:31,001 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-26 15:14:31,001 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 76 flow [2023-08-26 15:14:31,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.14285714285714) internal successors, (554), 7 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:31,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:31,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:31,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:14:31,002 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 15:14:31,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1894106520, now seen corresponding path program 2 times [2023-08-26 15:14:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:31,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767203313] [2023-08-26 15:14:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:14:31,133 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 15:14:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:14:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767203313] [2023-08-26 15:14:31,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767203313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:14:31,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:14:31,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:14:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244061050] [2023-08-26 15:14:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:14:31,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:14:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:14:31,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:14:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:14:31,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 199 [2023-08-26 15:14:31,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 19 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:31,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:14:31,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 199 [2023-08-26 15:14:31,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:14:31,188 INFO L124 PetriNetUnfolderBase]: 25/85 cut-off events. [2023-08-26 15:14:31,188 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-26 15:14:31,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 85 events. 25/85 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 240 event pairs, 9 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 246. Up to 44 conditions per place. [2023-08-26 15:14:31,189 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 18 selfloop transitions, 2 changer transitions 11/32 dead transitions. [2023-08-26 15:14:31,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 192 flow [2023-08-26 15:14:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:14:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:14:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2023-08-26 15:14:31,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44221105527638194 [2023-08-26 15:14:31,191 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 352 transitions. [2023-08-26 15:14:31,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 352 transitions. [2023-08-26 15:14:31,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:14:31,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 352 transitions. [2023-08-26 15:14:31,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:31,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:31,193 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:31,194 INFO L175 Difference]: Start difference. First operand has 37 places, 19 transitions, 76 flow. Second operand 4 states and 352 transitions. [2023-08-26 15:14:31,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 192 flow [2023-08-26 15:14:31,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 174 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-26 15:14:31,197 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 74 flow [2023-08-26 15:14:31,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2023-08-26 15:14:31,197 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-26 15:14:31,197 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 74 flow [2023-08-26 15:14:31,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:14:31,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:14:31,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:14:31,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:14:31,199 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 15:14:31,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:14:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash -84021154, now seen corresponding path program 3 times [2023-08-26 15:14:31,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:14:31,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019125625] [2023-08-26 15:14:31,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:14:31,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:14:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:14:31,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:14:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:14:31,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:14:31,286 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:14:31,287 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 15:14:31,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 15:14:31,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 15:14:31,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 15:14:31,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 15:14:31,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 15:14:31,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 15:14:31,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 15:14:31,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 15:14:31,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:14:31,289 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-26 15:14:31,293 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:14:31,293 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:14:31,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:14:31 BasicIcfg [2023-08-26 15:14:31,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:14:31,348 INFO L158 Benchmark]: Toolchain (without parser) took 5993.76ms. Allocated memory was 358.6MB in the beginning and 438.3MB in the end (delta: 79.7MB). Free memory was 312.8MB in the beginning and 189.4MB in the end (delta: 123.3MB). Peak memory consumption was 204.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:31,348 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 358.6MB. Free memory is still 335.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:14:31,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.72ms. Allocated memory is still 358.6MB. Free memory was 312.8MB in the beginning and 289.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:31,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.34ms. Allocated memory is still 358.6MB. Free memory was 289.7MB in the beginning and 286.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:31,349 INFO L158 Benchmark]: Boogie Preprocessor took 33.06ms. Allocated memory is still 358.6MB. Free memory was 286.5MB in the beginning and 285.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:31,349 INFO L158 Benchmark]: RCFGBuilder took 556.83ms. Allocated memory is still 358.6MB. Free memory was 285.5MB in the beginning and 250.9MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-26 15:14:31,349 INFO L158 Benchmark]: TraceAbstraction took 4900.42ms. Allocated memory was 358.6MB in the beginning and 438.3MB in the end (delta: 79.7MB). Free memory was 249.8MB in the beginning and 189.4MB in the end (delta: 60.4MB). Peak memory consumption was 141.1MB. Max. memory is 16.0GB. [2023-08-26 15:14:31,351 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 358.6MB. Free memory is still 335.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 430.72ms. Allocated memory is still 358.6MB. Free memory was 312.8MB in the beginning and 289.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.34ms. Allocated memory is still 358.6MB. Free memory was 289.7MB in the beginning and 286.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.06ms. Allocated memory is still 358.6MB. Free memory was 286.5MB in the beginning and 285.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 556.83ms. Allocated memory is still 358.6MB. Free memory was 285.5MB in the beginning and 250.9MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 4900.42ms. Allocated memory was 358.6MB in the beginning and 438.3MB in the end (delta: 79.7MB). Free memory was 249.8MB in the beginning and 189.4MB in the end (delta: 60.4MB). Peak memory consumption was 141.1MB. 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.5s, 101 PlacesBefore, 31 PlacesAfterwards, 97 TransitionsBefore, 25 TransitionsAfterwards, 1342 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 3558 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2149, independent: 2012, independent conditional: 0, independent unconditional: 2012, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 773, independent: 753, independent conditional: 0, independent unconditional: 753, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2149, independent: 1259, independent conditional: 0, independent unconditional: 1259, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 773, unknown conditional: 0, unknown unconditional: 773] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1601; [L816] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1601, ((void *)0), P0, ((void *)0))=-1, t1601={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L817] 0 pthread_t t1602; [L740] 1 x$w_buff1 = x$w_buff0 [L741] 1 x$w_buff0 = 1 [L742] 1 x$w_buff1_used = x$w_buff0_used [L743] 1 x$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L745] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1602, ((void *)0), P1, ((void *)0))=0, t1601={5:0}, t1602={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L751] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L768] 2 y = 2 [L771] 2 z = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 x$flush_delayed = weak$$choice2 [L780] 2 x$mem_tmp = x [L781] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L783] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L784] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L785] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L787] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = x [L789] 2 x = x$flush_delayed ? x$mem_tmp : x [L790] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L825] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L826] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L827] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L828] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1601={5:0}, t1602={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L831] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] 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", "rfi001_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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, 118 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.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 3 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 252 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 15:14:31,399 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...