./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c --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/bench-exp2x4.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 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/weaver/bench-exp2x4.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x4.wvr.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-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:07:25,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:07:25,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:07:25,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:07:25,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:07:25,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:07:25,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:07:25,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:07:25,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:07:25,854 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:07:25,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:07:25,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:07:25,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:07:25,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:07:25,856 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:07:25,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:07:25,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:07:25,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:07:25,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:07:25,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:07:25,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:07:25,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:07:25,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:07:25,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:07:25,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:07:25,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:07:25,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:07:25,859 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:07:25,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:07:25,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:07:25,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:07:25,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:07:25,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:07:25,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:07:25,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:07:25,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:07:25,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:07:25,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:07:25,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:07:25,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:07:25,862 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:07:25,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:07:25,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:07:25,863 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 16:07:26,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:07:26,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:07:26,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:07:26,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:07:26,130 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:07:26,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-01-31 16:07:27,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:07:27,672 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:07:27,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-01-31 16:07:27,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b841934/e6ef35feefff46a1b05d2f4dc9d38030/FLAGd219de408 [2024-01-31 16:07:27,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b841934/e6ef35feefff46a1b05d2f4dc9d38030 [2024-01-31 16:07:27,696 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:07:27,697 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:07:27,697 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/bench-exp2x4.wvr.yml/witness.yml [2024-01-31 16:07:27,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:07:27,785 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:07:27,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:07:27,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:07:27,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:07:27,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:07:27" (1/2) ... [2024-01-31 16:07:27,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6168c5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:07:27, skipping insertion in model container [2024-01-31 16:07:27,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:07:27" (1/2) ... [2024-01-31 16:07:27,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@69ccf3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:07:27, skipping insertion in model container [2024-01-31 16:07:27,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:07:27" (2/2) ... [2024-01-31 16:07:27,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6168c5fc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:07:27, skipping insertion in model container [2024-01-31 16:07:27,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:07:27" (2/2) ... [2024-01-31 16:07:27,795 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:07:27,822 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:07:27,823 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((x3 == 0U) && (x4 == 0U)) && (n == 0U) [2024-01-31 16:07:27,824 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,824 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,824 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((x2 == 0U) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-01-31 16:07:27,824 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (((((((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && ((long long )x1 - (long long )x3 >= 0LL)) && (x1 == 0U)) && (x2 == 0U)) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-01-31 16:07:27,825 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,825 INFO L98 nessWitnessExtractor]: Loop invariant at [L56-L56] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,825 INFO L98 nessWitnessExtractor]: Loop invariant at [L65-L65] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,825 INFO L98 nessWitnessExtractor]: Location invariant before [L40-L40] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,825 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,825 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L38] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,825 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (x4 == 0U) && (n == 0U) [2024-01-31 16:07:27,825 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,826 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,826 INFO L98 nessWitnessExtractor]: Loop invariant at [L47-L47] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,826 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,826 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,826 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,826 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,826 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] n == 0U [2024-01-31 16:07:27,827 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-31 16:07:27,844 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:07:28,006 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-01-31 16:07:28,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:07:28,023 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:07:28,102 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2361,2374] [2024-01-31 16:07:28,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:07:28,114 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:07:28,115 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:07:28 WrapperNode [2024-01-31 16:07:28,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:07:28,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:07:28,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:07:28,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:07:28,122 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,138 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,160 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-01-31 16:07:28,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:07:28,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:07:28,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:07:28,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:07:28,169 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,170 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,179 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,201 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 16:07:28,202 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,202 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,219 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,223 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,227 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,229 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:07:28,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:07:28,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:07:28,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:07:28,236 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 04:07:28" (1/1) ... [2024-01-31 16:07:28,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:07:28,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:07:28,261 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 16:07:28,280 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 16:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:07:28,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:07:28,292 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:07:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:07:28,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:07:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 16:07:28,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 16:07:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-31 16:07:28,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-31 16:07:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:07:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:07:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:07:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:07:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 16:07:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:07:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:07:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:07:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:07:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:07:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 16:07:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:07:28,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:07:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:07:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:07:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:07:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:07:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 16:07:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:07:28,297 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 16:07:28,379 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:07:28,380 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:07:28,858 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:07:28,858 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:07:28,939 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:07:28,939 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-31 16:07:28,939 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:07:28 BoogieIcfgContainer [2024-01-31 16:07:28,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:07:28,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:07:28,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:07:28,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:07:28,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:07:27" (1/4) ... [2024-01-31 16:07:28,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e15c769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:07:28, skipping insertion in model container [2024-01-31 16:07:28,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:07:27" (2/4) ... [2024-01-31 16:07:28,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e15c769 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:07:28, skipping insertion in model container [2024-01-31 16:07:28,944 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 04:07:28" (3/4) ... [2024-01-31 16:07:28,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e15c769 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:07:28, skipping insertion in model container [2024-01-31 16:07:28,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:07:28" (4/4) ... [2024-01-31 16:07:28,946 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-01-31 16:07:28,959 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:07:28,960 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-01-31 16:07:28,960 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:07:29,038 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-31 16:07:29,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 190 flow [2024-01-31 16:07:29,088 INFO L124 PetriNetUnfolderBase]: 8/77 cut-off events. [2024-01-31 16:07:29,089 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-31 16:07:29,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 77 events. 8/77 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 188 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2024-01-31 16:07:29,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 81 transitions, 190 flow [2024-01-31 16:07:29,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 176 flow [2024-01-31 16:07:29,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:07:29,107 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;@2e89c0a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:07:29,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-01-31 16:07:29,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:07:29,109 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:07:29,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:07:29,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:29,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:07:29,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:29,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash 11727, now seen corresponding path program 1 times [2024-01-31 16:07:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:29,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255641564] [2024-01-31 16:07:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:29,475 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 16:07:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255641564] [2024-01-31 16:07:29,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255641564] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:29,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:29,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:07:29,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112896884] [2024-01-31 16:07:29,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:29,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:07:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:07:29,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:07:29,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 81 [2024-01-31 16:07:29,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 16:07:29,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:29,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 81 [2024-01-31 16:07:29,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:30,779 INFO L124 PetriNetUnfolderBase]: 7159/12076 cut-off events. [2024-01-31 16:07:30,779 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-01-31 16:07:30,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21533 conditions, 12076 events. 7159/12076 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94775 event pairs, 4547 based on Foata normal form. 2553/13440 useless extension candidates. Maximal degree in co-relation 18658. Up to 8983 conditions per place. [2024-01-31 16:07:30,878 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 40 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-01-31 16:07:30,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 250 flow [2024-01-31 16:07:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:07:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:07:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-01-31 16:07:30,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6008230452674898 [2024-01-31 16:07:30,891 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 176 flow. Second operand 3 states and 146 transitions. [2024-01-31 16:07:30,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 250 flow [2024-01-31 16:07:30,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 234 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-31 16:07:30,913 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 154 flow [2024-01-31 16:07:30,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2024-01-31 16:07:30,917 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -7 predicate places. [2024-01-31 16:07:30,918 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 154 flow [2024-01-31 16:07:30,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 16:07:30,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:30,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:07:30,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:07:30,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:30,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash 363897, now seen corresponding path program 1 times [2024-01-31 16:07:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:30,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872844356] [2024-01-31 16:07:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:31,015 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 16:07:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872844356] [2024-01-31 16:07:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872844356] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:31,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:31,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:07:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039404068] [2024-01-31 16:07:31,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:31,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:07:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:07:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:07:31,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 81 [2024-01-31 16:07:31,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 16:07:31,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:31,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 81 [2024-01-31 16:07:31,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:31,895 INFO L124 PetriNetUnfolderBase]: 7159/12075 cut-off events. [2024-01-31 16:07:31,895 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-31 16:07:31,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21218 conditions, 12075 events. 7159/12075 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94722 event pairs, 4547 based on Foata normal form. 0/10887 useless extension candidates. Maximal degree in co-relation 21209. Up to 8981 conditions per place. [2024-01-31 16:07:31,968 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 39 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-01-31 16:07:31,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 234 flow [2024-01-31 16:07:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:07:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:07:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2024-01-31 16:07:31,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-01-31 16:07:31,970 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 154 flow. Second operand 3 states and 144 transitions. [2024-01-31 16:07:31,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 234 flow [2024-01-31 16:07:31,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:31,972 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 152 flow [2024-01-31 16:07:31,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-01-31 16:07:31,973 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -8 predicate places. [2024-01-31 16:07:31,973 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 152 flow [2024-01-31 16:07:31,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 16:07:31,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:31,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:07:31,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:07:31,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:31,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:31,975 INFO L85 PathProgramCache]: Analyzing trace with hash 11281214, now seen corresponding path program 1 times [2024-01-31 16:07:31,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:31,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845110018] [2024-01-31 16:07:31,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:31,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:32,011 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 16:07:32,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:32,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845110018] [2024-01-31 16:07:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845110018] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:32,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:07:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076858994] [2024-01-31 16:07:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:32,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:07:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:07:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:07:32,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2024-01-31 16:07:32,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 16:07:32,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:32,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2024-01-31 16:07:32,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:32,866 INFO L124 PetriNetUnfolderBase]: 7159/12074 cut-off events. [2024-01-31 16:07:32,866 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-31 16:07:32,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21216 conditions, 12074 events. 7159/12074 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94742 event pairs, 4547 based on Foata normal form. 0/10887 useless extension candidates. Maximal degree in co-relation 21205. Up to 8979 conditions per place. [2024-01-31 16:07:32,940 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 38 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-01-31 16:07:32,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 230 flow [2024-01-31 16:07:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:07:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:07:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-01-31 16:07:32,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6008230452674898 [2024-01-31 16:07:32,945 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 152 flow. Second operand 3 states and 146 transitions. [2024-01-31 16:07:32,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 230 flow [2024-01-31 16:07:32,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 69 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:32,948 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 150 flow [2024-01-31 16:07:32,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-01-31 16:07:32,950 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -9 predicate places. [2024-01-31 16:07:32,950 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 150 flow [2024-01-31 16:07:32,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 16:07:32,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:32,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:07:32,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:07:32,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:32,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash 349717991, now seen corresponding path program 1 times [2024-01-31 16:07:32,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:32,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779207983] [2024-01-31 16:07:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:33,082 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 16:07:33,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:33,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779207983] [2024-01-31 16:07:33,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779207983] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:33,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:07:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191538321] [2024-01-31 16:07:33,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:33,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:07:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:33,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:07:33,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:07:33,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 81 [2024-01-31 16:07:33,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 16:07:33,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:33,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 81 [2024-01-31 16:07:33,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:33,806 INFO L124 PetriNetUnfolderBase]: 7159/12073 cut-off events. [2024-01-31 16:07:33,807 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-31 16:07:33,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21214 conditions, 12073 events. 7159/12073 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94724 event pairs, 4547 based on Foata normal form. 0/10887 useless extension candidates. Maximal degree in co-relation 21201. Up to 8977 conditions per place. [2024-01-31 16:07:33,887 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 37 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-01-31 16:07:33,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 226 flow [2024-01-31 16:07:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:07:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:07:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-01-31 16:07:33,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6090534979423868 [2024-01-31 16:07:33,889 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 150 flow. Second operand 3 states and 148 transitions. [2024-01-31 16:07:33,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 226 flow [2024-01-31 16:07:33,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:33,892 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 148 flow [2024-01-31 16:07:33,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2024-01-31 16:07:33,894 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -10 predicate places. [2024-01-31 16:07:33,894 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 148 flow [2024-01-31 16:07:33,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 16:07:33,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:33,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-31 16:07:33,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:07:33,895 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:33,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:33,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2043643756, now seen corresponding path program 1 times [2024-01-31 16:07:33,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:33,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918736973] [2024-01-31 16:07:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:33,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:33,927 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 16:07:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918736973] [2024-01-31 16:07:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918736973] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:33,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:33,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:07:33,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865346186] [2024-01-31 16:07:33,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:33,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:07:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:33,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:07:33,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:07:33,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-01-31 16:07:33,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 16:07:33,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:33,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-01-31 16:07:33,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:34,558 INFO L124 PetriNetUnfolderBase]: 7159/12072 cut-off events. [2024-01-31 16:07:34,559 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-31 16:07:34,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21212 conditions, 12072 events. 7159/12072 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 94718 event pairs, 4547 based on Foata normal form. 0/10887 useless extension candidates. Maximal degree in co-relation 21197. Up to 8975 conditions per place. [2024-01-31 16:07:34,637 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 36 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-01-31 16:07:34,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 222 flow [2024-01-31 16:07:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:07:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:07:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2024-01-31 16:07:34,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2024-01-31 16:07:34,639 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 148 flow. Second operand 3 states and 150 transitions. [2024-01-31 16:07:34,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 222 flow [2024-01-31 16:07:34,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:34,641 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 146 flow [2024-01-31 16:07:34,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-01-31 16:07:34,641 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -11 predicate places. [2024-01-31 16:07:34,641 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 146 flow [2024-01-31 16:07:34,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 16:07:34,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:34,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:34,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:07:34,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:34,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1029244279, now seen corresponding path program 1 times [2024-01-31 16:07:34,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85551315] [2024-01-31 16:07:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:34,717 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 16:07:34,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:34,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85551315] [2024-01-31 16:07:34,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85551315] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:34,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:34,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:07:34,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782610775] [2024-01-31 16:07:34,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:34,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:34,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:34,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:34,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:34,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-01-31 16:07:34,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 16:07:34,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:34,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-01-31 16:07:34,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:35,086 INFO L124 PetriNetUnfolderBase]: 3215/5330 cut-off events. [2024-01-31 16:07:35,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:07:35,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9478 conditions, 5330 events. 3215/5330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 37041 event pairs, 271 based on Foata normal form. 170/4841 useless extension candidates. Maximal degree in co-relation 9461. Up to 3435 conditions per place. [2024-01-31 16:07:35,122 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 49 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-01-31 16:07:35,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 275 flow [2024-01-31 16:07:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:07:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:07:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2024-01-31 16:07:35,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6265432098765432 [2024-01-31 16:07:35,124 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 146 flow. Second operand 4 states and 203 transitions. [2024-01-31 16:07:35,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 275 flow [2024-01-31 16:07:35,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 79 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:35,126 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 138 flow [2024-01-31 16:07:35,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-01-31 16:07:35,127 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -14 predicate places. [2024-01-31 16:07:35,127 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 138 flow [2024-01-31 16:07:35,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 16:07:35,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:35,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:35,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:07:35,128 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:35,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1262851629, now seen corresponding path program 1 times [2024-01-31 16:07:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:35,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318848123] [2024-01-31 16:07:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:35,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:35,197 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 16:07:35,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:35,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318848123] [2024-01-31 16:07:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318848123] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:35,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:35,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:07:35,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046234001] [2024-01-31 16:07:35,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:35,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:35,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:35,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:35,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-01-31 16:07:35,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 16:07:35,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:35,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-01-31 16:07:35,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:35,563 INFO L124 PetriNetUnfolderBase]: 3186/5869 cut-off events. [2024-01-31 16:07:35,563 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-01-31 16:07:35,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9988 conditions, 5869 events. 3186/5869 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 44156 event pairs, 968 based on Foata normal form. 200/5334 useless extension candidates. Maximal degree in co-relation 9967. Up to 3278 conditions per place. [2024-01-31 16:07:35,596 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 52 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-01-31 16:07:35,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 279 flow [2024-01-31 16:07:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:07:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:07:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2024-01-31 16:07:35,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-01-31 16:07:35,598 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 138 flow. Second operand 4 states and 206 transitions. [2024-01-31 16:07:35,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 279 flow [2024-01-31 16:07:35,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:35,600 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 131 flow [2024-01-31 16:07:35,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-01-31 16:07:35,601 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -17 predicate places. [2024-01-31 16:07:35,602 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 131 flow [2024-01-31 16:07:35,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 16:07:35,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:35,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:35,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:07:35,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:35,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1873504155, now seen corresponding path program 1 times [2024-01-31 16:07:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:35,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910113281] [2024-01-31 16:07:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:35,695 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 16:07:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910113281] [2024-01-31 16:07:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910113281] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:07:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814820201] [2024-01-31 16:07:35,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:35,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:35,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:35,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-01-31 16:07:35,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 16:07:35,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:35,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-01-31 16:07:35,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:36,037 INFO L124 PetriNetUnfolderBase]: 3146/5099 cut-off events. [2024-01-31 16:07:36,038 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-01-31 16:07:36,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9177 conditions, 5099 events. 3146/5099 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 33793 event pairs, 126 based on Foata normal form. 200/4775 useless extension candidates. Maximal degree in co-relation 9157. Up to 3162 conditions per place. [2024-01-31 16:07:36,065 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 55 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-01-31 16:07:36,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 284 flow [2024-01-31 16:07:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:07:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:07:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2024-01-31 16:07:36,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6450617283950617 [2024-01-31 16:07:36,067 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 131 flow. Second operand 4 states and 209 transitions. [2024-01-31 16:07:36,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 284 flow [2024-01-31 16:07:36,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:36,069 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 124 flow [2024-01-31 16:07:36,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-01-31 16:07:36,071 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -20 predicate places. [2024-01-31 16:07:36,071 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 124 flow [2024-01-31 16:07:36,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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 16:07:36,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:36,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:36,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:07:36,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:36,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash 845398480, now seen corresponding path program 1 times [2024-01-31 16:07:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375637704] [2024-01-31 16:07:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:36,198 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 16:07:36,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:36,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375637704] [2024-01-31 16:07:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375637704] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:36,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:36,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:07:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181084843] [2024-01-31 16:07:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:36,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:36,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2024-01-31 16:07:36,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:36,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:36,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2024-01-31 16:07:36,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:36,642 INFO L124 PetriNetUnfolderBase]: 3228/4961 cut-off events. [2024-01-31 16:07:36,642 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-01-31 16:07:36,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9149 conditions, 4961 events. 3228/4961 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 30812 event pairs, 323 based on Foata normal form. 170/4681 useless extension candidates. Maximal degree in co-relation 9129. Up to 2710 conditions per place. [2024-01-31 16:07:36,664 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 58 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-01-31 16:07:36,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 289 flow [2024-01-31 16:07:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:07:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:07:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-01-31 16:07:36,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-01-31 16:07:36,666 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 124 flow. Second operand 4 states and 212 transitions. [2024-01-31 16:07:36,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 289 flow [2024-01-31 16:07:36,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:36,668 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 117 flow [2024-01-31 16:07:36,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-01-31 16:07:36,670 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -23 predicate places. [2024-01-31 16:07:36,670 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 117 flow [2024-01-31 16:07:36,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:36,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:36,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:36,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:07:36,671 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:36,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1458738582, now seen corresponding path program 1 times [2024-01-31 16:07:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588857229] [2024-01-31 16:07:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:36,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:36,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 16:07:36,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:36,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588857229] [2024-01-31 16:07:36,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588857229] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:36,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:36,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:07:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587646797] [2024-01-31 16:07:36,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:36,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:07:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:36,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:07:36,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:07:36,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 81 [2024-01-31 16:07:36,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 16:07:36,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:36,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 81 [2024-01-31 16:07:36,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:37,157 INFO L124 PetriNetUnfolderBase]: 3654/6002 cut-off events. [2024-01-31 16:07:37,158 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-01-31 16:07:37,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10778 conditions, 6002 events. 3654/6002 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 40123 event pairs, 589 based on Foata normal form. 1/5324 useless extension candidates. Maximal degree in co-relation 10758. Up to 4384 conditions per place. [2024-01-31 16:07:37,182 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 48 selfloop transitions, 7 changer transitions 1/73 dead transitions. [2024-01-31 16:07:37,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 282 flow [2024-01-31 16:07:37,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:07:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:07:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2024-01-31 16:07:37,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2024-01-31 16:07:37,184 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 117 flow. Second operand 3 states and 183 transitions. [2024-01-31 16:07:37,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 282 flow [2024-01-31 16:07:37,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:07:37,186 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 153 flow [2024-01-31 16:07:37,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-01-31 16:07:37,187 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -22 predicate places. [2024-01-31 16:07:37,187 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 153 flow [2024-01-31 16:07:37,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 16:07:37,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:37,187 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:37,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:07:37,188 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:37,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1162734183, now seen corresponding path program 1 times [2024-01-31 16:07:37,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:37,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237445619] [2024-01-31 16:07:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237445619] [2024-01-31 16:07:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237445619] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:07:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810468690] [2024-01-31 16:07:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:37,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:37,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:37,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:37,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-01-31 16:07:37,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:37,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:37,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-01-31 16:07:37,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:37,980 INFO L124 PetriNetUnfolderBase]: 10159/15230 cut-off events. [2024-01-31 16:07:37,981 INFO L125 PetriNetUnfolderBase]: For 2984/3484 co-relation queries the response was YES. [2024-01-31 16:07:38,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32084 conditions, 15230 events. 10159/15230 cut-off events. For 2984/3484 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 105119 event pairs, 2359 based on Foata normal form. 22/12897 useless extension candidates. Maximal degree in co-relation 32059. Up to 5037 conditions per place. [2024-01-31 16:07:38,053 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 96 selfloop transitions, 15 changer transitions 0/124 dead transitions. [2024-01-31 16:07:38,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 124 transitions, 562 flow [2024-01-31 16:07:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:07:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:07:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2024-01-31 16:07:38,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.725925925925926 [2024-01-31 16:07:38,055 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 153 flow. Second operand 5 states and 294 transitions. [2024-01-31 16:07:38,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 124 transitions, 562 flow [2024-01-31 16:07:38,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 124 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:07:38,057 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 244 flow [2024-01-31 16:07:38,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-01-31 16:07:38,058 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -16 predicate places. [2024-01-31 16:07:38,058 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 244 flow [2024-01-31 16:07:38,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:38,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:38,058 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:38,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-31 16:07:38,059 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:38,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1642145201, now seen corresponding path program 2 times [2024-01-31 16:07:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:38,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990917098] [2024-01-31 16:07:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:38,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990917098] [2024-01-31 16:07:38,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990917098] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:07:38,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294040045] [2024-01-31 16:07:38,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:07:38,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:07:38,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:07:38,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:07:38,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-31 16:07:38,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 16:07:38,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:07:38,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-31 16:07:38,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:07:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:38,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:07:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:38,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294040045] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:07:38,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:07:38,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-01-31 16:07:38,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375738796] [2024-01-31 16:07:38,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:07:38,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:07:38,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:07:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:07:38,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-01-31 16:07:38,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 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 16:07:38,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:38,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-01-31 16:07:38,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:39,512 INFO L124 PetriNetUnfolderBase]: 11125/15933 cut-off events. [2024-01-31 16:07:39,512 INFO L125 PetriNetUnfolderBase]: For 10584/10684 co-relation queries the response was YES. [2024-01-31 16:07:39,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39874 conditions, 15933 events. 11125/15933 cut-off events. For 10584/10684 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 102552 event pairs, 1776 based on Foata normal form. 342/15414 useless extension candidates. Maximal degree in co-relation 39842. Up to 6392 conditions per place. [2024-01-31 16:07:39,590 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 145 selfloop transitions, 21 changer transitions 0/179 dead transitions. [2024-01-31 16:07:39,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 179 transitions, 911 flow [2024-01-31 16:07:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 16:07:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 16:07:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 499 transitions. [2024-01-31 16:07:39,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844993141289437 [2024-01-31 16:07:39,592 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 244 flow. Second operand 9 states and 499 transitions. [2024-01-31 16:07:39,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 179 transitions, 911 flow [2024-01-31 16:07:39,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 179 transitions, 911 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 16:07:39,598 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 391 flow [2024-01-31 16:07:39,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=391, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2024-01-31 16:07:39,599 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2024-01-31 16:07:39,599 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 391 flow [2024-01-31 16:07:39,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 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 16:07:39,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:39,599 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:39,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-31 16:07:39,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-31 16:07:39,811 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:39,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash 269701643, now seen corresponding path program 1 times [2024-01-31 16:07:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:39,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058969114] [2024-01-31 16:07:39,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:39,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058969114] [2024-01-31 16:07:39,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058969114] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:39,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:39,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:07:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070242966] [2024-01-31 16:07:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:39,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:39,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-01-31 16:07:39,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:39,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:39,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-01-31 16:07:39,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:40,871 INFO L124 PetriNetUnfolderBase]: 10837/16305 cut-off events. [2024-01-31 16:07:40,872 INFO L125 PetriNetUnfolderBase]: For 25374/25545 co-relation queries the response was YES. [2024-01-31 16:07:40,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44310 conditions, 16305 events. 10837/16305 cut-off events. For 25374/25545 co-relation queries the response was YES. Maximal size of possible extension queue 1037. Compared 114488 event pairs, 2900 based on Foata normal form. 160/15288 useless extension candidates. Maximal degree in co-relation 44268. Up to 7669 conditions per place. [2024-01-31 16:07:40,986 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 107 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2024-01-31 16:07:40,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 789 flow [2024-01-31 16:07:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:07:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:07:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 292 transitions. [2024-01-31 16:07:40,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7209876543209877 [2024-01-31 16:07:40,988 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 391 flow. Second operand 5 states and 292 transitions. [2024-01-31 16:07:40,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 789 flow [2024-01-31 16:07:41,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 132 transitions, 775 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-01-31 16:07:41,015 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 422 flow [2024-01-31 16:07:41,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2024-01-31 16:07:41,016 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2024-01-31 16:07:41,016 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 422 flow [2024-01-31 16:07:41,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:41,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:41,016 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:41,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 16:07:41,017 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:41,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:41,017 INFO L85 PathProgramCache]: Analyzing trace with hash -114063623, now seen corresponding path program 1 times [2024-01-31 16:07:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138995431] [2024-01-31 16:07:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:41,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:41,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138995431] [2024-01-31 16:07:41,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138995431] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:41,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:41,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:07:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210743779] [2024-01-31 16:07:41,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:41,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:41,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:41,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-01-31 16:07:41,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:41,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:41,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-01-31 16:07:41,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:42,449 INFO L124 PetriNetUnfolderBase]: 16654/23027 cut-off events. [2024-01-31 16:07:42,449 INFO L125 PetriNetUnfolderBase]: For 42414/50900 co-relation queries the response was YES. [2024-01-31 16:07:42,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61574 conditions, 23027 events. 16654/23027 cut-off events. For 42414/50900 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 148100 event pairs, 1337 based on Foata normal form. 609/20284 useless extension candidates. Maximal degree in co-relation 61524. Up to 9856 conditions per place. [2024-01-31 16:07:42,604 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 122 selfloop transitions, 15 changer transitions 0/162 dead transitions. [2024-01-31 16:07:42,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 162 transitions, 1152 flow [2024-01-31 16:07:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:07:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:07:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2024-01-31 16:07:42,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2024-01-31 16:07:42,606 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 422 flow. Second operand 5 states and 290 transitions. [2024-01-31 16:07:42,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 162 transitions, 1152 flow [2024-01-31 16:07:42,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 162 transitions, 1131 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-31 16:07:42,624 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 505 flow [2024-01-31 16:07:42,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=505, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2024-01-31 16:07:42,624 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 9 predicate places. [2024-01-31 16:07:42,624 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 505 flow [2024-01-31 16:07:42,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:42,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:42,625 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:42,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 16:07:42,625 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:42,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1482865469, now seen corresponding path program 2 times [2024-01-31 16:07:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:42,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583189746] [2024-01-31 16:07:42,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:42,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:42,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583189746] [2024-01-31 16:07:42,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583189746] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:42,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:42,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:07:42,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540789574] [2024-01-31 16:07:42,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:42,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:42,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:42,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:42,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:42,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-01-31 16:07:42,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:42,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:42,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-01-31 16:07:42,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:44,299 INFO L124 PetriNetUnfolderBase]: 16146/22325 cut-off events. [2024-01-31 16:07:44,300 INFO L125 PetriNetUnfolderBase]: For 50396/58945 co-relation queries the response was YES. [2024-01-31 16:07:44,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68452 conditions, 22325 events. 16146/22325 cut-off events. For 50396/58945 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 142266 event pairs, 1636 based on Foata normal form. 1173/22484 useless extension candidates. Maximal degree in co-relation 68394. Up to 9632 conditions per place. [2024-01-31 16:07:44,470 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 128 selfloop transitions, 17 changer transitions 0/170 dead transitions. [2024-01-31 16:07:44,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 170 transitions, 1259 flow [2024-01-31 16:07:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:07:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:07:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 293 transitions. [2024-01-31 16:07:44,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7234567901234568 [2024-01-31 16:07:44,472 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 505 flow. Second operand 5 states and 293 transitions. [2024-01-31 16:07:44,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 170 transitions, 1259 flow [2024-01-31 16:07:44,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 170 transitions, 1259 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 16:07:44,493 INFO L231 Difference]: Finished difference. Result has 98 places, 90 transitions, 614 flow [2024-01-31 16:07:44,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=614, PETRI_PLACES=98, PETRI_TRANSITIONS=90} [2024-01-31 16:07:44,494 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 17 predicate places. [2024-01-31 16:07:44,494 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 90 transitions, 614 flow [2024-01-31 16:07:44,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:44,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:44,494 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:44,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 16:07:44,495 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:44,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash 107448667, now seen corresponding path program 1 times [2024-01-31 16:07:44,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:44,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767206801] [2024-01-31 16:07:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:44,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:44,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767206801] [2024-01-31 16:07:44,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767206801] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:44,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:44,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:07:44,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544823423] [2024-01-31 16:07:44,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:44,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:44,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:44,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:44,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-01-31 16:07:44,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 614 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:44,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:44,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-01-31 16:07:44,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:46,553 INFO L124 PetriNetUnfolderBase]: 16866/23446 cut-off events. [2024-01-31 16:07:46,554 INFO L125 PetriNetUnfolderBase]: For 75355/84479 co-relation queries the response was YES. [2024-01-31 16:07:46,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80845 conditions, 23446 events. 16866/23446 cut-off events. For 75355/84479 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 151436 event pairs, 1331 based on Foata normal form. 888/23323 useless extension candidates. Maximal degree in co-relation 80777. Up to 11680 conditions per place. [2024-01-31 16:07:46,782 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 130 selfloop transitions, 14 changer transitions 0/169 dead transitions. [2024-01-31 16:07:46,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 169 transitions, 1365 flow [2024-01-31 16:07:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:07:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:07:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2024-01-31 16:07:46,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7135802469135802 [2024-01-31 16:07:46,784 INFO L175 Difference]: Start difference. First operand has 98 places, 90 transitions, 614 flow. Second operand 5 states and 289 transitions. [2024-01-31 16:07:46,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 169 transitions, 1365 flow [2024-01-31 16:07:46,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 169 transitions, 1361 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-31 16:07:46,929 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 701 flow [2024-01-31 16:07:46,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=701, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2024-01-31 16:07:46,930 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 24 predicate places. [2024-01-31 16:07:46,930 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 701 flow [2024-01-31 16:07:46,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:46,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:46,930 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:46,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 16:07:46,931 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:46,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1659088813, now seen corresponding path program 2 times [2024-01-31 16:07:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059596574] [2024-01-31 16:07:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:47,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:47,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059596574] [2024-01-31 16:07:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059596574] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:47,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:47,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:07:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284953516] [2024-01-31 16:07:47,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:47,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:47,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:47,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:47,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-01-31 16:07:47,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 701 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:47,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:47,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-01-31 16:07:47,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:49,109 INFO L124 PetriNetUnfolderBase]: 16348/22583 cut-off events. [2024-01-31 16:07:49,110 INFO L125 PetriNetUnfolderBase]: For 84822/94121 co-relation queries the response was YES. [2024-01-31 16:07:49,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82099 conditions, 22583 events. 16348/22583 cut-off events. For 84822/94121 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 142054 event pairs, 2622 based on Foata normal form. 1250/22832 useless extension candidates. Maximal degree in co-relation 82022. Up to 11607 conditions per place. [2024-01-31 16:07:49,260 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 133 selfloop transitions, 16 changer transitions 0/174 dead transitions. [2024-01-31 16:07:49,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 174 transitions, 1463 flow [2024-01-31 16:07:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:07:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:07:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2024-01-31 16:07:49,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2024-01-31 16:07:49,262 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 701 flow. Second operand 5 states and 290 transitions. [2024-01-31 16:07:49,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 174 transitions, 1463 flow [2024-01-31 16:07:49,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 174 transitions, 1454 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-31 16:07:49,419 INFO L231 Difference]: Finished difference. Result has 111 places, 97 transitions, 781 flow [2024-01-31 16:07:49,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=781, PETRI_PLACES=111, PETRI_TRANSITIONS=97} [2024-01-31 16:07:49,420 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 30 predicate places. [2024-01-31 16:07:49,420 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 781 flow [2024-01-31 16:07:49,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:49,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:49,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:49,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-31 16:07:49,421 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:49,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash 486838833, now seen corresponding path program 2 times [2024-01-31 16:07:49,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:49,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808823286] [2024-01-31 16:07:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808823286] [2024-01-31 16:07:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808823286] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:07:49,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:07:49,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 16:07:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932483708] [2024-01-31 16:07:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:07:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:07:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:07:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:07:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:07:49,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 81 [2024-01-31 16:07:49,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 781 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:49,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:07:49,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 81 [2024-01-31 16:07:49,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:07:51,376 INFO L124 PetriNetUnfolderBase]: 15666/23841 cut-off events. [2024-01-31 16:07:51,377 INFO L125 PetriNetUnfolderBase]: For 113007/116827 co-relation queries the response was YES. [2024-01-31 16:07:51,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97156 conditions, 23841 events. 15666/23841 cut-off events. For 113007/116827 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 174099 event pairs, 5753 based on Foata normal form. 770/23174 useless extension candidates. Maximal degree in co-relation 97072. Up to 11646 conditions per place. [2024-01-31 16:07:51,604 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 141 selfloop transitions, 16 changer transitions 0/184 dead transitions. [2024-01-31 16:07:51,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 184 transitions, 1692 flow [2024-01-31 16:07:51,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:07:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:07:51,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 294 transitions. [2024-01-31 16:07:51,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.725925925925926 [2024-01-31 16:07:51,617 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 781 flow. Second operand 5 states and 294 transitions. [2024-01-31 16:07:51,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 184 transitions, 1692 flow [2024-01-31 16:07:51,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 184 transitions, 1667 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-01-31 16:07:51,815 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 883 flow [2024-01-31 16:07:51,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=883, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2024-01-31 16:07:51,815 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 36 predicate places. [2024-01-31 16:07:51,815 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 883 flow [2024-01-31 16:07:51,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:07:51,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:07:51,816 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:07:51,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-31 16:07:51,816 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-31 16:07:51,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:07:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1273281472, now seen corresponding path program 1 times [2024-01-31 16:07:51,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:07:51,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431893721] [2024-01-31 16:07:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:07:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:07:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:07:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431893721] [2024-01-31 16:07:53,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431893721] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:07:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071986423] [2024-01-31 16:07:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:07:53,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:07:53,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:07:53,013 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:07:53,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-31 16:07:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:07:54,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-31 16:07:54,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:09:51,426 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 16:11:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:41,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:12:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:11,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071986423] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:12:11,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:12:11,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2024-01-31 16:12:11,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336045409] [2024-01-31 16:12:11,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:12:11,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-01-31 16:12:11,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:11,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-01-31 16:12:11,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=515, Unknown=18, NotChecked=0, Total=650 [2024-01-31 16:12:13,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:17,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:21,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:25,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:29,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:33,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:36,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:38,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:42,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:42,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 81 [2024-01-31 16:12:42,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 883 flow. Second operand has 26 states, 26 states have (on average 32.42307692307692) internal successors, (843), 26 states have internal predecessors, (843), 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 16:12:42,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:42,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 81 [2024-01-31 16:12:42,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:46,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:50,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:12:58,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:00,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:05,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:11,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:14,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:18,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:22,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:26,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:29,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:38,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:13:41,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:14:07,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:14:24,347 WARN L293 SmtUtils]: Spent 14.74s on a formula simplification. DAG size of input: 102 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 16:14:26,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:14:32,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:14:37,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:14:41,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:14:46,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:14:50,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:14:57,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:01,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:04,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:08,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:12,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:16,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:19,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:20,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:25,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:29,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:30,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:32,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:35,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:39,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:42,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:44,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:52,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:56,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:15:59,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:03,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:07,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:13,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:15,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:20,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:22,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:24,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:26,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:30,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:34,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:38,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:42,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:46,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:50,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:52,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:16:57,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:18,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:22,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:27,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:30,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:34,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:37,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:41,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:47,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:52,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:53,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:17:57,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:01,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:05,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:09,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:13,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:17,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:19,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:23,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:39,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:43,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:47,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:52,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:18:56,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:00,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:02,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:05,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:10,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:14,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:18,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:21,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:25,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:30,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:35,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:44,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:46,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:50,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:54,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:19:59,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:01,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:05,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:07,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:11,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:16,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:18,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:22,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:42,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:43,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:47,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:51,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:54,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:20:58,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:21:02,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:21:06,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:21:10,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:21:14,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:21:18,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:21:42,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:21:52,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:21:56,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:22:00,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15