./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.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/safe031_power.opt_pso.opt_rmo.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/safe031_power.opt_pso.opt_rmo.opt.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/safe031_power.opt_pso.opt_rmo.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:41:51,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:41:51,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:41:51,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:41:51,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:41:51,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:41:51,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:41:51,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:41:51,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:41:51,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:41:51,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:41:51,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:41:51,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:41:51,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:41:51,793 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:41:51,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:41:51,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:41:51,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:41:51,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:41:51,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:41:51,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:41:51,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:41:51,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:41:51,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:41:51,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:41:51,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:41:51,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:41:51,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:41:51,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:41:51,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:41:51,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:41:51,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:41:51,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:41:51,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:41:51,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:41:51,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:41:51,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:41:51,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:41:51,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:41:51,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:41:51,799 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:41:51,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:41:51,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:41:51,799 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:41:51,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:41:52,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:41:52,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:41:52,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:41:52,037 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:41:52,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-01-31 17:41:53,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:41:53,407 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:41:53,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2024-01-31 17:41:53,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44b5bdbf/1a3fd8afe2aa492cae88f7f89e973bc1/FLAGe89f8db46 [2024-01-31 17:41:53,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44b5bdbf/1a3fd8afe2aa492cae88f7f89e973bc1 [2024-01-31 17:41:53,435 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:41:53,435 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:41:53,436 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/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-01-31 17:41:53,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:41:53,913 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:41:53,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:41:53,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:41:53,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:41:53,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:41:53" (1/2) ... [2024-01-31 17:41:53,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5009b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:41:53, skipping insertion in model container [2024-01-31 17:41:53,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:41:53" (1/2) ... [2024-01-31 17:41:53,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d7fd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:41:53, skipping insertion in model container [2024-01-31 17:41:53,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:41:53" (2/2) ... [2024-01-31 17:41:53,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5009b0a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:53, skipping insertion in model container [2024-01-31 17:41:53,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:41:53" (2/2) ... [2024-01-31 17:41:53,922 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:41:55,204 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:41:55,216 INFO L98 nessWitnessExtractor]: Location invariant before [L18-L18] expression == 0 [2024-01-31 17:41:55,216 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L18] expression == 1 [2024-01-31 17:41:55,301 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:41:55,501 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2024-01-31 17:41:55,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:41:55,642 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:41:55,650 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] Start Parsing Local [2024-01-31 17:41:55,671 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry [2024-01-31 17:41:55,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:41:55,728 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:41:55,728 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55 WrapperNode [2024-01-31 17:41:55,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:41:55,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:41:55,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:41:55,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:41:55,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,793 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2024-01-31 17:41:55,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:41:55,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:41:55,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:41:55,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:41:55,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,828 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-31 17:41:55,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:41:55,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:41:55,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:41:55,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:41:55,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (1/1) ... [2024-01-31 17:41:55,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:41:55,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:41:55,907 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:41:55,913 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:41:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:41:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:41:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:41:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:41:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:41:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:41:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:41:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:41:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-31 17:41:55,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-31 17:41:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-31 17:41:55,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-31 17:41:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-31 17:41:55,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-31 17:41:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:41:55,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:41:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:41:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:41:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:41:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:41:55,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:41:55,947 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:41:56,090 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:41:56,092 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:41:56,321 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:41:56,322 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:41:56,500 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:41:56,501 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-31 17:41:56,502 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:41:56 BoogieIcfgContainer [2024-01-31 17:41:56,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:41:56,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:41:56,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:41:56,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:41:56,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:41:53" (1/4) ... [2024-01-31 17:41:56,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54870a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:41:56, skipping insertion in model container [2024-01-31 17:41:56,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:41:53" (2/4) ... [2024-01-31 17:41:56,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54870a01 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:41:56, skipping insertion in model container [2024-01-31 17:41:56,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:41:55" (3/4) ... [2024-01-31 17:41:56,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54870a01 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:41:56, skipping insertion in model container [2024-01-31 17:41:56,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:41:56" (4/4) ... [2024-01-31 17:41:56,511 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2024-01-31 17:41:56,525 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:41:56,525 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-01-31 17:41:56,525 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:41:56,560 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-31 17:41:56,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 98 flow [2024-01-31 17:41:56,625 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2024-01-31 17:41:56,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:41:56,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 1/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-01-31 17:41:56,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 98 flow [2024-01-31 17:41:56,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 89 flow [2024-01-31 17:41:56,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:41:56,646 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;@1865bc2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:41:56,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-01-31 17:41:56,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:41:56,655 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-01-31 17:41:56,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:41:56,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:56,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:41:56,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:41:56,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash -74088847, now seen corresponding path program 1 times [2024-01-31 17:41:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115993160] [2024-01-31 17:41:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:56,881 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:41:56,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:56,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115993160] [2024-01-31 17:41:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115993160] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:56,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:56,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:41:56,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549190352] [2024-01-31 17:41:56,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:56,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-31 17:41:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-31 17:41:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-31 17:41:56,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2024-01-31 17:41:56,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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:41:56,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:56,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2024-01-31 17:41:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:57,092 INFO L124 PetriNetUnfolderBase]: 400/839 cut-off events. [2024-01-31 17:41:57,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:41:57,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 839 events. 400/839 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6245 event pairs, 400 based on Foata normal form. 30/744 useless extension candidates. Maximal degree in co-relation 1478. Up to 628 conditions per place. [2024-01-31 17:41:57,101 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 19 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-01-31 17:41:57,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 123 flow [2024-01-31 17:41:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-31 17:41:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-31 17:41:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2024-01-31 17:41:57,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2024-01-31 17:41:57,111 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 2 states and 65 transitions. [2024-01-31 17:41:57,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 123 flow [2024-01-31 17:41:57,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-31 17:41:57,115 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 82 flow [2024-01-31 17:41:57,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-01-31 17:41:57,119 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-01-31 17:41:57,119 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 82 flow [2024-01-31 17:41:57,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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:41:57,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:57,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:41:57,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:41:57,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:41:57,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -74088846, now seen corresponding path program 1 times [2024-01-31 17:41:57,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:57,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837671620] [2024-01-31 17:41:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:57,378 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:41:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837671620] [2024-01-31 17:41:57,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837671620] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:57,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:57,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 17:41:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292745795] [2024-01-31 17:41:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:57,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:41:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:57,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:41:57,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:41:57,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2024-01-31 17:41:57,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:41:57,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:57,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2024-01-31 17:41:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:57,495 INFO L124 PetriNetUnfolderBase]: 315/640 cut-off events. [2024-01-31 17:41:57,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 17:41:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 640 events. 315/640 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4237 event pairs, 60 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1158. Up to 382 conditions per place. [2024-01-31 17:41:57,500 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-01-31 17:41:57,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 152 flow [2024-01-31 17:41:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:41:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:41:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-01-31 17:41:57,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2024-01-31 17:41:57,502 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 82 flow. Second operand 3 states and 94 transitions. [2024-01-31 17:41:57,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 152 flow [2024-01-31 17:41:57,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 17:41:57,504 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 82 flow [2024-01-31 17:41:57,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-01-31 17:41:57,505 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-01-31 17:41:57,505 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 82 flow [2024-01-31 17:41:57,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:41:57,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:57,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:41:57,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:41:57,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:41:57,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -500927804, now seen corresponding path program 1 times [2024-01-31 17:41:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488026316] [2024-01-31 17:41:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:57,550 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:41:57,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:57,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488026316] [2024-01-31 17:41:57,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488026316] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:57,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:57,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:41:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013616517] [2024-01-31 17:41:57,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:57,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:41:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:57,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:41:57,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:41:57,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-01-31 17:41:57,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:41:57,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:57,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-01-31 17:41:57,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:57,649 INFO L124 PetriNetUnfolderBase]: 407/720 cut-off events. [2024-01-31 17:41:57,649 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-01-31 17:41:57,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 720 events. 407/720 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5055 event pairs, 315 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 1433. Up to 501 conditions per place. [2024-01-31 17:41:57,654 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 24 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-01-31 17:41:57,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 146 flow [2024-01-31 17:41:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:41:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:41:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-01-31 17:41:57,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2024-01-31 17:41:57,656 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 82 flow. Second operand 3 states and 81 transitions. [2024-01-31 17:41:57,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 146 flow [2024-01-31 17:41:57,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:41:57,657 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 76 flow [2024-01-31 17:41:57,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-01-31 17:41:57,658 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2024-01-31 17:41:57,659 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 76 flow [2024-01-31 17:41:57,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:41:57,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:57,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:41:57,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:41:57,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:41:57,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:57,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1651107605, now seen corresponding path program 1 times [2024-01-31 17:41:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:57,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697680971] [2024-01-31 17:41:57,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:57,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:58,306 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:41:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:58,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697680971] [2024-01-31 17:41:58,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697680971] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:58,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:58,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:41:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541684347] [2024-01-31 17:41:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:41:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:41:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:41:58,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-01-31 17:41:58,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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:41:58,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:58,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-01-31 17:41:58,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:58,852 INFO L124 PetriNetUnfolderBase]: 1416/2398 cut-off events. [2024-01-31 17:41:58,852 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-01-31 17:41:58,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 2398 events. 1416/2398 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15917 event pairs, 297 based on Foata normal form. 71/2459 useless extension candidates. Maximal degree in co-relation 4623. Up to 1475 conditions per place. [2024-01-31 17:41:58,865 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 37 selfloop transitions, 9 changer transitions 45/103 dead transitions. [2024-01-31 17:41:58,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 103 transitions, 402 flow [2024-01-31 17:41:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:41:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:41:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 244 transitions. [2024-01-31 17:41:58,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5674418604651162 [2024-01-31 17:41:58,870 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 76 flow. Second operand 10 states and 244 transitions. [2024-01-31 17:41:58,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 103 transitions, 402 flow [2024-01-31 17:41:58,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 103 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:41:58,877 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 155 flow [2024-01-31 17:41:58,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=155, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2024-01-31 17:41:58,878 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2024-01-31 17:41:58,878 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 155 flow [2024-01-31 17:41:58,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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:41:58,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:58,879 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:41:58,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 17:41:58,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:41:58,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1790116204, now seen corresponding path program 1 times [2024-01-31 17:41:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564272298] [2024-01-31 17:41:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:41:59,305 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:41:59,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:41:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564272298] [2024-01-31 17:41:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564272298] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:41:59,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:41:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:41:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033550112] [2024-01-31 17:41:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:41:59,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:41:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:41:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:41:59,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:41:59,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-01-31 17:41:59,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:41:59,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:41:59,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-01-31 17:41:59,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:41:59,682 INFO L124 PetriNetUnfolderBase]: 1329/2342 cut-off events. [2024-01-31 17:41:59,683 INFO L125 PetriNetUnfolderBase]: For 3121/3263 co-relation queries the response was YES. [2024-01-31 17:41:59,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6985 conditions, 2342 events. 1329/2342 cut-off events. For 3121/3263 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15572 event pairs, 672 based on Foata normal form. 116/2352 useless extension candidates. Maximal degree in co-relation 6973. Up to 1511 conditions per place. [2024-01-31 17:41:59,700 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 28 selfloop transitions, 3 changer transitions 27/76 dead transitions. [2024-01-31 17:41:59,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 397 flow [2024-01-31 17:41:59,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:41:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:41:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-01-31 17:41:59,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-01-31 17:41:59,708 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 155 flow. Second operand 7 states and 172 transitions. [2024-01-31 17:41:59,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 397 flow [2024-01-31 17:41:59,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 381 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-01-31 17:41:59,720 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 182 flow [2024-01-31 17:41:59,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-01-31 17:41:59,722 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-01-31 17:41:59,722 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 182 flow [2024-01-31 17:41:59,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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:41:59,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:41:59,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:41:59,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 17:41:59,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:41:59,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:41:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash -223479436, now seen corresponding path program 1 times [2024-01-31 17:41:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:41:59,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763647075] [2024-01-31 17:41:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:41:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:41:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:00,203 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:42:00,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:00,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763647075] [2024-01-31 17:42:00,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763647075] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:00,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:00,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 17:42:00,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499778801] [2024-01-31 17:42:00,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:00,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:42:00,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:00,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:42:00,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:42:00,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2024-01-31 17:42:00,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:42:00,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:00,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2024-01-31 17:42:00,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:00,706 INFO L124 PetriNetUnfolderBase]: 2041/3608 cut-off events. [2024-01-31 17:42:00,707 INFO L125 PetriNetUnfolderBase]: For 5941/5941 co-relation queries the response was YES. [2024-01-31 17:42:00,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11670 conditions, 3608 events. 2041/3608 cut-off events. For 5941/5941 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 25638 event pairs, 518 based on Foata normal form. 84/3676 useless extension candidates. Maximal degree in co-relation 11656. Up to 1425 conditions per place. [2024-01-31 17:42:00,725 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 43 selfloop transitions, 10 changer transitions 29/95 dead transitions. [2024-01-31 17:42:00,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 601 flow [2024-01-31 17:42:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:42:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:42:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-01-31 17:42:00,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2024-01-31 17:42:00,727 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 182 flow. Second operand 8 states and 196 transitions. [2024-01-31 17:42:00,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 601 flow [2024-01-31 17:42:00,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 585 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-01-31 17:42:00,736 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 254 flow [2024-01-31 17:42:00,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=254, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2024-01-31 17:42:00,737 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2024-01-31 17:42:00,737 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 254 flow [2024-01-31 17:42:00,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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:42:00,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:00,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:42:00,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 17:42:00,738 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:42:00,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1581413673, now seen corresponding path program 1 times [2024-01-31 17:42:00,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:00,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085485880] [2024-01-31 17:42:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:00,819 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:42:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085485880] [2024-01-31 17:42:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085485880] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:42:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573051223] [2024-01-31 17:42:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:00,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:42:00,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:00,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:42:00,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:42:00,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-01-31 17:42:00,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:42:00,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:00,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-01-31 17:42:00,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:01,282 INFO L124 PetriNetUnfolderBase]: 2850/4868 cut-off events. [2024-01-31 17:42:01,283 INFO L125 PetriNetUnfolderBase]: For 9056/9362 co-relation queries the response was YES. [2024-01-31 17:42:01,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15059 conditions, 4868 events. 2850/4868 cut-off events. For 9056/9362 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 32862 event pairs, 502 based on Foata normal form. 308/4940 useless extension candidates. Maximal degree in co-relation 15041. Up to 2464 conditions per place. [2024-01-31 17:42:01,317 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 49 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2024-01-31 17:42:01,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 479 flow [2024-01-31 17:42:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:42:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:42:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-01-31 17:42:01,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2024-01-31 17:42:01,319 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 254 flow. Second operand 4 states and 116 transitions. [2024-01-31 17:42:01,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 479 flow [2024-01-31 17:42:01,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 452 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-01-31 17:42:01,348 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 258 flow [2024-01-31 17:42:01,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2024-01-31 17:42:01,349 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2024-01-31 17:42:01,349 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 258 flow [2024-01-31 17:42:01,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:42:01,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:01,349 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] [2024-01-31 17:42:01,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 17:42:01,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:42:01,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash 810955132, now seen corresponding path program 1 times [2024-01-31 17:42:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:01,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626792696] [2024-01-31 17:42:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:01,953 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:42:01,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:01,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626792696] [2024-01-31 17:42:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626792696] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:01,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:01,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:42:01,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797089844] [2024-01-31 17:42:01,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:01,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:42:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:01,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:42:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:42:01,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-01-31 17:42:01,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 258 flow. Second operand has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 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:42:01,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:01,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-01-31 17:42:01,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:02,510 INFO L124 PetriNetUnfolderBase]: 2017/3701 cut-off events. [2024-01-31 17:42:02,510 INFO L125 PetriNetUnfolderBase]: For 6082/6312 co-relation queries the response was YES. [2024-01-31 17:42:02,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11935 conditions, 3701 events. 2017/3701 cut-off events. For 6082/6312 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26726 event pairs, 650 based on Foata normal form. 112/3584 useless extension candidates. Maximal degree in co-relation 11919. Up to 2409 conditions per place. [2024-01-31 17:42:02,534 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 44 selfloop transitions, 11 changer transitions 10/88 dead transitions. [2024-01-31 17:42:02,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 576 flow [2024-01-31 17:42:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:42:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:42:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-01-31 17:42:02,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.561046511627907 [2024-01-31 17:42:02,536 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 258 flow. Second operand 8 states and 193 transitions. [2024-01-31 17:42:02,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 576 flow [2024-01-31 17:42:02,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 568 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-31 17:42:02,541 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 330 flow [2024-01-31 17:42:02,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=330, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2024-01-31 17:42:02,543 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2024-01-31 17:42:02,543 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 330 flow [2024-01-31 17:42:02,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.875) internal successors, (151), 8 states have internal predecessors, (151), 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:42:02,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:02,543 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] [2024-01-31 17:42:02,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 17:42:02,544 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:42:02,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1279725610, now seen corresponding path program 1 times [2024-01-31 17:42:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693824624] [2024-01-31 17:42:02,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:02,664 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:42:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693824624] [2024-01-31 17:42:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693824624] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:02,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:02,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:42:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157605396] [2024-01-31 17:42:02,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:02,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:42:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:02,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:42:02,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:42:02,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-01-31 17:42:02,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:42:02,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:02,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-01-31 17:42:02,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:02,992 INFO L124 PetriNetUnfolderBase]: 2027/3459 cut-off events. [2024-01-31 17:42:02,992 INFO L125 PetriNetUnfolderBase]: For 6539/7363 co-relation queries the response was YES. [2024-01-31 17:42:02,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11448 conditions, 3459 events. 2027/3459 cut-off events. For 6539/7363 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21525 event pairs, 268 based on Foata normal form. 272/3540 useless extension candidates. Maximal degree in co-relation 11429. Up to 1069 conditions per place. [2024-01-31 17:42:03,006 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 56 selfloop transitions, 8 changer transitions 8/91 dead transitions. [2024-01-31 17:42:03,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 651 flow [2024-01-31 17:42:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:42:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:42:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-01-31 17:42:03,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6837209302325581 [2024-01-31 17:42:03,008 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 330 flow. Second operand 5 states and 147 transitions. [2024-01-31 17:42:03,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 651 flow [2024-01-31 17:42:03,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 596 flow, removed 23 selfloop flow, removed 2 redundant places. [2024-01-31 17:42:03,013 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 310 flow [2024-01-31 17:42:03,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2024-01-31 17:42:03,014 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-01-31 17:42:03,014 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 310 flow [2024-01-31 17:42:03,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:42:03,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:03,014 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] [2024-01-31 17:42:03,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 17:42:03,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:42:03,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1968861074, now seen corresponding path program 1 times [2024-01-31 17:42:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:03,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003987949] [2024-01-31 17:42:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:03,126 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:42:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003987949] [2024-01-31 17:42:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003987949] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:42:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549836444] [2024-01-31 17:42:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:03,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:42:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:03,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:42:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:42:03,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-01-31 17:42:03,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 54 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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:42:03,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:03,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-01-31 17:42:03,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:03,406 INFO L124 PetriNetUnfolderBase]: 1547/2599 cut-off events. [2024-01-31 17:42:03,406 INFO L125 PetriNetUnfolderBase]: For 7133/8802 co-relation queries the response was YES. [2024-01-31 17:42:03,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9654 conditions, 2599 events. 1547/2599 cut-off events. For 7133/8802 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 15578 event pairs, 230 based on Foata normal form. 183/2598 useless extension candidates. Maximal degree in co-relation 9633. Up to 976 conditions per place. [2024-01-31 17:42:03,418 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 44 selfloop transitions, 11 changer transitions 12/83 dead transitions. [2024-01-31 17:42:03,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 559 flow [2024-01-31 17:42:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:42:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:42:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2024-01-31 17:42:03,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6356589147286822 [2024-01-31 17:42:03,420 INFO L175 Difference]: Start difference. First operand has 76 places, 54 transitions, 310 flow. Second operand 6 states and 164 transitions. [2024-01-31 17:42:03,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 559 flow [2024-01-31 17:42:03,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 505 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-01-31 17:42:03,426 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 282 flow [2024-01-31 17:42:03,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2024-01-31 17:42:03,427 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2024-01-31 17:42:03,427 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 282 flow [2024-01-31 17:42:03,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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:42:03,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:03,428 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] [2024-01-31 17:42:03,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 17:42:03,428 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:42:03,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1461867194, now seen corresponding path program 1 times [2024-01-31 17:42:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:03,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139046268] [2024-01-31 17:42:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:03,841 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:42:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139046268] [2024-01-31 17:42:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139046268] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-31 17:42:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950996307] [2024-01-31 17:42:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:03,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-31 17:42:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:03,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-31 17:42:03,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-31 17:42:03,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-01-31 17:42:03,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:42:03,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:03,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-01-31 17:42:03,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:04,162 INFO L124 PetriNetUnfolderBase]: 791/1712 cut-off events. [2024-01-31 17:42:04,162 INFO L125 PetriNetUnfolderBase]: For 3676/3967 co-relation queries the response was YES. [2024-01-31 17:42:04,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5195 conditions, 1712 events. 791/1712 cut-off events. For 3676/3967 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11749 event pairs, 195 based on Foata normal form. 33/1584 useless extension candidates. Maximal degree in co-relation 5178. Up to 631 conditions per place. [2024-01-31 17:42:04,169 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 24 selfloop transitions, 6 changer transitions 39/89 dead transitions. [2024-01-31 17:42:04,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 568 flow [2024-01-31 17:42:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 17:42:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 17:42:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-01-31 17:42:04,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145348837209303 [2024-01-31 17:42:04,171 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 282 flow. Second operand 8 states and 177 transitions. [2024-01-31 17:42:04,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 568 flow [2024-01-31 17:42:04,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 506 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-01-31 17:42:04,179 INFO L231 Difference]: Finished difference. Result has 76 places, 45 transitions, 232 flow [2024-01-31 17:42:04,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=232, PETRI_PLACES=76, PETRI_TRANSITIONS=45} [2024-01-31 17:42:04,180 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2024-01-31 17:42:04,180 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 45 transitions, 232 flow [2024-01-31 17:42:04,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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:42:04,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:04,180 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] [2024-01-31 17:42:04,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 17:42:04,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:42:04,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1720991882, now seen corresponding path program 2 times [2024-01-31 17:42:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6620300] [2024-01-31 17:42:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:42:04,847 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:42:04,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:42:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6620300] [2024-01-31 17:42:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6620300] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:42:04,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:42:04,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-31 17:42:04,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541150487] [2024-01-31 17:42:04,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:42:04,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-31 17:42:04,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:42:04,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-31 17:42:04,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:42:04,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-01-31 17:42:04,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 45 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 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:42:04,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:42:04,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-01-31 17:42:04,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:42:05,096 INFO L124 PetriNetUnfolderBase]: 467/966 cut-off events. [2024-01-31 17:42:05,096 INFO L125 PetriNetUnfolderBase]: For 1040/1129 co-relation queries the response was YES. [2024-01-31 17:42:05,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 966 events. 467/966 cut-off events. For 1040/1129 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5620 event pairs, 163 based on Foata normal form. 18/856 useless extension candidates. Maximal degree in co-relation 2640. Up to 364 conditions per place. [2024-01-31 17:42:05,100 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 22 selfloop transitions, 3 changer transitions 14/62 dead transitions. [2024-01-31 17:42:05,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 364 flow [2024-01-31 17:42:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 17:42:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 17:42:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-01-31 17:42:05,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521594684385382 [2024-01-31 17:42:05,102 INFO L175 Difference]: Start difference. First operand has 76 places, 45 transitions, 232 flow. Second operand 7 states and 157 transitions. [2024-01-31 17:42:05,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 364 flow [2024-01-31 17:42:05,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 331 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-01-31 17:42:05,105 INFO L231 Difference]: Finished difference. Result has 72 places, 43 transitions, 213 flow [2024-01-31 17:42:05,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=213, PETRI_PLACES=72, PETRI_TRANSITIONS=43} [2024-01-31 17:42:05,106 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2024-01-31 17:42:05,106 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 43 transitions, 213 flow [2024-01-31 17:42:05,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 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:42:05,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:42:05,107 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] [2024-01-31 17:42:05,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-31 17:42:05,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P2Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-01-31 17:42:05,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:42:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1432044172, now seen corresponding path program 3 times [2024-01-31 17:42:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:42:05,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869372189] [2024-01-31 17:42:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:42:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:42:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:42:05,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-31 17:42:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-31 17:42:05,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-31 17:42:05,208 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-31 17:42:05,209 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-01-31 17:42:05,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 9 remaining) [2024-01-31 17:42:05,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-01-31 17:42:05,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-01-31 17:42:05,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-01-31 17:42:05,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-01-31 17:42:05,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-01-31 17:42:05,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 9 remaining) [2024-01-31 17:42:05,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-01-31 17:42:05,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 17:42:05,212 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:42:05,217 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-31 17:42:05,217 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-31 17:42:05,291 INFO L503 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-01-31 17:42:05,292 INFO L504 ceAbstractionStarter]: WitnessConsidered=2 [2024-01-31 17:42:05,292 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:42:05 BasicIcfg [2024-01-31 17:42:05,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-31 17:42:05,293 INFO L158 Benchmark]: Toolchain (without parser) took 11380.18ms. Allocated memory was 174.1MB in the beginning and 721.4MB in the end (delta: 547.4MB). Free memory was 109.7MB in the beginning and 438.6MB in the end (delta: -329.0MB). Peak memory consumption was 218.1MB. Max. memory is 16.1GB. [2024-01-31 17:42:05,293 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 121.6MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:42:05,294 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:42:05,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1814.48ms. Allocated memory was 174.1MB in the beginning and 270.5MB in the end (delta: 96.5MB). Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.1MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2024-01-31 17:42:05,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.61ms. Allocated memory is still 270.5MB. Free memory was 107.6MB in the beginning and 105.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:42:05,296 INFO L158 Benchmark]: Boogie Preprocessor took 69.15ms. Allocated memory is still 270.5MB. Free memory was 105.5MB in the beginning and 102.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:42:05,296 INFO L158 Benchmark]: RCFGBuilder took 638.59ms. Allocated memory is still 270.5MB. Free memory was 102.3MB in the beginning and 180.6MB in the end (delta: -78.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-31 17:42:05,296 INFO L158 Benchmark]: TraceAbstraction took 8787.24ms. Allocated memory was 270.5MB in the beginning and 721.4MB in the end (delta: 450.9MB). Free memory was 179.5MB in the beginning and 438.6MB in the end (delta: -259.1MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. [2024-01-31 17:42:05,298 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 121.6MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1814.48ms. Allocated memory was 174.1MB in the beginning and 270.5MB in the end (delta: 96.5MB). Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.1MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.61ms. Allocated memory is still 270.5MB. Free memory was 107.6MB in the beginning and 105.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.15ms. Allocated memory is still 270.5MB. Free memory was 105.5MB in the beginning and 102.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 638.59ms. Allocated memory is still 270.5MB. Free memory was 102.3MB in the beginning and 180.6MB in the end (delta: -78.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8787.24ms. Allocated memory was 270.5MB in the beginning and 721.4MB in the end (delta: 450.9MB). Free memory was 179.5MB in the beginning and 438.6MB in the end (delta: -259.1MB). Peak memory consumption was 191.8MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[expression],IntegerLiteral[0]]]] VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - 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: 820]: 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: 818]: 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: 816]: 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 7 procedures, 70 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 498 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1213 IncrementalHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 33 mSDtfsCounter, 1213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=8, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-31 17:42:05,330 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