./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix036_pso.opt_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix036_pso.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-?-80b1b13-m [2024-01-31 17:37:50,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:37:50,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:37:50,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:37:50,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:37:50,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:37:50,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:37:50,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:37:50,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:37:50,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:37:50,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:37:50,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:37:50,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:37:50,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:37:50,841 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:37:50,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:37:50,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:37:50,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:37:50,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:37:50,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:37:50,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:37:50,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:37:50,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:37:50,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:37:50,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:37:50,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:37:50,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:37:50,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:37:50,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:37:50,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:37:50,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:37:50,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:37:50,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:37:50,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:37:50,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:37:50,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:37:50,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:37:50,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:37:50,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:37:50,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:37:50,847 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:37:50,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:37:50,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:37:50,847 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 17:37:51,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:37:51,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:37:51,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:37:51,113 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:37:51,113 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:37:51,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/mix036_pso.opt_tso.opt.yml/witness.yml [2024-01-31 17:37:51,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:37:51,639 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:37:51,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-01-31 17:37:52,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:37:53,038 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:37:53,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-01-31 17:37:53,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e23cec37/fd8ec5381106447490c28c8bcb9c51f4/FLAG0405d047b [2024-01-31 17:37:53,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e23cec37/fd8ec5381106447490c28c8bcb9c51f4 [2024-01-31 17:37:53,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:37:53,068 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:37:53,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:37:53,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:37:53,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:37:53,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:51" (1/2) ... [2024-01-31 17:37:53,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a1cec7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:37:53, skipping insertion in model container [2024-01-31 17:37:53,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:51" (1/2) ... [2024-01-31 17:37:53,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c70278c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:37:53, skipping insertion in model container [2024-01-31 17:37:53,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:37:53" (2/2) ... [2024-01-31 17:37:53,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a1cec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:53, skipping insertion in model container [2024-01-31 17:37:53,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:37:53" (2/2) ... [2024-01-31 17:37:53,079 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:37:55,065 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:37:55,070 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:37:55,071 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:37:55,098 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:37:55,214 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969] [2024-01-31 17:37:55,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:37:55,359 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:37:55,367 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969] Start Parsing Local [2024-01-31 17:37:55,388 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:37:55,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:37:55,454 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:37:55,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55 WrapperNode [2024-01-31 17:37:55,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:37:55,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:37:55,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:37:55,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:37:55,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,493 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2024-01-31 17:37:55,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:37:55,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:37:55,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:37:55,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:37:55,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,532 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 17:37:55,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:37:55,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:37:55,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:37:55,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:37:55,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (1/1) ... [2024-01-31 17:37:55,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:37:55,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:37:55,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 17:37:55,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 17:37:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:37:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:37:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:37:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:37:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:37:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:37:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:37:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:37:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:37:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:37:55,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:37:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:37:55,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:37:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:37:55,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:37:55,668 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-01-31 17:37:55,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-01-31 17:37:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:37:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:37:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:37:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:37:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:37:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:37:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:37:55,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:37:55,672 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:37:55,808 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:37:55,810 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:37:56,020 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:37:56,022 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:37:56,186 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:37:56,186 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:37:56,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:37:56 BoogieIcfgContainer [2024-01-31 17:37:56,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:37:56,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:37:56,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:37:56,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:37:56,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:37:51" (1/4) ... [2024-01-31 17:37:56,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cb5aa6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:37:56, skipping insertion in model container [2024-01-31 17:37:56,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:37:53" (2/4) ... [2024-01-31 17:37:56,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cb5aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:37:56, skipping insertion in model container [2024-01-31 17:37:56,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:37:55" (3/4) ... [2024-01-31 17:37:56,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cb5aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:37:56, skipping insertion in model container [2024-01-31 17:37:56,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:37:56" (4/4) ... [2024-01-31 17:37:56,195 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2024-01-31 17:37:56,208 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:37:56,209 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:37:56,209 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:37:56,246 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:37:56,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 53 transitions, 122 flow [2024-01-31 17:37:56,317 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2024-01-31 17:37:56,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:37:56,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 1/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 104 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-01-31 17:37:56,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 53 transitions, 122 flow [2024-01-31 17:37:56,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 49 transitions, 110 flow [2024-01-31 17:37:56,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:37:56,348 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=LoopHeads, 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;@1c7c58b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:37:56,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-01-31 17:37:56,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:37:56,360 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-01-31 17:37:56,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:37:56,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:56,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:56,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:56,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1544361828, now seen corresponding path program 1 times [2024-01-31 17:37:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588066685] [2024-01-31 17:37:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:56,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588066685] [2024-01-31 17:37:56,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588066685] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:56,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:56,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:37:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472830953] [2024-01-31 17:37:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:56,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:37:56,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:37:56,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:37:56,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 53 [2024-01-31 17:37:56,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 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) [2024-01-31 17:37:56,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:56,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 53 [2024-01-31 17:37:56,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:56,959 INFO L124 PetriNetUnfolderBase]: 879/1787 cut-off events. [2024-01-31 17:37:56,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:37:56,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 1787 events. 879/1787 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14039 event pairs, 879 based on Foata normal form. 60/1591 useless extension candidates. Maximal degree in co-relation 3095. Up to 1277 conditions per place. [2024-01-31 17:37:56,973 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 21 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2024-01-31 17:37:56,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 148 flow [2024-01-31 17:37:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:37:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:37:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2024-01-31 17:37:56,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7830188679245284 [2024-01-31 17:37:56,983 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 2 states and 83 transitions. [2024-01-31 17:37:56,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 148 flow [2024-01-31 17:37:56,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 144 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-31 17:37:56,987 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 102 flow [2024-01-31 17:37:56,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-01-31 17:37:56,991 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2024-01-31 17:37:56,991 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 102 flow [2024-01-31 17:37:56,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 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) [2024-01-31 17:37:56,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:56,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:56,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:37:56,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:56,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1544361829, now seen corresponding path program 1 times [2024-01-31 17:37:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828090212] [2024-01-31 17:37:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828090212] [2024-01-31 17:37:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828090212] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:57,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:57,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:37:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691321864] [2024-01-31 17:37:57,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:57,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:37:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:57,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:37:57,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:37:57,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 53 [2024-01-31 17:37:57,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2024-01-31 17:37:57,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:57,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 53 [2024-01-31 17:37:57,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:57,424 INFO L124 PetriNetUnfolderBase]: 699/1439 cut-off events. [2024-01-31 17:37:57,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:37:57,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1439 events. 699/1439 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10622 event pairs, 159 based on Foata normal form. 0/1387 useless extension candidates. Maximal degree in co-relation 2501. Up to 757 conditions per place. [2024-01-31 17:37:57,464 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 25 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-01-31 17:37:57,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 176 flow [2024-01-31 17:37:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:37:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:37:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-01-31 17:37:57,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7547169811320755 [2024-01-31 17:37:57,471 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 102 flow. Second operand 3 states and 120 transitions. [2024-01-31 17:37:57,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 176 flow [2024-01-31 17:37:57,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:37:57,478 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 102 flow [2024-01-31 17:37:57,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-01-31 17:37:57,479 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2024-01-31 17:37:57,480 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 102 flow [2024-01-31 17:37:57,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2024-01-31 17:37:57,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:57,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:57,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:37:57,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:57,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1701210942, now seen corresponding path program 1 times [2024-01-31 17:37:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059616583] [2024-01-31 17:37:57,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:57,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:57,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059616583] [2024-01-31 17:37:57,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059616583] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:57,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:57,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:37:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70126230] [2024-01-31 17:37:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:57,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:37:57,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:57,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:37:57,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:37:57,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2024-01-31 17:37:57,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2024-01-31 17:37:57,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:57,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2024-01-31 17:37:57,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:57,782 INFO L124 PetriNetUnfolderBase]: 931/1587 cut-off events. [2024-01-31 17:37:57,782 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-01-31 17:37:57,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3078 conditions, 1587 events. 931/1587 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11207 event pairs, 699 based on Foata normal form. 0/1475 useless extension candidates. Maximal degree in co-relation 3074. Up to 1025 conditions per place. [2024-01-31 17:37:57,796 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 27 selfloop transitions, 1 changer transitions 1/51 dead transitions. [2024-01-31 17:37:57,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 174 flow [2024-01-31 17:37:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:37:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:37:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-01-31 17:37:57,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2024-01-31 17:37:57,801 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 102 flow. Second operand 3 states and 108 transitions. [2024-01-31 17:37:57,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 174 flow [2024-01-31 17:37:57,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:37:57,804 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 96 flow [2024-01-31 17:37:57,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-01-31 17:37:57,805 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2024-01-31 17:37:57,805 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 96 flow [2024-01-31 17:37:57,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2024-01-31 17:37:57,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:57,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:57,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:37:57,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:57,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1197932045, now seen corresponding path program 1 times [2024-01-31 17:37:57,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:57,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493001216] [2024-01-31 17:37:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:58,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:58,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493001216] [2024-01-31 17:37:58,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493001216] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:58,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:58,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:37:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452259768] [2024-01-31 17:37:58,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:58,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:37:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:58,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:37:58,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:37:58,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2024-01-31 17:37:58,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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) [2024-01-31 17:37:58,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:58,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2024-01-31 17:37:58,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:58,880 INFO L124 PetriNetUnfolderBase]: 4373/6726 cut-off events. [2024-01-31 17:37:58,880 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-01-31 17:37:58,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13034 conditions, 6726 events. 4373/6726 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 44497 event pairs, 2491 based on Foata normal form. 162/6857 useless extension candidates. Maximal degree in co-relation 13030. Up to 4965 conditions per place. [2024-01-31 17:37:58,913 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 35 selfloop transitions, 5 changer transitions 35/92 dead transitions. [2024-01-31 17:37:58,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 350 flow [2024-01-31 17:37:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:37:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:37:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2024-01-31 17:37:58,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-01-31 17:37:58,915 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 96 flow. Second operand 7 states and 224 transitions. [2024-01-31 17:37:58,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 350 flow [2024-01-31 17:37:58,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:37:58,928 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 152 flow [2024-01-31 17:37:58,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2024-01-31 17:37:58,929 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2024-01-31 17:37:58,929 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 152 flow [2024-01-31 17:37:58,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 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) [2024-01-31 17:37:58,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:58,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:58,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:37:58,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:58,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1209213157, now seen corresponding path program 1 times [2024-01-31 17:37:58,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:58,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058612287] [2024-01-31 17:37:58,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058612287] [2024-01-31 17:37:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058612287] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:37:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225520444] [2024-01-31 17:37:59,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:59,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:37:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:37:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:37:59,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2024-01-31 17:37:59,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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) [2024-01-31 17:37:59,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:59,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2024-01-31 17:37:59,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:37:59,497 INFO L124 PetriNetUnfolderBase]: 2551/4328 cut-off events. [2024-01-31 17:37:59,497 INFO L125 PetriNetUnfolderBase]: For 3990/4242 co-relation queries the response was YES. [2024-01-31 17:37:59,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11283 conditions, 4328 events. 2551/4328 cut-off events. For 3990/4242 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 31450 event pairs, 865 based on Foata normal form. 130/4142 useless extension candidates. Maximal degree in co-relation 11274. Up to 1910 conditions per place. [2024-01-31 17:37:59,525 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 29 selfloop transitions, 3 changer transitions 27/81 dead transitions. [2024-01-31 17:37:59,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 81 transitions, 390 flow [2024-01-31 17:37:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:37:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:37:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2024-01-31 17:37:59,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6118598382749326 [2024-01-31 17:37:59,527 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 152 flow. Second operand 7 states and 227 transitions. [2024-01-31 17:37:59,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 81 transitions, 390 flow [2024-01-31 17:37:59,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 377 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-01-31 17:37:59,538 INFO L231 Difference]: Finished difference. Result has 69 places, 47 transitions, 162 flow [2024-01-31 17:37:59,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2024-01-31 17:37:59,538 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-01-31 17:37:59,538 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 162 flow [2024-01-31 17:37:59,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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) [2024-01-31 17:37:59,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:37:59,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:37:59,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:37:59,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:37:59,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:37:59,539 INFO L85 PathProgramCache]: Analyzing trace with hash -589770295, now seen corresponding path program 1 times [2024-01-31 17:37:59,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:37:59,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910552297] [2024-01-31 17:37:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:37:59,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:37:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:37:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:37:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:37:59,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910552297] [2024-01-31 17:37:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910552297] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:37:59,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:37:59,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:37:59,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732189305] [2024-01-31 17:37:59,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:37:59,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:37:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:37:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:37:59,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:37:59,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-01-31 17:37:59,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 47 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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) [2024-01-31 17:37:59,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:37:59,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-01-31 17:37:59,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:00,567 INFO L124 PetriNetUnfolderBase]: 6343/9849 cut-off events. [2024-01-31 17:38:00,568 INFO L125 PetriNetUnfolderBase]: For 7485/8073 co-relation queries the response was YES. [2024-01-31 17:38:00,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23936 conditions, 9849 events. 6343/9849 cut-off events. For 7485/8073 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 70143 event pairs, 1271 based on Foata normal form. 355/9857 useless extension candidates. Maximal degree in co-relation 23924. Up to 4688 conditions per place. [2024-01-31 17:38:00,648 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 45 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-01-31 17:38:00,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 334 flow [2024-01-31 17:38:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:38:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:38:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2024-01-31 17:38:00,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7169811320754716 [2024-01-31 17:38:00,650 INFO L175 Difference]: Start difference. First operand has 69 places, 47 transitions, 162 flow. Second operand 4 states and 152 transitions. [2024-01-31 17:38:00,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 334 flow [2024-01-31 17:38:00,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 320 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-01-31 17:38:00,675 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 194 flow [2024-01-31 17:38:00,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-01-31 17:38:00,676 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 3 predicate places. [2024-01-31 17:38:00,676 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 194 flow [2024-01-31 17:38:00,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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) [2024-01-31 17:38:00,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:00,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:00,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:38:00,677 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:00,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2027371901, now seen corresponding path program 1 times [2024-01-31 17:38:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:00,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794301861] [2024-01-31 17:38:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:00,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:00,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794301861] [2024-01-31 17:38:00,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794301861] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:00,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:00,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:38:00,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216284409] [2024-01-31 17:38:00,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:00,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:38:00,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:00,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:38:00,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:38:00,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-01-31 17:38:00,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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) [2024-01-31 17:38:00,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:00,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-01-31 17:38:00,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:01,574 INFO L124 PetriNetUnfolderBase]: 5667/8869 cut-off events. [2024-01-31 17:38:01,575 INFO L125 PetriNetUnfolderBase]: For 7080/8205 co-relation queries the response was YES. [2024-01-31 17:38:01,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24096 conditions, 8869 events. 5667/8869 cut-off events. For 7080/8205 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 61726 event pairs, 712 based on Foata normal form. 350/8929 useless extension candidates. Maximal degree in co-relation 24086. Up to 3506 conditions per place. [2024-01-31 17:38:01,649 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 58 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2024-01-31 17:38:01,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 453 flow [2024-01-31 17:38:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:38:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:38:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-01-31 17:38:01,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7320754716981132 [2024-01-31 17:38:01,651 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 194 flow. Second operand 5 states and 194 transitions. [2024-01-31 17:38:01,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 453 flow [2024-01-31 17:38:01,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:38:01,653 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 259 flow [2024-01-31 17:38:01,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-01-31 17:38:01,654 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2024-01-31 17:38:01,654 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 259 flow [2024-01-31 17:38:01,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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) [2024-01-31 17:38:01,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:01,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:01,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:38:01,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:01,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1621106970, now seen corresponding path program 1 times [2024-01-31 17:38:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940731573] [2024-01-31 17:38:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940731573] [2024-01-31 17:38:01,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940731573] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:01,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-31 17:38:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72728965] [2024-01-31 17:38:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:01,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-31 17:38:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:01,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-31 17:38:01,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:38:01,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-01-31 17:38:01,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 259 flow. Second operand has 9 states, 9 states have (on average 25.11111111111111) internal successors, (226), 9 states have internal predecessors, (226), 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) [2024-01-31 17:38:01,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:01,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-01-31 17:38:01,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:04,287 INFO L124 PetriNetUnfolderBase]: 12115/20554 cut-off events. [2024-01-31 17:38:04,288 INFO L125 PetriNetUnfolderBase]: For 17674/21343 co-relation queries the response was YES. [2024-01-31 17:38:04,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55460 conditions, 20554 events. 12115/20554 cut-off events. For 17674/21343 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 175383 event pairs, 4962 based on Foata normal form. 358/19448 useless extension candidates. Maximal degree in co-relation 55448. Up to 7589 conditions per place. [2024-01-31 17:38:04,478 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 88 selfloop transitions, 18 changer transitions 15/153 dead transitions. [2024-01-31 17:38:04,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 153 transitions, 837 flow [2024-01-31 17:38:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-31 17:38:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-31 17:38:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 420 transitions. [2024-01-31 17:38:04,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6095791001451378 [2024-01-31 17:38:04,480 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 259 flow. Second operand 13 states and 420 transitions. [2024-01-31 17:38:04,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 153 transitions, 837 flow [2024-01-31 17:38:04,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 153 transitions, 822 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-31 17:38:04,486 INFO L231 Difference]: Finished difference. Result has 90 places, 75 transitions, 417 flow [2024-01-31 17:38:04,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=417, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2024-01-31 17:38:04,489 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 29 predicate places. [2024-01-31 17:38:04,489 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 417 flow [2024-01-31 17:38:04,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.11111111111111) internal successors, (226), 9 states have internal predecessors, (226), 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) [2024-01-31 17:38:04,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:04,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:04,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:38:04,490 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:04,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1564257858, now seen corresponding path program 2 times [2024-01-31 17:38:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:04,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979213161] [2024-01-31 17:38:04,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:04,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:04,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:04,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979213161] [2024-01-31 17:38:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979213161] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:04,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-31 17:38:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925675492] [2024-01-31 17:38:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:04,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-31 17:38:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:04,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-31 17:38:04,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:38:04,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-01-31 17:38:04,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 417 flow. Second operand has 9 states, 9 states have (on average 25.11111111111111) internal successors, (226), 9 states have internal predecessors, (226), 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) [2024-01-31 17:38:04,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:04,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-01-31 17:38:04,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:08,446 INFO L124 PetriNetUnfolderBase]: 16192/27385 cut-off events. [2024-01-31 17:38:08,446 INFO L125 PetriNetUnfolderBase]: For 57925/61232 co-relation queries the response was YES. [2024-01-31 17:38:08,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89579 conditions, 27385 events. 16192/27385 cut-off events. For 57925/61232 co-relation queries the response was YES. Maximal size of possible extension queue 1665. Compared 244948 event pairs, 3786 based on Foata normal form. 482/26075 useless extension candidates. Maximal degree in co-relation 89556. Up to 6803 conditions per place. [2024-01-31 17:38:08,772 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 123 selfloop transitions, 26 changer transitions 0/181 dead transitions. [2024-01-31 17:38:08,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 181 transitions, 1309 flow [2024-01-31 17:38:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-31 17:38:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-31 17:38:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 430 transitions. [2024-01-31 17:38:08,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6240928882438317 [2024-01-31 17:38:08,775 INFO L175 Difference]: Start difference. First operand has 90 places, 75 transitions, 417 flow. Second operand 13 states and 430 transitions. [2024-01-31 17:38:08,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 181 transitions, 1309 flow [2024-01-31 17:38:09,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 181 transitions, 1275 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-01-31 17:38:09,418 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 690 flow [2024-01-31 17:38:09,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=690, PETRI_PLACES=109, PETRI_TRANSITIONS=94} [2024-01-31 17:38:09,418 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 48 predicate places. [2024-01-31 17:38:09,419 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 690 flow [2024-01-31 17:38:09,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.11111111111111) internal successors, (226), 9 states have internal predecessors, (226), 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) [2024-01-31 17:38:09,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:09,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:09,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:38:09,419 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:09,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1115232764, now seen corresponding path program 3 times [2024-01-31 17:38:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909166396] [2024-01-31 17:38:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909166396] [2024-01-31 17:38:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909166396] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:09,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:09,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:38:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519435105] [2024-01-31 17:38:09,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:09,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:09,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:09,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:09,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:09,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-01-31 17:38:09,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 94 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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) [2024-01-31 17:38:09,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:09,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-01-31 17:38:09,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:12,379 INFO L124 PetriNetUnfolderBase]: 16967/26188 cut-off events. [2024-01-31 17:38:12,392 INFO L125 PetriNetUnfolderBase]: For 77112/82622 co-relation queries the response was YES. [2024-01-31 17:38:12,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92305 conditions, 26188 events. 16967/26188 cut-off events. For 77112/82622 co-relation queries the response was YES. Maximal size of possible extension queue 1518. Compared 204354 event pairs, 1268 based on Foata normal form. 1413/26677 useless extension candidates. Maximal degree in co-relation 92272. Up to 8132 conditions per place. [2024-01-31 17:38:12,559 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 102 selfloop transitions, 14 changer transitions 24/168 dead transitions. [2024-01-31 17:38:12,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 168 transitions, 1398 flow [2024-01-31 17:38:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:38:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:38:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-01-31 17:38:12,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7358490566037735 [2024-01-31 17:38:12,561 INFO L175 Difference]: Start difference. First operand has 109 places, 94 transitions, 690 flow. Second operand 6 states and 234 transitions. [2024-01-31 17:38:12,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 168 transitions, 1398 flow [2024-01-31 17:38:12,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 168 transitions, 1364 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-01-31 17:38:12,788 INFO L231 Difference]: Finished difference. Result has 114 places, 82 transitions, 573 flow [2024-01-31 17:38:12,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=114, PETRI_TRANSITIONS=82} [2024-01-31 17:38:12,791 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 53 predicate places. [2024-01-31 17:38:12,791 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 82 transitions, 573 flow [2024-01-31 17:38:12,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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) [2024-01-31 17:38:12,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:12,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:12,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:38:12,792 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:12,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1749163241, now seen corresponding path program 1 times [2024-01-31 17:38:12,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:12,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93418601] [2024-01-31 17:38:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93418601] [2024-01-31 17:38:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93418601] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:12,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:12,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:38:12,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589836189] [2024-01-31 17:38:12,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:12,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:38:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:38:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:38:12,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-01-31 17:38:12,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 82 transitions, 573 flow. Second operand has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:12,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:12,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-01-31 17:38:12,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:15,031 INFO L124 PetriNetUnfolderBase]: 12338/18757 cut-off events. [2024-01-31 17:38:15,032 INFO L125 PetriNetUnfolderBase]: For 81282/87626 co-relation queries the response was YES. [2024-01-31 17:38:15,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74287 conditions, 18757 events. 12338/18757 cut-off events. For 81282/87626 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 140738 event pairs, 872 based on Foata normal form. 819/18711 useless extension candidates. Maximal degree in co-relation 74253. Up to 6730 conditions per place. [2024-01-31 17:38:15,166 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 73 selfloop transitions, 18 changer transitions 27/141 dead transitions. [2024-01-31 17:38:15,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 141 transitions, 1128 flow [2024-01-31 17:38:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:38:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:38:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 258 transitions. [2024-01-31 17:38:15,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6954177897574124 [2024-01-31 17:38:15,167 INFO L175 Difference]: Start difference. First operand has 114 places, 82 transitions, 573 flow. Second operand 7 states and 258 transitions. [2024-01-31 17:38:15,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 141 transitions, 1128 flow [2024-01-31 17:38:15,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 141 transitions, 1043 flow, removed 29 selfloop flow, removed 13 redundant places. [2024-01-31 17:38:15,350 INFO L231 Difference]: Finished difference. Result has 99 places, 70 transitions, 446 flow [2024-01-31 17:38:15,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=446, PETRI_PLACES=99, PETRI_TRANSITIONS=70} [2024-01-31 17:38:15,351 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 38 predicate places. [2024-01-31 17:38:15,351 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 70 transitions, 446 flow [2024-01-31 17:38:15,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:38:15,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:15,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:15,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:38:15,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:15,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash -444575706, now seen corresponding path program 1 times [2024-01-31 17:38:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112540322] [2024-01-31 17:38:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:16,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112540322] [2024-01-31 17:38:16,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112540322] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:16,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-31 17:38:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241242481] [2024-01-31 17:38:16,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:16,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-31 17:38:16,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-31 17:38:16,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:38:16,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2024-01-31 17:38:16,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 70 transitions, 446 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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) [2024-01-31 17:38:16,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:16,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2024-01-31 17:38:16,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:17,679 INFO L124 PetriNetUnfolderBase]: 4201/8521 cut-off events. [2024-01-31 17:38:17,679 INFO L125 PetriNetUnfolderBase]: For 23798/26077 co-relation queries the response was YES. [2024-01-31 17:38:17,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27929 conditions, 8521 events. 4201/8521 cut-off events. For 23798/26077 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 77423 event pairs, 1082 based on Foata normal form. 137/7578 useless extension candidates. Maximal degree in co-relation 27903. Up to 2739 conditions per place. [2024-01-31 17:38:17,726 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 40 selfloop transitions, 11 changer transitions 12/104 dead transitions. [2024-01-31 17:38:17,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 693 flow [2024-01-31 17:38:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:38:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:38:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 256 transitions. [2024-01-31 17:38:17,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2024-01-31 17:38:17,729 INFO L175 Difference]: Start difference. First operand has 99 places, 70 transitions, 446 flow. Second operand 8 states and 256 transitions. [2024-01-31 17:38:17,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 693 flow [2024-01-31 17:38:17,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 603 flow, removed 31 selfloop flow, removed 11 redundant places. [2024-01-31 17:38:17,866 INFO L231 Difference]: Finished difference. Result has 96 places, 75 transitions, 447 flow [2024-01-31 17:38:17,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=447, PETRI_PLACES=96, PETRI_TRANSITIONS=75} [2024-01-31 17:38:17,867 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2024-01-31 17:38:17,867 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 75 transitions, 447 flow [2024-01-31 17:38:17,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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) [2024-01-31 17:38:17,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:17,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:17,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:38:17,868 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:17,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1899901148, now seen corresponding path program 2 times [2024-01-31 17:38:17,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:17,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507991434] [2024-01-31 17:38:17,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:17,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:18,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507991434] [2024-01-31 17:38:18,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507991434] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:18,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-31 17:38:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909590916] [2024-01-31 17:38:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:18,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:38:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:18,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:38:18,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:38:18,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-01-31 17:38:18,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 75 transitions, 447 flow. Second operand has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 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) [2024-01-31 17:38:18,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:18,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-01-31 17:38:18,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:22,130 INFO L124 PetriNetUnfolderBase]: 19974/35427 cut-off events. [2024-01-31 17:38:22,130 INFO L125 PetriNetUnfolderBase]: For 63053/67309 co-relation queries the response was YES. [2024-01-31 17:38:22,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103363 conditions, 35427 events. 19974/35427 cut-off events. For 63053/67309 co-relation queries the response was YES. Maximal size of possible extension queue 2774. Compared 349887 event pairs, 4469 based on Foata normal form. 415/32028 useless extension candidates. Maximal degree in co-relation 103338. Up to 8476 conditions per place. [2024-01-31 17:38:22,498 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 87 selfloop transitions, 31 changer transitions 53/204 dead transitions. [2024-01-31 17:38:22,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 204 transitions, 1469 flow [2024-01-31 17:38:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-31 17:38:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-31 17:38:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 389 transitions. [2024-01-31 17:38:22,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645863570391872 [2024-01-31 17:38:22,526 INFO L175 Difference]: Start difference. First operand has 96 places, 75 transitions, 447 flow. Second operand 13 states and 389 transitions. [2024-01-31 17:38:22,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 204 transitions, 1469 flow [2024-01-31 17:38:24,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 204 transitions, 1394 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-01-31 17:38:24,014 INFO L231 Difference]: Finished difference. Result has 111 places, 95 transitions, 708 flow [2024-01-31 17:38:24,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=708, PETRI_PLACES=111, PETRI_TRANSITIONS=95} [2024-01-31 17:38:24,015 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 50 predicate places. [2024-01-31 17:38:24,015 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 95 transitions, 708 flow [2024-01-31 17:38:24,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 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) [2024-01-31 17:38:24,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:24,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:24,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:38:24,016 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:24,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash 778208522, now seen corresponding path program 3 times [2024-01-31 17:38:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618628792] [2024-01-31 17:38:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:24,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:24,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618628792] [2024-01-31 17:38:24,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618628792] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:24,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:24,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:38:24,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367185677] [2024-01-31 17:38:24,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:24,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:24,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:24,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:24,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2024-01-31 17:38:24,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 95 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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) [2024-01-31 17:38:24,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:24,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2024-01-31 17:38:24,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:25,667 INFO L124 PetriNetUnfolderBase]: 7877/15418 cut-off events. [2024-01-31 17:38:25,668 INFO L125 PetriNetUnfolderBase]: For 32816/34598 co-relation queries the response was YES. [2024-01-31 17:38:25,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47582 conditions, 15418 events. 7877/15418 cut-off events. For 32816/34598 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 151149 event pairs, 2298 based on Foata normal form. 186/13432 useless extension candidates. Maximal degree in co-relation 47551. Up to 6487 conditions per place. [2024-01-31 17:38:25,790 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 41 selfloop transitions, 2 changer transitions 56/136 dead transitions. [2024-01-31 17:38:25,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 136 transitions, 1109 flow [2024-01-31 17:38:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:38:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:38:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-01-31 17:38:25,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2024-01-31 17:38:25,792 INFO L175 Difference]: Start difference. First operand has 111 places, 95 transitions, 708 flow. Second operand 6 states and 198 transitions. [2024-01-31 17:38:25,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 136 transitions, 1109 flow [2024-01-31 17:38:26,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 136 transitions, 1065 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-01-31 17:38:26,394 INFO L231 Difference]: Finished difference. Result has 104 places, 70 transitions, 436 flow [2024-01-31 17:38:26,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=104, PETRI_TRANSITIONS=70} [2024-01-31 17:38:26,395 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 43 predicate places. [2024-01-31 17:38:26,395 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 70 transitions, 436 flow [2024-01-31 17:38:26,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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) [2024-01-31 17:38:26,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:26,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:26,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 17:38:26,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:26,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1461582524, now seen corresponding path program 4 times [2024-01-31 17:38:26,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:26,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620740503] [2024-01-31 17:38:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:26,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620740503] [2024-01-31 17:38:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620740503] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:38:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197579896] [2024-01-31 17:38:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:26,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:38:26,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:26,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:38:26,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:38:26,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-01-31 17:38:26,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 70 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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) [2024-01-31 17:38:26,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:26,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-01-31 17:38:26,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:27,815 INFO L124 PetriNetUnfolderBase]: 6449/12455 cut-off events. [2024-01-31 17:38:27,815 INFO L125 PetriNetUnfolderBase]: For 30831/32147 co-relation queries the response was YES. [2024-01-31 17:38:27,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38549 conditions, 12455 events. 6449/12455 cut-off events. For 30831/32147 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 115653 event pairs, 1830 based on Foata normal form. 136/11282 useless extension candidates. Maximal degree in co-relation 38521. Up to 5312 conditions per place. [2024-01-31 17:38:27,883 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 40 selfloop transitions, 7 changer transitions 33/113 dead transitions. [2024-01-31 17:38:27,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 113 transitions, 821 flow [2024-01-31 17:38:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:38:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:38:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2024-01-31 17:38:27,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5579514824797843 [2024-01-31 17:38:27,885 INFO L175 Difference]: Start difference. First operand has 104 places, 70 transitions, 436 flow. Second operand 7 states and 207 transitions. [2024-01-31 17:38:27,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 113 transitions, 821 flow [2024-01-31 17:38:28,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 113 transitions, 768 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-01-31 17:38:28,210 INFO L231 Difference]: Finished difference. Result has 100 places, 65 transitions, 384 flow [2024-01-31 17:38:28,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=384, PETRI_PLACES=100, PETRI_TRANSITIONS=65} [2024-01-31 17:38:28,212 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 39 predicate places. [2024-01-31 17:38:28,213 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 65 transitions, 384 flow [2024-01-31 17:38:28,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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) [2024-01-31 17:38:28,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:28,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:28,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 17:38:28,214 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:28,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash 20572302, now seen corresponding path program 5 times [2024-01-31 17:38:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592782160] [2024-01-31 17:38:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:38:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:38:28,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:38:28,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592782160] [2024-01-31 17:38:28,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592782160] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:38:28,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:38:28,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:38:28,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547501661] [2024-01-31 17:38:28,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:38:28,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:38:28,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:38:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:38:28,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:38:28,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2024-01-31 17:38:28,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 65 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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) [2024-01-31 17:38:28,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:38:28,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2024-01-31 17:38:28,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:38:29,106 INFO L124 PetriNetUnfolderBase]: 3484/6756 cut-off events. [2024-01-31 17:38:29,106 INFO L125 PetriNetUnfolderBase]: For 12486/12840 co-relation queries the response was YES. [2024-01-31 17:38:29,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19713 conditions, 6756 events. 3484/6756 cut-off events. For 12486/12840 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 57347 event pairs, 817 based on Foata normal form. 64/5977 useless extension candidates. Maximal degree in co-relation 19686. Up to 2277 conditions per place. [2024-01-31 17:38:29,136 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 31 selfloop transitions, 3 changer transitions 30/96 dead transitions. [2024-01-31 17:38:29,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 96 transitions, 629 flow [2024-01-31 17:38:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:38:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:38:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 222 transitions. [2024-01-31 17:38:29,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235849056603774 [2024-01-31 17:38:29,138 INFO L175 Difference]: Start difference. First operand has 100 places, 65 transitions, 384 flow. Second operand 8 states and 222 transitions. [2024-01-31 17:38:29,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 96 transitions, 629 flow [2024-01-31 17:38:29,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 587 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-01-31 17:38:29,216 INFO L231 Difference]: Finished difference. Result has 97 places, 60 transitions, 327 flow [2024-01-31 17:38:29,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=97, PETRI_TRANSITIONS=60} [2024-01-31 17:38:29,217 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 36 predicate places. [2024-01-31 17:38:29,217 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 60 transitions, 327 flow [2024-01-31 17:38:29,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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) [2024-01-31 17:38:29,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:38:29,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:29,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 17:38:29,218 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P3Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 7 more)] === [2024-01-31 17:38:29,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:38:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash 604439288, now seen corresponding path program 6 times [2024-01-31 17:38:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:38:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931960066] [2024-01-31 17:38:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:38:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:38:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:38:29,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:38:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:38:29,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:38:29,289 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:38:29,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-01-31 17:38:29,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 10 remaining) [2024-01-31 17:38:29,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-01-31 17:38:29,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-01-31 17:38:29,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-01-31 17:38:29,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-01-31 17:38:29,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 10 remaining) [2024-01-31 17:38:29,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2024-01-31 17:38:29,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 10 remaining) [2024-01-31 17:38:29,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-01-31 17:38:29,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-31 17:38:29,292 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:38:29,297 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:38:29,297 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:38:29,366 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:38:29,366 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:38:29,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:38:29 BasicIcfg [2024-01-31 17:38:29,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:38:29,367 INFO L158 Benchmark]: Toolchain (without parser) took 36298.77ms. Allocated memory was 207.6MB in the beginning and 12.4GB in the end (delta: 12.2GB). Free memory was 141.1MB in the beginning and 10.9GB in the end (delta: -10.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-01-31 17:38:29,367 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 207.6MB. Free memory is still 173.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:38:29,367 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 207.6MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:38:29,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2384.93ms. Allocated memory was 207.6MB in the beginning and 346.0MB in the end (delta: 138.4MB). Free memory was 141.1MB in the beginning and 240.7MB in the end (delta: -99.6MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. [2024-01-31 17:38:29,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.14ms. Allocated memory is still 346.0MB. Free memory was 240.7MB in the beginning and 238.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:38:29,368 INFO L158 Benchmark]: Boogie Preprocessor took 69.01ms. Allocated memory is still 346.0MB. Free memory was 238.6MB in the beginning and 235.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:38:29,368 INFO L158 Benchmark]: RCFGBuilder took 619.16ms. Allocated memory is still 346.0MB. Free memory was 235.5MB in the beginning and 185.1MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-01-31 17:38:29,368 INFO L158 Benchmark]: TraceAbstraction took 33177.20ms. Allocated memory was 346.0MB in the beginning and 12.4GB in the end (delta: 12.1GB). Free memory was 185.1MB in the beginning and 10.9GB in the end (delta: -10.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-01-31 17:38:29,369 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 207.6MB. Free memory is still 173.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 207.6MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2384.93ms. Allocated memory was 207.6MB in the beginning and 346.0MB in the end (delta: 138.4MB). Free memory was 141.1MB in the beginning and 240.7MB in the end (delta: -99.6MB). Peak memory consumption was 146.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.14ms. Allocated memory is still 346.0MB. Free memory was 240.7MB in the beginning and 238.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.01ms. Allocated memory is still 346.0MB. Free memory was 238.6MB in the beginning and 235.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 619.16ms. Allocated memory is still 346.0MB. Free memory was 235.5MB in the beginning and 185.1MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33177.20ms. Allocated memory was 346.0MB in the beginning and 12.4GB in the end (delta: 12.1GB). Free memory was 185.1MB in the beginning and 10.9GB in the end (delta: -10.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 10 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: 33.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 922 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 873 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2945 IncrementalHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 83 mSDtfsCounter, 2945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=708occurred in iteration=13, InterpolantAutomatonStates: 112, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 418 ConstructedInterpolants, 0 QuantifiedInterpolants, 2870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! [2024-01-31 17:38:29,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE