./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.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-exp2x3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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-exp2x3.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x3.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-dev-a340643-m [2024-01-27 14:50:05,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:50:05,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:50:05,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:50:05,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:50:05,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:50:05,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:50:05,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:50:05,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:50:05,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:50:05,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:50:05,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:50:05,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:50:05,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:50:05,121 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:50:05,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:50:05,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:50:05,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:50:05,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:50:05,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:50:05,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:50:05,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:50:05,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:50:05,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:50:05,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:50:05,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:50:05,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:50:05,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:50:05,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:50:05,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:50:05,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:50:05,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:50:05,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:50:05,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:50:05,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:50:05,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:50:05,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:50:05,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:50:05,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:50:05,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:50:05,127 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:50:05,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:50:05,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:50:05,127 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-27 14:50:05,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:50:05,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:50:05,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:50:05,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:50:05,383 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:50:05,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-27 14:50:06,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:50:06,566 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:50:06,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-27 14:50:06,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb09d0867/60946aea6b6c4d6ab44cf60f2f184317/FLAG6bcfec0bd [2024-01-27 14:50:06,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb09d0867/60946aea6b6c4d6ab44cf60f2f184317 [2024-01-27 14:50:06,584 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:50:06,584 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:50:06,585 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-exp2x3.wvr.yml/witness.yml [2024-01-27 14:50:06,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:50:06,644 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:50:06,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:50:06,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:50:06,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:50:06,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:50:06" (1/2) ... [2024-01-27 14:50:06,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375ea56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:06, skipping insertion in model container [2024-01-27 14:50:06,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:50:06" (1/2) ... [2024-01-27 14:50:06,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3b1f7876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:06, skipping insertion in model container [2024-01-27 14:50:06,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:06" (2/2) ... [2024-01-27 14:50:06,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375ea56f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06, skipping insertion in model container [2024-01-27 14:50:06,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:06" (2/2) ... [2024-01-27 14:50:06,662 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:50:06,683 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:50:06,684 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] n == 0U [2024-01-27 14:50:06,685 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] x3 == 0U [2024-01-27 14:50:06,685 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] n == 0U [2024-01-27 14:50:06,685 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] x4 == 0U [2024-01-27 14:50:06,685 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] x2 == 0U [2024-01-27 14:50:06,686 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,686 INFO L98 nessWitnessExtractor]: Loop invariant at [L54-L56] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,686 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L40] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,686 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,686 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,686 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] x4 == 0U [2024-01-27 14:50:06,686 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] n == 0U [2024-01-27 14:50:06,687 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,687 INFO L98 nessWitnessExtractor]: Location invariant after [L37-L43] n == 0U [2024-01-27 14:50:06,687 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L48] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,687 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,687 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,687 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] x3 == 0U [2024-01-27 14:50:06,687 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] x4 == 0U [2024-01-27 14:50:06,687 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] n == 0U [2024-01-27 14:50:06,688 INFO L98 nessWitnessExtractor]: Loop invariant at [L62-L64] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,688 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,688 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-27 14:50:06,688 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )n) + (long long )x1 >= 0LL [2024-01-27 14:50:06,688 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] x1 == 0U [2024-01-27 14:50:06,689 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] x2 == 0U [2024-01-27 14:50:06,689 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] x3 == 0U [2024-01-27 14:50:06,689 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (long long )n + (long long )x1 >= 0LL [2024-01-27 14:50:06,689 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] x4 == 0U [2024-01-27 14:50:06,689 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] n == 0U [2024-01-27 14:50:06,689 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (0LL - (long long )n) - (long long )x1 >= 0LL [2024-01-27 14:50:06,689 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (long long )n - (long long )x1 >= 0LL [2024-01-27 14:50:06,707 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:50:06,852 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-exp2x3.wvr.c[2289,2302] [2024-01-27 14:50:06,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:50:06,863 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:50:06,898 WARN L424 MainDispatcher]: Unable to annotate void* thread1(void* _argptr) { while (x1 < n) { x1 = x1 + x1; } return 0; } with a witness entry 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:50:06,925 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-exp2x3.wvr.c[2289,2302] [2024-01-27 14:50:06,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:50:06,944 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:50:06,944 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06 WrapperNode [2024-01-27 14:50:06,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:50:06,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:50:06,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:50:06,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:50:06,951 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 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:06,957 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 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:06,982 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-01-27 14:50:06,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:50:06,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:50:06,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:50:06,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:50:06,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:06,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:06,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:07,005 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-27 14:50:07,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:07,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:07,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:07,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:07,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:07,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:07,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:50:07,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:50:07,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:50:07,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:50:07,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (1/1) ... [2024-01-27 14:50:07,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:50:07,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:50:07,040 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-27 14:50:07,065 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-27 14:50:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:50:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:50:07,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:50:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:50:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:50:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 14:50:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 14:50:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-27 14:50:07,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-27 14:50:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:50:07,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 14:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:50:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:50:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:50:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 14:50:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:50:07,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:50:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:50:07,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:50:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:50:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 14:50:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 14:50:07,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:50:07,153 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 14:50:07,234 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:50:07,236 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:50:07,515 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:50:07,515 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:50:07,605 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:50:07,606 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 14:50:07,606 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:50:07 BoogieIcfgContainer [2024-01-27 14:50:07,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:50:07,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:50:07,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:50:07,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:50:07,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:50:06" (1/4) ... [2024-01-27 14:50:07,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293551cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:50:07, skipping insertion in model container [2024-01-27 14:50:07,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:06" (2/4) ... [2024-01-27 14:50:07,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293551cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:50:07, skipping insertion in model container [2024-01-27 14:50:07,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:06" (3/4) ... [2024-01-27 14:50:07,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293551cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:50:07, skipping insertion in model container [2024-01-27 14:50:07,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:50:07" (4/4) ... [2024-01-27 14:50:07,612 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-01-27 14:50:07,625 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:50:07,625 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-01-27 14:50:07,625 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:50:07,695 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 14:50:07,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 105 transitions, 238 flow [2024-01-27 14:50:07,768 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2024-01-27 14:50:07,768 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 14:50:07,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 101 events. 4/101 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 191 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2024-01-27 14:50:07,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 105 transitions, 238 flow [2024-01-27 14:50:07,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 100 transitions, 224 flow [2024-01-27 14:50:07,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:50:07,790 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;@210079eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:50:07,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2024-01-27 14:50:07,793 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:50:07,793 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:50:07,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:07,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:07,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:50:07,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:07,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 12373, now seen corresponding path program 1 times [2024-01-27 14:50:07,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:07,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305714720] [2024-01-27 14:50:07,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:07,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:08,066 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-27 14:50:08,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:08,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305714720] [2024-01-27 14:50:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305714720] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:08,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:08,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118602640] [2024-01-27 14:50:08,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:08,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:08,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2024-01-27 14:50:08,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:50:08,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:08,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2024-01-27 14:50:08,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:09,123 INFO L124 PetriNetUnfolderBase]: 7352/10624 cut-off events. [2024-01-27 14:50:09,124 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-01-27 14:50:09,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20244 conditions, 10624 events. 7352/10624 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64571 event pairs, 4752 based on Foata normal form. 5/7175 useless extension candidates. Maximal degree in co-relation 17346. Up to 9146 conditions per place. [2024-01-27 14:50:09,211 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 40 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2024-01-27 14:50:09,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 94 transitions, 296 flow [2024-01-27 14:50:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2024-01-27 14:50:09,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-01-27 14:50:09,225 INFO L175 Difference]: Start difference. First operand has 109 places, 100 transitions, 224 flow. Second operand 3 states and 216 transitions. [2024-01-27 14:50:09,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 94 transitions, 296 flow [2024-01-27 14:50:09,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 280 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-27 14:50:09,242 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 200 flow [2024-01-27 14:50:09,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-01-27 14:50:09,247 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -12 predicate places. [2024-01-27 14:50:09,248 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 200 flow [2024-01-27 14:50:09,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:50:09,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:09,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:50:09,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:50:09,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:09,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:09,255 INFO L85 PathProgramCache]: Analyzing trace with hash 369031457, now seen corresponding path program 1 times [2024-01-27 14:50:09,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:09,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538204790] [2024-01-27 14:50:09,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:09,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:09,353 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-27 14:50:09,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:09,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538204790] [2024-01-27 14:50:09,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538204790] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:09,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:09,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757300598] [2024-01-27 14:50:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:09,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:09,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:09,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:09,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:09,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2024-01-27 14:50:09,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:50:09,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:09,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2024-01-27 14:50:09,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:09,760 INFO L124 PetriNetUnfolderBase]: 2026/3333 cut-off events. [2024-01-27 14:50:09,760 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-27 14:50:09,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 3333 events. 2026/3333 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 22978 event pairs, 1965 based on Foata normal form. 3/2937 useless extension candidates. Maximal degree in co-relation 6225. Up to 2818 conditions per place. [2024-01-27 14:50:09,789 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 32 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-27 14:50:09,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 90 transitions, 260 flow [2024-01-27 14:50:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2024-01-27 14:50:09,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2024-01-27 14:50:09,795 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 200 flow. Second operand 3 states and 233 transitions. [2024-01-27 14:50:09,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 90 transitions, 260 flow [2024-01-27 14:50:09,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 90 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:09,798 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 192 flow [2024-01-27 14:50:09,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2024-01-27 14:50:09,799 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -16 predicate places. [2024-01-27 14:50:09,799 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 192 flow [2024-01-27 14:50:09,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:50:09,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:09,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:09,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:50:09,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:09,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1843040616, now seen corresponding path program 1 times [2024-01-27 14:50:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754008491] [2024-01-27 14:50:09,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:09,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:09,916 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-27 14:50:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754008491] [2024-01-27 14:50:09,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754008491] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510938558] [2024-01-27 14:50:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:09,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:09,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:09,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 105 [2024-01-27 14:50:09,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-27 14:50:09,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:09,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 105 [2024-01-27 14:50:09,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:10,226 INFO L124 PetriNetUnfolderBase]: 2026/3330 cut-off events. [2024-01-27 14:50:10,226 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-27 14:50:10,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 3330 events. 2026/3330 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 22989 event pairs, 1965 based on Foata normal form. 1/2933 useless extension candidates. Maximal degree in co-relation 6207. Up to 2819 conditions per place. [2024-01-27 14:50:10,247 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 32 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-01-27 14:50:10,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 254 flow [2024-01-27 14:50:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2024-01-27 14:50:10,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2024-01-27 14:50:10,249 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 192 flow. Second operand 3 states and 235 transitions. [2024-01-27 14:50:10,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 254 flow [2024-01-27 14:50:10,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:10,253 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 186 flow [2024-01-27 14:50:10,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2024-01-27 14:50:10,255 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -19 predicate places. [2024-01-27 14:50:10,255 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 186 flow [2024-01-27 14:50:10,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-27 14:50:10,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:10,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:10,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:50:10,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:10,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1299683816, now seen corresponding path program 1 times [2024-01-27 14:50:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:10,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502750087] [2024-01-27 14:50:10,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:10,304 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-27 14:50:10,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:10,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502750087] [2024-01-27 14:50:10,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502750087] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:10,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723464786] [2024-01-27 14:50:10,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:10,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:10,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:10,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:10,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:10,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 105 [2024-01-27 14:50:10,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-27 14:50:10,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:10,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 105 [2024-01-27 14:50:10,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:10,571 INFO L124 PetriNetUnfolderBase]: 2026/3328 cut-off events. [2024-01-27 14:50:10,571 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-27 14:50:10,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6239 conditions, 3328 events. 2026/3328 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 22974 event pairs, 1965 based on Foata normal form. 2/2934 useless extension candidates. Maximal degree in co-relation 6211. Up to 2820 conditions per place. [2024-01-27 14:50:10,596 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 32 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-01-27 14:50:10,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 250 flow [2024-01-27 14:50:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2024-01-27 14:50:10,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2024-01-27 14:50:10,598 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 186 flow. Second operand 3 states and 237 transitions. [2024-01-27 14:50:10,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 250 flow [2024-01-27 14:50:10,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:10,600 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 182 flow [2024-01-27 14:50:10,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-01-27 14:50:10,600 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -21 predicate places. [2024-01-27 14:50:10,601 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 182 flow [2024-01-27 14:50:10,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-27 14:50:10,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:10,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:10,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:50:10,602 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:10,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash -282739967, now seen corresponding path program 1 times [2024-01-27 14:50:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449120799] [2024-01-27 14:50:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:10,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449120799] [2024-01-27 14:50:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449120799] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:10,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:50:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165394162] [2024-01-27 14:50:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:10,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:10,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:10,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:10,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:10,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2024-01-27 14:50:10,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:50:10,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:10,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2024-01-27 14:50:10,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:11,216 INFO L124 PetriNetUnfolderBase]: 7352/10611 cut-off events. [2024-01-27 14:50:11,217 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-01-27 14:50:11,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19919 conditions, 10611 events. 7352/10611 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64494 event pairs, 4752 based on Foata normal form. 0/7164 useless extension candidates. Maximal degree in co-relation 19894. Up to 9138 conditions per place. [2024-01-27 14:50:11,277 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 41 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2024-01-27 14:50:11,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 260 flow [2024-01-27 14:50:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2024-01-27 14:50:11,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6634920634920635 [2024-01-27 14:50:11,278 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 182 flow. Second operand 3 states and 209 transitions. [2024-01-27 14:50:11,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 260 flow [2024-01-27 14:50:11,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 81 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:11,280 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 174 flow [2024-01-27 14:50:11,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2024-01-27 14:50:11,281 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -25 predicate places. [2024-01-27 14:50:11,281 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 174 flow [2024-01-27 14:50:11,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:50:11,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:11,281 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] [2024-01-27 14:50:11,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:50:11,282 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:11,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash -797271507, now seen corresponding path program 1 times [2024-01-27 14:50:11,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:11,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547735204] [2024-01-27 14:50:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:11,365 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-27 14:50:11,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547735204] [2024-01-27 14:50:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547735204] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:11,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:50:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958114830] [2024-01-27 14:50:11,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:11,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:11,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:11,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:11,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:11,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 105 [2024-01-27 14:50:11,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-27 14:50:11,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:11,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 105 [2024-01-27 14:50:11,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:11,708 INFO L124 PetriNetUnfolderBase]: 3577/5646 cut-off events. [2024-01-27 14:50:11,709 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-01-27 14:50:11,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10336 conditions, 5646 events. 3577/5646 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 35755 event pairs, 1827 based on Foata normal form. 340/5690 useless extension candidates. Maximal degree in co-relation 10305. Up to 4124 conditions per place. [2024-01-27 14:50:11,743 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 49 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-01-27 14:50:11,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 303 flow [2024-01-27 14:50:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:50:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:50:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 311 transitions. [2024-01-27 14:50:11,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7404761904761905 [2024-01-27 14:50:11,745 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 174 flow. Second operand 4 states and 311 transitions. [2024-01-27 14:50:11,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 303 flow [2024-01-27 14:50:11,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 93 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:11,747 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 166 flow [2024-01-27 14:50:11,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2024-01-27 14:50:11,747 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -28 predicate places. [2024-01-27 14:50:11,748 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 166 flow [2024-01-27 14:50:11,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-27 14:50:11,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:11,748 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] [2024-01-27 14:50:11,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:50:11,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:11,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1674928342, now seen corresponding path program 1 times [2024-01-27 14:50:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972330057] [2024-01-27 14:50:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:11,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:11,827 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-27 14:50:11,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:11,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972330057] [2024-01-27 14:50:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972330057] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:11,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:50:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635371367] [2024-01-27 14:50:11,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:11,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:11,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:11,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:11,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 105 [2024-01-27 14:50:11,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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-27 14:50:11,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:11,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 105 [2024-01-27 14:50:11,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:12,113 INFO L124 PetriNetUnfolderBase]: 3128/4716 cut-off events. [2024-01-27 14:50:12,113 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-01-27 14:50:12,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8793 conditions, 4716 events. 3128/4716 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 29893 event pairs, 248 based on Foata normal form. 400/4951 useless extension candidates. Maximal degree in co-relation 8758. Up to 3336 conditions per place. [2024-01-27 14:50:12,134 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 52 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-01-27 14:50:12,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 307 flow [2024-01-27 14:50:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:50:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:50:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2024-01-27 14:50:12,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7476190476190476 [2024-01-27 14:50:12,136 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 166 flow. Second operand 4 states and 314 transitions. [2024-01-27 14:50:12,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 307 flow [2024-01-27 14:50:12,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 92 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:12,138 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 159 flow [2024-01-27 14:50:12,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-01-27 14:50:12,138 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -31 predicate places. [2024-01-27 14:50:12,138 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 159 flow [2024-01-27 14:50:12,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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-27 14:50:12,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:12,139 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] [2024-01-27 14:50:12,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:50:12,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:12,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1004530611, now seen corresponding path program 1 times [2024-01-27 14:50:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:12,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725388748] [2024-01-27 14:50:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:12,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:12,220 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-27 14:50:12,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725388748] [2024-01-27 14:50:12,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725388748] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:12,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:12,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:50:12,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432538460] [2024-01-27 14:50:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:12,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:12,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 105 [2024-01-27 14:50:12,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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-27 14:50:12,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:12,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 105 [2024-01-27 14:50:12,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:12,500 INFO L124 PetriNetUnfolderBase]: 3191/4796 cut-off events. [2024-01-27 14:50:12,500 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-01-27 14:50:12,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8935 conditions, 4796 events. 3191/4796 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 29934 event pairs, 161 based on Foata normal form. 400/5046 useless extension candidates. Maximal degree in co-relation 8901. Up to 3304 conditions per place. [2024-01-27 14:50:12,526 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 55 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-01-27 14:50:12,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 312 flow [2024-01-27 14:50:12,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:50:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:50:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2024-01-27 14:50:12,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7547619047619047 [2024-01-27 14:50:12,527 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 159 flow. Second operand 4 states and 317 transitions. [2024-01-27 14:50:12,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 312 flow [2024-01-27 14:50:12,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:12,529 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 152 flow [2024-01-27 14:50:12,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=72, 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=4, PETRI_FLOW=152, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2024-01-27 14:50:12,530 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -34 predicate places. [2024-01-27 14:50:12,530 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 152 flow [2024-01-27 14:50:12,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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-27 14:50:12,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:12,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:12,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:50:12,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:12,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1016395351, now seen corresponding path program 1 times [2024-01-27 14:50:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650734331] [2024-01-27 14:50:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:12,613 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-27 14:50:12,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:12,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650734331] [2024-01-27 14:50:12,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650734331] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:12,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:12,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:50:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110199224] [2024-01-27 14:50:12,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:12,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:12,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:12,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 105 [2024-01-27 14:50:12,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-27 14:50:12,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:12,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 105 [2024-01-27 14:50:12,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:12,936 INFO L124 PetriNetUnfolderBase]: 3016/4482 cut-off events. [2024-01-27 14:50:12,937 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-01-27 14:50:12,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8458 conditions, 4482 events. 3016/4482 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 27079 event pairs, 357 based on Foata normal form. 340/4710 useless extension candidates. Maximal degree in co-relation 8424. Up to 2810 conditions per place. [2024-01-27 14:50:12,960 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 58 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-27 14:50:12,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 317 flow [2024-01-27 14:50:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:50:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:50:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2024-01-27 14:50:12,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-01-27 14:50:12,962 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 152 flow. Second operand 4 states and 320 transitions. [2024-01-27 14:50:12,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 317 flow [2024-01-27 14:50:12,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:12,964 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 145 flow [2024-01-27 14:50:12,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-01-27 14:50:12,965 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -37 predicate places. [2024-01-27 14:50:12,965 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 145 flow [2024-01-27 14:50:12,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-27 14:50:12,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:12,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:12,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 14:50:12,966 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:12,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1238512162, now seen corresponding path program 1 times [2024-01-27 14:50:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263251010] [2024-01-27 14:50:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:13,185 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-27 14:50:13,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:13,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263251010] [2024-01-27 14:50:13,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263251010] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:13,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:13,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:50:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103822247] [2024-01-27 14:50:13,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:13,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:13,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 105 [2024-01-27 14:50:13,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-27 14:50:13,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:13,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 105 [2024-01-27 14:50:13,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:13,682 INFO L124 PetriNetUnfolderBase]: 4381/6698 cut-off events. [2024-01-27 14:50:13,683 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-01-27 14:50:13,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12485 conditions, 6698 events. 4381/6698 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 40071 event pairs, 656 based on Foata normal form. 1/6585 useless extension candidates. Maximal degree in co-relation 12451. Up to 4604 conditions per place. [2024-01-27 14:50:13,716 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 52 selfloop transitions, 7 changer transitions 1/91 dead transitions. [2024-01-27 14:50:13,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 326 flow [2024-01-27 14:50:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2024-01-27 14:50:13,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8507936507936508 [2024-01-27 14:50:13,718 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 145 flow. Second operand 3 states and 268 transitions. [2024-01-27 14:50:13,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 326 flow [2024-01-27 14:50:13,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:13,720 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 181 flow [2024-01-27 14:50:13,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-01-27 14:50:13,722 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -36 predicate places. [2024-01-27 14:50:13,723 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 181 flow [2024-01-27 14:50:13,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-27 14:50:13,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:13,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:13,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 14:50:13,724 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:13,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1716240187, now seen corresponding path program 1 times [2024-01-27 14:50:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567857596] [2024-01-27 14:50:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:13,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567857596] [2024-01-27 14:50:13,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567857596] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:13,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:13,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:50:13,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658602021] [2024-01-27 14:50:13,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:13,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:13,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:13,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-27 14:50:13,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-27 14:50:13,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:13,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-27 14:50:13,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:14,621 INFO L124 PetriNetUnfolderBase]: 8773/12009 cut-off events. [2024-01-27 14:50:14,622 INFO L125 PetriNetUnfolderBase]: For 2452/2962 co-relation queries the response was YES. [2024-01-27 14:50:14,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26940 conditions, 12009 events. 8773/12009 cut-off events. For 2452/2962 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 69133 event pairs, 967 based on Foata normal form. 30/10602 useless extension candidates. Maximal degree in co-relation 26894. Up to 4056 conditions per place. [2024-01-27 14:50:14,679 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 97 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2024-01-27 14:50:14,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 596 flow [2024-01-27 14:50:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:50:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:50:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2024-01-27 14:50:14,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.758095238095238 [2024-01-27 14:50:14,681 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 181 flow. Second operand 5 states and 398 transitions. [2024-01-27 14:50:14,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 596 flow [2024-01-27 14:50:14,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 137 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:50:14,684 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 282 flow [2024-01-27 14:50:14,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2024-01-27 14:50:14,685 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -30 predicate places. [2024-01-27 14:50:14,685 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 282 flow [2024-01-27 14:50:14,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-27 14:50:14,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:14,686 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:14,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 14:50:14,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:14,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1804811123, now seen corresponding path program 2 times [2024-01-27 14:50:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761098497] [2024-01-27 14:50:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:14,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761098497] [2024-01-27 14:50:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761098497] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:14,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:50:14,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334212437] [2024-01-27 14:50:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:14,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:14,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:14,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:14,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-27 14:50:14,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-27 14:50:14,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:14,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-27 14:50:14,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:15,573 INFO L124 PetriNetUnfolderBase]: 8577/12004 cut-off events. [2024-01-27 14:50:15,573 INFO L125 PetriNetUnfolderBase]: For 7683/7731 co-relation queries the response was YES. [2024-01-27 14:50:15,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30837 conditions, 12004 events. 8577/12004 cut-off events. For 7683/7731 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 71195 event pairs, 1701 based on Foata normal form. 262/11952 useless extension candidates. Maximal degree in co-relation 30779. Up to 4123 conditions per place. [2024-01-27 14:50:15,646 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 104 selfloop transitions, 19 changer transitions 0/145 dead transitions. [2024-01-27 14:50:15,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 145 transitions, 723 flow [2024-01-27 14:50:15,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:50:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:50:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2024-01-27 14:50:15,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7638095238095238 [2024-01-27 14:50:15,648 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 282 flow. Second operand 5 states and 401 transitions. [2024-01-27 14:50:15,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 145 transitions, 723 flow [2024-01-27 14:50:15,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 145 transitions, 723 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 14:50:15,655 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 399 flow [2024-01-27 14:50:15,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2024-01-27 14:50:15,657 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -22 predicate places. [2024-01-27 14:50:15,657 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 399 flow [2024-01-27 14:50:15,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-27 14:50:15,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:15,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:15,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 14:50:15,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:15,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash -317025146, now seen corresponding path program 1 times [2024-01-27 14:50:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730863023] [2024-01-27 14:50:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730863023] [2024-01-27 14:50:15,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730863023] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:15,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:50:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679042794] [2024-01-27 14:50:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:15,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:15,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:15,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 105 [2024-01-27 14:50:15,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-27 14:50:15,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:15,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 105 [2024-01-27 14:50:15,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:16,617 INFO L124 PetriNetUnfolderBase]: 8981/12459 cut-off events. [2024-01-27 14:50:16,617 INFO L125 PetriNetUnfolderBase]: For 22229/22749 co-relation queries the response was YES. [2024-01-27 14:50:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37128 conditions, 12459 events. 8981/12459 cut-off events. For 22229/22749 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 74010 event pairs, 967 based on Foata normal form. 201/12436 useless extension candidates. Maximal degree in co-relation 37056. Up to 4760 conditions per place. [2024-01-27 14:50:16,695 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 106 selfloop transitions, 16 changer transitions 0/144 dead transitions. [2024-01-27 14:50:16,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 837 flow [2024-01-27 14:50:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:50:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:50:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2024-01-27 14:50:16,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561904761904762 [2024-01-27 14:50:16,697 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 399 flow. Second operand 5 states and 397 transitions. [2024-01-27 14:50:16,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 837 flow [2024-01-27 14:50:16,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 144 transitions, 833 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-27 14:50:16,739 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 494 flow [2024-01-27 14:50:16,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-01-27 14:50:16,740 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -15 predicate places. [2024-01-27 14:50:16,740 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 494 flow [2024-01-27 14:50:16,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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-27 14:50:16,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:16,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:16,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 14:50:16,741 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:16,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash 831866104, now seen corresponding path program 2 times [2024-01-27 14:50:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945112101] [2024-01-27 14:50:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:16,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945112101] [2024-01-27 14:50:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945112101] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:50:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972500732] [2024-01-27 14:50:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:16,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:16,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2024-01-27 14:50:16,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 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-27 14:50:16,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:16,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2024-01-27 14:50:16,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:17,668 INFO L124 PetriNetUnfolderBase]: 8573/11984 cut-off events. [2024-01-27 14:50:17,668 INFO L125 PetriNetUnfolderBase]: For 26277/26372 co-relation queries the response was YES. [2024-01-27 14:50:17,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37141 conditions, 11984 events. 8573/11984 cut-off events. For 26277/26372 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 70628 event pairs, 2405 based on Foata normal form. 230/11873 useless extension candidates. Maximal degree in co-relation 37057. Up to 5170 conditions per place. [2024-01-27 14:50:17,733 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 110 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-01-27 14:50:17,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 149 transitions, 941 flow [2024-01-27 14:50:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:50:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:50:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2024-01-27 14:50:17,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2024-01-27 14:50:17,735 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 494 flow. Second operand 5 states and 402 transitions. [2024-01-27 14:50:17,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 149 transitions, 941 flow [2024-01-27 14:50:17,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 149 transitions, 930 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 14:50:17,767 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 572 flow [2024-01-27 14:50:17,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=572, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2024-01-27 14:50:17,768 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, -9 predicate places. [2024-01-27 14:50:17,768 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 572 flow [2024-01-27 14:50:17,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 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-27 14:50:17,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:17,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:17,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-27 14:50:17,769 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:17,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2138841899, now seen corresponding path program 1 times [2024-01-27 14:50:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:17,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761160267] [2024-01-27 14:50:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:17,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761160267] [2024-01-27 14:50:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761160267] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 14:50:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263201267] [2024-01-27 14:50:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:17,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 14:50:17,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:50:17,936 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-27 14:50:17,950 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-27 14:50:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:18,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 14:50:18,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 14:50:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:18,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 14:50:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:18,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263201267] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 14:50:18,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 14:50:18,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-01-27 14:50:18,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133834087] [2024-01-27 14:50:18,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 14:50:18,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 14:50:18,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:18,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 14:50:18,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 14:50:18,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2024-01-27 14:50:18,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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-27 14:50:18,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:18,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2024-01-27 14:50:18,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:20,124 INFO L124 PetriNetUnfolderBase]: 15260/21257 cut-off events. [2024-01-27 14:50:20,125 INFO L125 PetriNetUnfolderBase]: For 93098/97405 co-relation queries the response was YES. [2024-01-27 14:50:20,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72608 conditions, 21257 events. 15260/21257 cut-off events. For 93098/97405 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 135404 event pairs, 1803 based on Foata normal form. 1148/19625 useless extension candidates. Maximal degree in co-relation 72515. Up to 6152 conditions per place. [2024-01-27 14:50:20,261 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 243 selfloop transitions, 16 changer transitions 0/287 dead transitions. [2024-01-27 14:50:20,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 287 transitions, 2584 flow [2024-01-27 14:50:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 14:50:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 14:50:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 649 transitions. [2024-01-27 14:50:20,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867724867724868 [2024-01-27 14:50:20,264 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 572 flow. Second operand 9 states and 649 transitions. [2024-01-27 14:50:20,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 287 transitions, 2584 flow [2024-01-27 14:50:20,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 287 transitions, 2521 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-01-27 14:50:20,314 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 667 flow [2024-01-27 14:50:20,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=667, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2024-01-27 14:50:20,315 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2024-01-27 14:50:20,315 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 667 flow [2024-01-27 14:50:20,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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-27 14:50:20,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:20,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:20,327 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-27 14:50:20,517 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,SelfDestructingSolverStorable14 [2024-01-27 14:50:20,520 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:20,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 329252647, now seen corresponding path program 2 times [2024-01-27 14:50:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351431551] [2024-01-27 14:50:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:20,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:20,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:20,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351431551] [2024-01-27 14:50:20,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351431551] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:20,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:20,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:50:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055682915] [2024-01-27 14:50:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:20,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:20,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:20,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:20,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:20,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2024-01-27 14:50:20,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 667 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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-27 14:50:20,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:20,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2024-01-27 14:50:20,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:22,579 INFO L124 PetriNetUnfolderBase]: 13356/18523 cut-off events. [2024-01-27 14:50:22,579 INFO L125 PetriNetUnfolderBase]: For 92115/96212 co-relation queries the response was YES. [2024-01-27 14:50:22,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74286 conditions, 18523 events. 13356/18523 cut-off events. For 92115/96212 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 113860 event pairs, 1285 based on Foata normal form. 1209/18858 useless extension candidates. Maximal degree in co-relation 74186. Up to 6257 conditions per place. [2024-01-27 14:50:22,686 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 156 selfloop transitions, 18 changer transitions 0/203 dead transitions. [2024-01-27 14:50:22,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 1826 flow [2024-01-27 14:50:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:50:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:50:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 399 transitions. [2024-01-27 14:50:22,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.76 [2024-01-27 14:50:22,687 INFO L175 Difference]: Start difference. First operand has 113 places, 101 transitions, 667 flow. Second operand 5 states and 399 transitions. [2024-01-27 14:50:22,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 1826 flow [2024-01-27 14:50:22,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 203 transitions, 1824 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:50:22,758 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 811 flow [2024-01-27 14:50:22,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=811, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2024-01-27 14:50:22,759 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-01-27 14:50:22,759 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 811 flow [2024-01-27 14:50:22,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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-27 14:50:22,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:22,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:22,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-27 14:50:22,759 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:22,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1071503040, now seen corresponding path program 1 times [2024-01-27 14:50:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:22,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143510537] [2024-01-27 14:50:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:22,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:22,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143510537] [2024-01-27 14:50:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143510537] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:22,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:50:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293464864] [2024-01-27 14:50:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:22,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:22,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:22,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:22,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 105 [2024-01-27 14:50:22,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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-27 14:50:22,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:22,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 105 [2024-01-27 14:50:22,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:24,550 INFO L124 PetriNetUnfolderBase]: 13188/18133 cut-off events. [2024-01-27 14:50:24,551 INFO L125 PetriNetUnfolderBase]: For 106497/110852 co-relation queries the response was YES. [2024-01-27 14:50:24,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78354 conditions, 18133 events. 13188/18133 cut-off events. For 106497/110852 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 108318 event pairs, 1177 based on Foata normal form. 1261/18520 useless extension candidates. Maximal degree in co-relation 78248. Up to 8801 conditions per place. [2024-01-27 14:50:24,794 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 160 selfloop transitions, 12 changer transitions 0/203 dead transitions. [2024-01-27 14:50:24,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 203 transitions, 1891 flow [2024-01-27 14:50:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:50:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:50:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 406 transitions. [2024-01-27 14:50:24,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-01-27 14:50:24,797 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 811 flow. Second operand 5 states and 406 transitions. [2024-01-27 14:50:24,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 203 transitions, 1891 flow [2024-01-27 14:50:25,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 203 transitions, 1881 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-01-27 14:50:25,017 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 846 flow [2024-01-27 14:50:25,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=846, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2024-01-27 14:50:25,022 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 17 predicate places. [2024-01-27 14:50:25,023 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 846 flow [2024-01-27 14:50:25,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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-27 14:50:25,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:25,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:25,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-27 14:50:25,023 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:25,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1226179184, now seen corresponding path program 2 times [2024-01-27 14:50:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:25,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042042066] [2024-01-27 14:50:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:25,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:25,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042042066] [2024-01-27 14:50:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042042066] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:25,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:25,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:50:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886609480] [2024-01-27 14:50:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:25,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:25,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:25,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:25,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 105 [2024-01-27 14:50:25,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 846 flow. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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-27 14:50:25,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:25,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 105 [2024-01-27 14:50:25,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:27,101 INFO L124 PetriNetUnfolderBase]: 13304/18697 cut-off events. [2024-01-27 14:50:27,101 INFO L125 PetriNetUnfolderBase]: For 120495/124478 co-relation queries the response was YES. [2024-01-27 14:50:27,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82775 conditions, 18697 events. 13304/18697 cut-off events. For 120495/124478 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 117021 event pairs, 2143 based on Foata normal form. 1348/19230 useless extension candidates. Maximal degree in co-relation 82660. Up to 8590 conditions per place. [2024-01-27 14:50:27,220 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 164 selfloop transitions, 16 changer transitions 0/211 dead transitions. [2024-01-27 14:50:27,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 211 transitions, 2013 flow [2024-01-27 14:50:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:50:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:50:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2024-01-27 14:50:27,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7771428571428571 [2024-01-27 14:50:27,222 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 846 flow. Second operand 5 states and 408 transitions. [2024-01-27 14:50:27,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 211 transitions, 2013 flow [2024-01-27 14:50:27,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 211 transitions, 1996 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-01-27 14:50:27,470 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 946 flow [2024-01-27 14:50:27,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=946, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2024-01-27 14:50:27,470 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places. [2024-01-27 14:50:27,470 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 946 flow [2024-01-27 14:50:27,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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-27 14:50:27,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:27,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:27,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-27 14:50:27,471 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:50:27,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash 552374191, now seen corresponding path program 1 times [2024-01-27 14:50:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:27,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60297413] [2024-01-27 14:50:27,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:27,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60297413] [2024-01-27 14:50:27,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60297413] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 14:50:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919290560] [2024-01-27 14:50:27,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:27,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 14:50:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:50:27,896 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-27 14:50:27,908 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-27 14:50:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:28,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 14:50:28,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 14:50:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:31,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 14:50:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:32,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919290560] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 14:50:32,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 14:50:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-27 14:50:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611626038] [2024-01-27 14:50:32,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 14:50:32,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 14:50:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 14:50:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-01-27 14:50:34,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:50:37,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:50:40,921 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-27 14:50:43,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:50:45,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:50:50,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:50:50,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2024-01-27 14:50:50,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 946 flow. Second operand has 19 states, 19 states have (on average 49.21052631578947) internal successors, (935), 19 states have internal predecessors, (935), 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-27 14:50:50,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:50,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2024-01-27 14:50:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:51:01,936 INFO L124 PetriNetUnfolderBase]: 29934/42370 cut-off events. [2024-01-27 14:51:01,937 INFO L125 PetriNetUnfolderBase]: For 294045/302506 co-relation queries the response was YES. [2024-01-27 14:51:02,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199647 conditions, 42370 events. 29934/42370 cut-off events. For 294045/302506 co-relation queries the response was YES. Maximal size of possible extension queue 2026. Compared 286475 event pairs, 3228 based on Foata normal form. 1423/42472 useless extension candidates. Maximal degree in co-relation 199519. Up to 19558 conditions per place. [2024-01-27 14:51:02,325 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 389 selfloop transitions, 198 changer transitions 29/641 dead transitions. [2024-01-27 14:51:02,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 641 transitions, 6177 flow [2024-01-27 14:51:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-27 14:51:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-27 14:51:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1433 transitions. [2024-01-27 14:51:02,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5933747412008281 [2024-01-27 14:51:02,328 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 946 flow. Second operand 23 states and 1433 transitions. [2024-01-27 14:51:02,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 641 transitions, 6177 flow [2024-01-27 14:51:03,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 641 transitions, 6118 flow, removed 26 selfloop flow, removed 1 redundant places. [2024-01-27 14:51:03,266 INFO L231 Difference]: Finished difference. Result has 163 places, 309 transitions, 4023 flow [2024-01-27 14:51:03,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4023, PETRI_PLACES=163, PETRI_TRANSITIONS=309} [2024-01-27 14:51:03,267 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 54 predicate places. [2024-01-27 14:51:03,267 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 309 transitions, 4023 flow [2024-01-27 14:51:03,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 49.21052631578947) internal successors, (935), 19 states have internal predecessors, (935), 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-27 14:51:03,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:51:03,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:51:03,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 14:51:03,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 14:51:03,479 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:51:03,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:51:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2046979469, now seen corresponding path program 2 times [2024-01-27 14:51:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:51:03,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538192701] [2024-01-27 14:51:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:51:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:51:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:51:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:51:03,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:51:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538192701] [2024-01-27 14:51:03,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538192701] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 14:51:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818469421] [2024-01-27 14:51:03,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 14:51:03,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 14:51:03,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:51:03,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 14:51:03,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 14:51:04,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 14:51:04,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 14:51:04,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 14:51:04,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 14:52:45,373 WARN L293 SmtUtils]: Spent 13.33s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 14:53:28,599 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 14:54:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:54:28,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 14:55:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:55:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818469421] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 14:55:21,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 14:55:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2024-01-27 14:55:21,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511550396] [2024-01-27 14:55:21,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 14:55:21,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-01-27 14:55:21,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:55:21,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-01-27 14:55:21,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=297, Unknown=37, NotChecked=0, Total=420 [2024-01-27 14:55:25,854 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-27 14:55:30,099 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-27 14:55:34,163 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-27 14:55:38,245 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-27 14:55:42,492 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-27 14:55:46,784 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-27 14:55:50,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-27 14:55:54,974 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-27 14:55:59,032 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-27 14:56:03,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-27 14:56:07,272 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-27 14:56:11,366 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-27 14:56:15,492 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-27 14:56:19,546 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-27 14:56:23,607 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-27 14:56:27,658 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-27 14:56:30,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:56:30,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 105 [2024-01-27 14:56:30,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 309 transitions, 4023 flow. Second operand has 21 states, 21 states have (on average 38.76190476190476) internal successors, (814), 21 states have internal predecessors, (814), 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-27 14:56:30,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:56:30,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 105 [2024-01-27 14:56:30,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:56:42,694 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 49 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 14:57:07,750 WARN L293 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 62 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 14:57:12,086 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-27 14:57:13,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:57:17,678 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-27 14:57:19,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:57:24,589 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-27 14:57:30,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:57:35,621 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-27 14:57:39,966 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-27 14:57:45,459 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-27 14:57:50,109 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-27 14:57:53,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 14:57:57,219 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-27 14:58:01,222 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-27 14:58:05,272 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-27 14:58:09,634 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-27 14:58:15,128 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-27 14:58:19,131 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-27 14:58:32,385 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification. DAG size of input: 38 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 14:58:37,270 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-27 14:58:41,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-27 14:58:44,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 14:58:56,079 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-27 14:59:00,155 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-27 14:59:08,991 INFO L124 PetriNetUnfolderBase]: 59475/82545 cut-off events. [2024-01-27 14:59:08,992 INFO L125 PetriNetUnfolderBase]: For 768795/768842 co-relation queries the response was YES. [2024-01-27 14:59:09,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448369 conditions, 82545 events. 59475/82545 cut-off events. For 768795/768842 co-relation queries the response was YES. Maximal size of possible extension queue 4335. Compared 581559 event pairs, 6631 based on Foata normal form. 85/82510 useless extension candidates. Maximal degree in co-relation 448224. Up to 41534 conditions per place. [2024-01-27 14:59:10,149 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 635 selfloop transitions, 412 changer transitions 27/1088 dead transitions. [2024-01-27 14:59:10,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1088 transitions, 14043 flow [2024-01-27 14:59:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 14:59:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 14:59:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1312 transitions. [2024-01-27 14:59:10,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206349206349207 [2024-01-27 14:59:10,153 INFO L175 Difference]: Start difference. First operand has 163 places, 309 transitions, 4023 flow. Second operand 24 states and 1312 transitions. [2024-01-27 14:59:10,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 1088 transitions, 14043 flow [2024-01-27 14:59:16,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1088 transitions, 13280 flow, removed 376 selfloop flow, removed 2 redundant places. [2024-01-27 14:59:16,204 INFO L231 Difference]: Finished difference. Result has 195 places, 609 transitions, 9713 flow [2024-01-27 14:59:16,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=3688, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=9713, PETRI_PLACES=195, PETRI_TRANSITIONS=609} [2024-01-27 14:59:16,205 INFO L281 CegarLoopForPetriNet]: 109 programPoint places, 86 predicate places. [2024-01-27 14:59:16,206 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 609 transitions, 9713 flow [2024-01-27 14:59:16,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 38.76190476190476) internal successors, (814), 21 states have internal predecessors, (814), 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-27 14:59:16,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:16,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:16,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 14:59:16,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 14:59:16,418 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 53 more)] === [2024-01-27 14:59:16,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1090393331, now seen corresponding path program 1 times [2024-01-27 14:59:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:16,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524501881] [2024-01-27 14:59:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:16,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:59:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524501881] [2024-01-27 14:59:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524501881] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 14:59:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582938474] [2024-01-27 14:59:16,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:16,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 14:59:16,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:59:16,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 14:59:16,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 14:59:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:17,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 14:59:17,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:00:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:00:21,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:00:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:00:39,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582938474] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:00:39,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:00:39,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-27 15:00:39,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57174447] [2024-01-27 15:00:39,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:00:39,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 15:00:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:00:39,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 15:00:39,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=243, Unknown=9, NotChecked=0, Total=342 [2024-01-27 15:00:41,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:00:43,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:00:47,302 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-27 15:00:52,406 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-27 15:00:57,253 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-27 15:00:59,352 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-27 15:01:03,565 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-27 15:01:03,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 105 [2024-01-27 15:01:03,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 609 transitions, 9713 flow. Second operand has 19 states, 19 states have (on average 39.05263157894737) internal successors, (742), 19 states have internal predecessors, (742), 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-27 15:01:03,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:01:03,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 105 [2024-01-27 15:01:03,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:01:08,118 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-27 15:01:17,964 WARN L293 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 66 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:01:22,412 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-27 15:01:26,421 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-27 15:01:30,590 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-27 15:01:40,245 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 70 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:01:48,314 WARN L293 SmtUtils]: Spent 7.55s on a formula simplification. DAG size of input: 77 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:01:51,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:01:53,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:01:59,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:02:03,724 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-27 15:02:07,732 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-27 15:02:09,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:02:13,432 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-27 15:02:15,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:02:20,083 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-27 15:02:24,095 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-27 15:02:26,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:02:40,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:02:44,410 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-27 15:02:45,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:02:51,232 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-27 15:02:55,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:02:57,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:03:01,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:03:05,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:03:09,790 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-27 15:03:14,275 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-27 15:03:18,938 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-27 15:03:21,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:03:26,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:03:30,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:03:34,590 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-27 15:03:38,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:03:51,269 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-27 15:03:52,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:03:56,428 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-27 15:04:00,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:04:02,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:04:06,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:04:10,895 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-27 15:04:28,607 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-27 15:04:29,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:04:31,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15