./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/test-easy6.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/test-easy6.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/test-easy6.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/test-easy6.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-8857f20-m [2024-01-29 22:59:35,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:59:35,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:59:35,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:59:35,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:59:35,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:59:35,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:59:35,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:59:35,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:59:35,171 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:59:35,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:59:35,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:59:35,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:59:35,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:59:35,174 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:59:35,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:59:35,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:59:35,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:59:35,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:59:35,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:59:35,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:59:35,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:59:35,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:59:35,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:59:35,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:59:35,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:59:35,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:59:35,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:59:35,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:59:35,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:59:35,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:59:35,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:59:35,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:59:35,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:59:35,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:59:35,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:59:35,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:59:35,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:59:35,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:59:35,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:59:35,180 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:59:35,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:59:35,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:59:35,180 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-29 22:59:35,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:59:35,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:59:35,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:59:35,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:59:35,407 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:59:35,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c [2024-01-29 22:59:36,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:59:36,610 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:59:36,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2024-01-29 22:59:36,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac92a6a9/86b8148c2e794c25a897fa545ed62835/FLAG58f80fc40 [2024-01-29 22:59:36,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bac92a6a9/86b8148c2e794c25a897fa545ed62835 [2024-01-29 22:59:36,628 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:59:36,632 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:59:36,632 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/test-easy6.wvr.yml/witness.yml [2024-01-29 22:59:36,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:59:36,834 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:59:36,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:59:36,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:59:36,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:59:36,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:59:36" (1/2) ... [2024-01-29 22:59:36,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dce9f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:59:36, skipping insertion in model container [2024-01-29 22:59:36,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:59:36" (1/2) ... [2024-01-29 22:59:36,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@15fbba5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:59:36, skipping insertion in model container [2024-01-29 22:59:36,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:59:36" (2/2) ... [2024-01-29 22:59:36,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dce9f1e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:36, skipping insertion in model container [2024-01-29 22:59:36,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:59:36" (2/2) ... [2024-01-29 22:59:36,843 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:59:36,897 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:59:36,898 INFO L98 nessWitnessExtractor]: Location invariant before [L84-L84] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,898 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,898 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((0 <= n1) && (0 <= tmp1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,899 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((0 <= n1) && (0 <= tmp1)) && (0 <= i) [2024-01-29 22:59:36,899 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((0 <= n1) && (0 <= tmp1)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,899 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] 0 <= n1 [2024-01-29 22:59:36,900 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,900 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,900 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((0 <= n1) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,900 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((0 <= n1) && (0 <= tmp1)) && (0 <= i1) [2024-01-29 22:59:36,900 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] ((0 <= n1) && (0 <= tmp1)) && (0 <= i2) [2024-01-29 22:59:36,900 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (0 <= n1) && (0 <= i2) [2024-01-29 22:59:36,900 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] ((0 <= n1) && (0 <= i2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,900 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] 0 <= n1 [2024-01-29 22:59:36,901 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,901 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] ((0 <= n1) && (0 <= i2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,901 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] ((0 <= n1) && (0 <= i2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,901 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,901 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,901 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,902 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,902 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,902 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,902 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i1) [2024-01-29 22:59:36,902 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i2) [2024-01-29 22:59:36,902 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,902 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,903 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i) [2024-01-29 22:59:36,903 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,903 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,903 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] 0 <= n1 [2024-01-29 22:59:36,903 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,903 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,903 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((0 <= n1) && (0 <= n2)) && (0 <= i)) && (0 <= i1) [2024-01-29 22:59:36,904 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,904 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,904 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0 <= n1) && (0 <= n2)) && (0 <= i)) && (0 <= i1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,904 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0 <= n1) && (0 <= n2)) && (0 <= i)) && (0 <= i1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,905 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,905 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,905 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0 <= n1) && (0 <= n2)) && (0 <= i)) && (0 <= i1)) && (0 <= i2) [2024-01-29 22:59:36,906 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((0 <= n1) && (0 <= n2)) && (0 <= i)) && (0 <= i1)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,906 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] 0 <= n1 [2024-01-29 22:59:36,906 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (0 <= n1) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,906 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] 0 <= n1 [2024-01-29 22:59:36,906 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (0 <= n1) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,906 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] ((0 <= n1) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,907 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,907 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,907 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,907 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,907 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,907 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (0 <= n1) && (0 <= i2) [2024-01-29 22:59:36,908 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,908 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,908 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,909 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,909 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,909 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,909 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,910 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= n1) && (0 <= n2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,910 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] 0 <= n1 [2024-01-29 22:59:36,910 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,910 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,910 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,910 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] ((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,910 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,910 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,911 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,911 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,911 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,911 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] 0 <= n1 [2024-01-29 22:59:36,911 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,911 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,911 INFO L98 nessWitnessExtractor]: Location invariant before [L95-L95] (((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)0 || e1 == (_Bool)1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,911 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (0 <= n2) && (0 <= tmp1) [2024-01-29 22:59:36,912 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && (0 <= i2) [2024-01-29 22:59:36,912 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && (0 <= i1) [2024-01-29 22:59:36,912 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,912 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] 0 <= n2 [2024-01-29 22:59:36,913 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,913 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && (1 <= n1) [2024-01-29 22:59:36,913 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && (0 <= i) [2024-01-29 22:59:36,913 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,913 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && (n1 != 0) [2024-01-29 22:59:36,913 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] ((0 <= n2) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,913 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (0 <= n1) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,913 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] ((0 <= n1) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,914 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] 0 <= n1 [2024-01-29 22:59:36,914 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,914 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,914 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,914 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,914 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,914 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] (0 <= n1) && (0 <= i2) [2024-01-29 22:59:36,915 INFO L98 nessWitnessExtractor]: Location invariant before [L100-L100] ((0 <= n1) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,915 INFO L98 nessWitnessExtractor]: Location invariant before [L99-L99] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,915 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,915 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,915 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (0 <= n2) && (0 <= tmp2) [2024-01-29 22:59:36,915 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((0 <= n2) && (0 <= tmp2)) && (n1 == 0) [2024-01-29 22:59:36,915 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((0 <= n2) && (0 <= tmp2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,915 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((0 <= n2) && (0 <= tmp2)) && (0 <= i2) [2024-01-29 22:59:36,916 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((0 <= n2) && (0 <= tmp2)) && (0 <= i) [2024-01-29 22:59:36,916 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] 0 <= n2 [2024-01-29 22:59:36,916 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (0 <= n2) && (0 <= tmp1) [2024-01-29 22:59:36,916 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((0 <= n2) && (0 <= tmp2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,917 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((0 <= n2) && (0 <= tmp2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,917 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((0 <= n2) && (0 <= tmp2)) && (0 <= i1) [2024-01-29 22:59:36,918 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,918 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,918 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,918 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,918 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] 0 <= n1 [2024-01-29 22:59:36,918 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= n1) && (0 <= n2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,919 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,919 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,919 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,919 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,919 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] 0 <= n1 [2024-01-29 22:59:36,919 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,919 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && (0 <= i2) [2024-01-29 22:59:36,920 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,920 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,920 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,920 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,920 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,920 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,920 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,920 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] 0 <= n1 [2024-01-29 22:59:36,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((0 <= n1) && (0 <= n2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,921 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,922 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,922 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,922 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,922 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,922 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,922 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,923 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,923 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,923 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,924 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] 0 <= n1 [2024-01-29 22:59:36,924 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,924 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((0 <= n1) && (0 <= tmp1)) && (0 <= i) [2024-01-29 22:59:36,924 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((0 <= n1) && (0 <= tmp1)) && (0 <= i)) && (0 <= i2) [2024-01-29 22:59:36,924 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,924 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((0 <= n1) && (0 <= tmp1)) && (0 <= i)) && (0 <= i1) [2024-01-29 22:59:36,924 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,925 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((0 <= n1) && (0 <= tmp1)) && (0 <= i)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,925 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((0 <= n1) && (0 <= tmp1)) && (0 <= i)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,925 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] 0 <= n1 [2024-01-29 22:59:36,925 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,925 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((0 <= n1) && (0 <= tmp1)) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,925 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,925 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,925 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] 0 <= n1 [2024-01-29 22:59:36,926 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,926 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,926 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,926 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,927 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,927 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,927 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((0 <= n1) && (0 <= n2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,927 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,927 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,927 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] 0 <= n1 [2024-01-29 22:59:36,928 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,928 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,928 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && (0 <= i2) [2024-01-29 22:59:36,928 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,928 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,929 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,929 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,929 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,930 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,931 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,932 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((0 <= n1) && (0 <= tmp1)) && (0 <= i2) [2024-01-29 22:59:36,932 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,932 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (((0 <= n1) && (0 <= tmp1)) && (0 <= i2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,937 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (((0 <= n1) && (0 <= tmp1)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,937 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (((0 <= n1) && (0 <= tmp1)) && (0 <= i2)) && (n2 != 0) [2024-01-29 22:59:36,937 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((0 <= n1) && (0 <= tmp1)) && (0 <= i) [2024-01-29 22:59:36,937 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (((0 <= n1) && (0 <= tmp1)) && (0 <= i2)) && (1 <= n2) [2024-01-29 22:59:36,937 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] 0 <= n1 [2024-01-29 22:59:36,937 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((0 <= n1) && (0 <= tmp1)) && (0 <= i1) [2024-01-29 22:59:36,937 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] (((0 <= n1) && (0 <= tmp1)) && (0 <= i2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,937 INFO L98 nessWitnessExtractor]: Location invariant before [L59-L59] ((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i1) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (0 <= i2) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,938 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,939 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] 0 <= n1 [2024-01-29 22:59:36,939 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ((0 <= n1) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,939 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,939 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ((0 <= n1) && (0 <= tmp1)) && (0 <= i2) [2024-01-29 22:59:36,939 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (((0 <= n1) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,940 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (((0 <= n1) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,940 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,940 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ((0 <= n1) && (0 <= tmp1)) && (0 <= i1) [2024-01-29 22:59:36,941 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] ((0 <= n1) && (0 <= tmp1)) && (1 <= i) [2024-01-29 22:59:36,941 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] 0 <= n1 [2024-01-29 22:59:36,941 INFO L98 nessWitnessExtractor]: Location invariant before [L98-L98] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,941 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,941 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,941 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i) [2024-01-29 22:59:36,941 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i2) [2024-01-29 22:59:36,941 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] 0 <= n1 [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i)) && (e2 == (_Bool)1) [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i)) && (0 <= i1) [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((0 <= n1) && (0 <= n2)) && (1 <= i) [2024-01-29 22:59:36,942 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((0 <= n1) && (0 <= n2)) && (1 <= i)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,943 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,943 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,943 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] 0 <= n1 [2024-01-29 22:59:36,943 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((0 <= n1) && (0 <= n2)) && (1 <= i)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,943 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,943 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,944 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,944 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((0 <= n1) && (0 <= n2)) && (1 <= i)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,944 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,944 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] 0 <= n1 [2024-01-29 22:59:36,944 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,944 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,944 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] ((0 <= n1) && (0 <= n2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,945 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,945 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] ((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)1) [2024-01-29 22:59:36,945 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,945 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,945 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,945 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,946 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,946 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] 0 <= n1 [2024-01-29 22:59:36,946 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,946 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,946 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((0 <= n1) && (0 <= i1)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,946 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((0 <= n1) && (0 <= i1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,946 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((0 <= n1) && (0 <= i1)) && (0 <= i2) [2024-01-29 22:59:36,946 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,947 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((0 <= n1) && (0 <= i1)) && (1 <= n2) [2024-01-29 22:59:36,948 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] ((0 <= n1) && (0 <= i1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,948 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,949 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= i) [2024-01-29 22:59:36,949 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,949 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,949 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,949 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= i1) [2024-01-29 22:59:36,949 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] 0 <= n1 [2024-01-29 22:59:36,949 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,949 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= i2) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= i1) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] ((((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= i2) [2024-01-29 22:59:36,950 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (((0 <= n1) && (0 <= n2)) && (0 <= tmp1)) && (0 <= i) [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] 0 <= n1 [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] 0 <= n1 [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ((0 <= n1) && (0 <= i1)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,951 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ((0 <= n1) && (0 <= i1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ((0 <= n1) && (0 <= i1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ((0 <= n1) && (0 <= i1)) && (0 <= i2) [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] ((0 <= n1) && (0 <= tmp2)) && (0 <= i2) [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (((0 <= n1) && (0 <= tmp2)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (((0 <= n1) && (0 <= tmp2)) && (0 <= i2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] ((0 <= n1) && (0 <= tmp2)) && (0 <= i1) [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] 0 <= n1 [2024-01-29 22:59:36,952 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] ((0 <= n1) && (0 <= tmp2)) && (0 <= i) [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (((0 <= n1) && (0 <= tmp2)) && (0 <= i2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (0 <= n1) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] 0 <= n1 [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,953 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (0 <= n1) && (0 <= i2) [2024-01-29 22:59:36,954 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] ((0 <= n1) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,954 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (0 <= n1) && (n2 == 0) [2024-01-29 22:59:36,954 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,954 INFO L98 nessWitnessExtractor]: Location invariant before [L101-L101] ((0 <= n1) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,954 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] 0 <= n1 [2024-01-29 22:59:36,954 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && (e1 == (_Bool)0) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && (0 <= tmp2) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && (0 <= i1) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && (0 <= i2) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L54-L54] (0 <= n1) && (0 <= i) [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,955 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0 <= n1) && (0 <= tmp1) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0 <= n1) && (0 <= tmp1)) && (0 <= i2) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0 <= n1) && (0 <= tmp1)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0 <= n1) && (0 <= tmp1)) && (0 <= i) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] 0 <= n1 [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0 <= n1) && (0 <= tmp1)) && (0 <= tmp2) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0 <= n1) && (0 <= tmp1)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0 <= n1) && (0 <= tmp1)) && (0 <= i1) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] ((0 <= n1) && (0 <= tmp1)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,956 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L96-L96] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] (e1 == (_Bool)0) && (tmp1 == 0) [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] ((e1 == (_Bool)0) && (tmp1 == 0)) && (i == 0) [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] e1 == (_Bool)0 [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] (e1 == (_Bool)0) && (n2 == 0) [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] (e1 == (_Bool)0) && (n1 == 0) [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] ((e1 == (_Bool)0) && (tmp1 == 0)) && (i1 == 0) [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] ((e1 == (_Bool)0) && (tmp1 == 0)) && (tmp2 == 0) [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] (e1 == (_Bool)0) && (e2 == (_Bool)0) [2024-01-29 22:59:36,957 INFO L98 nessWitnessExtractor]: Location invariant before [L110-L110] ((e1 == (_Bool)0) && (tmp1 == 0)) && (i2 == 0) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] 0 <= n1 [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,958 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L103-L103] (unsigned long )_argptr == 0UL [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] ((0 <= n2) && (0 <= i)) && (0 <= i2) [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (((0 <= n2) && (0 <= i)) && (0 <= i2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (((0 <= n2) && (0 <= i)) && (0 <= i2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (((0 <= n2) && (0 <= i)) && (0 <= i2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (0 <= n2) && (0 <= i) [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] 0 <= n2 [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (0 <= n2) && (0 <= tmp1) [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (((0 <= n2) && (0 <= i)) && (0 <= i2)) && (1 <= n1) [2024-01-29 22:59:36,959 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (0 <= n2) && (0 <= tmp2) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] ((0 <= n2) && (0 <= i)) && (0 <= i1) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] 0 <= n1 [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((0 <= n1) && (0 <= n2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,960 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i1) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] 0 <= n1 [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (0 <= i2) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (((0 <= n1) && (0 <= n2)) && (0 <= tmp2)) && (e2 == (_Bool)0) [2024-01-29 22:59:36,961 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (0 <= n1) && (0 <= n2) [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] 0 <= n1 [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] ((0 <= n1) && (0 <= n2)) && (0 <= i1) [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] ((0 <= n1) && (0 <= n2)) && (e1 == (_Bool)0 || e1 == (_Bool)1) [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] ((0 <= n1) && (0 <= n2)) && (e2 == (_Bool)0 || e2 == (_Bool)1) [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] ((0 <= n1) && (0 <= n2)) && (0 <= i) [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] ((0 <= n1) && (0 <= n2)) && (0 <= tmp1) [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] ((0 <= n1) && (0 <= n2)) && ((unsigned long )_argptr == 0UL) [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] ((0 <= n1) && (0 <= n2)) && (0 <= tmp2) [2024-01-29 22:59:36,962 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] ((0 <= n1) && (0 <= n2)) && (0 <= i2) [2024-01-29 22:59:36,983 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:59:37,137 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/test-easy6.wvr.c[3072,3085] [2024-01-29 22:59:37,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:59:37,155 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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 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 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 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 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 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 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 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 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 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 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 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 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:59:37,343 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/test-easy6.wvr.c[3072,3085] [2024-01-29 22:59:37,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:59:37,358 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:59:37,358 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37 WrapperNode [2024-01-29 22:59:37,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:59:37,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:59:37,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:59:37,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:59:37,369 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 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,385 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 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,423 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 515 [2024-01-29 22:59:37,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:59:37,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:59:37,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:59:37,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:59:37,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,460 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-29 22:59:37,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:59:37,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:59:37,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:59:37,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:59:37,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (1/1) ... [2024-01-29 22:59:37,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:59:37,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:59:37,568 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-29 22:59:37,570 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-29 22:59:37,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:59:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:59:37,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:59:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:59:37,599 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:59:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:59:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:59:37,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:59:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:59:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:59:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:59:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:59:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-29 22:59:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-29 22:59:37,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:59:37,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:59:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:59:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:59:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:59:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:59:37,602 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:59:37,690 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:59:37,692 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:59:38,555 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:59:38,555 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:59:40,974 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:59:40,976 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:59:40,976 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:59:40 BoogieIcfgContainer [2024-01-29 22:59:40,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:59:40,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:59:40,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:59:40,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:59:40,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:59:36" (1/4) ... [2024-01-29 22:59:40,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2634fcc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:59:40, skipping insertion in model container [2024-01-29 22:59:40,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:59:36" (2/4) ... [2024-01-29 22:59:40,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2634fcc3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:59:40, skipping insertion in model container [2024-01-29 22:59:40,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:59:37" (3/4) ... [2024-01-29 22:59:40,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2634fcc3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:59:40, skipping insertion in model container [2024-01-29 22:59:40,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:59:40" (4/4) ... [2024-01-29 22:59:40,985 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2024-01-29 22:59:41,002 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:59:41,002 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 392 error locations. [2024-01-29 22:59:41,002 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:59:41,291 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 22:59:41,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 453 transitions, 920 flow [2024-01-29 22:59:41,440 INFO L124 PetriNetUnfolderBase]: 0/451 cut-off events. [2024-01-29 22:59:41,440 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 22:59:41,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 451 events. 0/451 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3080 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-29 22:59:41,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 460 places, 453 transitions, 920 flow [2024-01-29 22:59:41,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 457 places, 450 transitions, 912 flow [2024-01-29 22:59:41,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:59:41,475 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;@4d306b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:59:41,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 776 error locations. [2024-01-29 22:59:41,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:59:41,477 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:59:41,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:59:41,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:41,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:59:41,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 22:59:41,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash 168824, now seen corresponding path program 1 times [2024-01-29 22:59:41,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444991888] [2024-01-29 22:59:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:41,863 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-29 22:59:41,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444991888] [2024-01-29 22:59:41,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444991888] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:41,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:41,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:59:41,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180224466] [2024-01-29 22:59:41,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:41,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:59:41,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:41,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:59:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:59:41,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 453 [2024-01-29 22:59:41,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 450 transitions, 912 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-29 22:59:41,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:41,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 453 [2024-01-29 22:59:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:45,335 INFO L124 PetriNetUnfolderBase]: 19343/35110 cut-off events. [2024-01-29 22:59:45,335 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-01-29 22:59:45,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67926 conditions, 35110 events. 19343/35110 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 348498 event pairs, 6231 based on Foata normal form. 2/11384 useless extension candidates. Maximal degree in co-relation 67124. Up to 30973 conditions per place. [2024-01-29 22:59:45,485 INFO L140 encePairwiseOnDemand]: 207/453 looper letters, 227 selfloop transitions, 3 changer transitions 0/285 dead transitions. [2024-01-29 22:59:45,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 285 transitions, 1045 flow [2024-01-29 22:59:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:59:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:59:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2024-01-29 22:59:45,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543046357615894 [2024-01-29 22:59:45,499 INFO L175 Difference]: Start difference. First operand has 457 places, 450 transitions, 912 flow. Second operand 3 states and 738 transitions. [2024-01-29 22:59:45,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 285 transitions, 1045 flow [2024-01-29 22:59:45,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 285 transitions, 1035 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 22:59:45,514 INFO L231 Difference]: Finished difference. Result has 233 places, 229 transitions, 515 flow [2024-01-29 22:59:45,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=233, PETRI_TRANSITIONS=229} [2024-01-29 22:59:45,518 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -224 predicate places. [2024-01-29 22:59:45,518 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 229 transitions, 515 flow [2024-01-29 22:59:45,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-29 22:59:45,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:45,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:59:45,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:59:45,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 22:59:45,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash 5238950, now seen corresponding path program 1 times [2024-01-29 22:59:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:45,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521840999] [2024-01-29 22:59:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:45,577 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-29 22:59:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521840999] [2024-01-29 22:59:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521840999] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:45,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596915525] [2024-01-29 22:59:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:45,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:45,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:45,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 453 [2024-01-29 22:59:45,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 229 transitions, 515 flow. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 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-29 22:59:45,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:45,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 453 [2024-01-29 22:59:45,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:48,280 INFO L124 PetriNetUnfolderBase]: 19774/36830 cut-off events. [2024-01-29 22:59:48,281 INFO L125 PetriNetUnfolderBase]: For 1301/1301 co-relation queries the response was YES. [2024-01-29 22:59:48,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73969 conditions, 36830 events. 19774/36830 cut-off events. For 1301/1301 co-relation queries the response was YES. Maximal size of possible extension queue 1996. Compared 385368 event pairs, 8526 based on Foata normal form. 0/13269 useless extension candidates. Maximal degree in co-relation 26332. Up to 15764 conditions per place. [2024-01-29 22:59:48,426 INFO L140 encePairwiseOnDemand]: 423/453 looper letters, 357 selfloop transitions, 8 changer transitions 0/411 dead transitions. [2024-01-29 22:59:48,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 411 transitions, 1630 flow [2024-01-29 22:59:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2024-01-29 22:59:48,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3294701986754967 [2024-01-29 22:59:48,428 INFO L175 Difference]: Start difference. First operand has 233 places, 229 transitions, 515 flow. Second operand 4 states and 597 transitions. [2024-01-29 22:59:48,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 411 transitions, 1630 flow [2024-01-29 22:59:48,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 411 transitions, 1625 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:59:48,456 INFO L231 Difference]: Finished difference. Result has 230 places, 226 transitions, 584 flow [2024-01-29 22:59:48,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=584, PETRI_PLACES=230, PETRI_TRANSITIONS=226} [2024-01-29 22:59:48,457 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -227 predicate places. [2024-01-29 22:59:48,457 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 226 transitions, 584 flow [2024-01-29 22:59:48,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 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-29 22:59:48,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:48,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:59:48,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:59:48,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 22:59:48,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash 162412929, now seen corresponding path program 1 times [2024-01-29 22:59:48,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:48,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952629755] [2024-01-29 22:59:48,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:48,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:48,515 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-29 22:59:48,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952629755] [2024-01-29 22:59:48,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952629755] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:48,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454233662] [2024-01-29 22:59:48,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:48,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:48,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:48,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:48,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:48,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 453 [2024-01-29 22:59:48,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 226 transitions, 584 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 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-29 22:59:48,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:48,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 453 [2024-01-29 22:59:48,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:51,093 INFO L124 PetriNetUnfolderBase]: 19584/37271 cut-off events. [2024-01-29 22:59:51,093 INFO L125 PetriNetUnfolderBase]: For 5696/5696 co-relation queries the response was YES. [2024-01-29 22:59:51,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76907 conditions, 37271 events. 19584/37271 cut-off events. For 5696/5696 co-relation queries the response was YES. Maximal size of possible extension queue 2014. Compared 392275 event pairs, 9416 based on Foata normal form. 0/16247 useless extension candidates. Maximal degree in co-relation 29918. Up to 32977 conditions per place. [2024-01-29 22:59:51,245 INFO L140 encePairwiseOnDemand]: 443/453 looper letters, 221 selfloop transitions, 6 changer transitions 0/272 dead transitions. [2024-01-29 22:59:51,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 272 transitions, 1164 flow [2024-01-29 22:59:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2024-01-29 22:59:51,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23344370860927152 [2024-01-29 22:59:51,248 INFO L175 Difference]: Start difference. First operand has 230 places, 226 transitions, 584 flow. Second operand 4 states and 423 transitions. [2024-01-29 22:59:51,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 272 transitions, 1164 flow [2024-01-29 22:59:51,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 272 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:59:51,272 INFO L231 Difference]: Finished difference. Result has 233 places, 230 transitions, 638 flow [2024-01-29 22:59:51,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=638, PETRI_PLACES=233, PETRI_TRANSITIONS=230} [2024-01-29 22:59:51,274 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -224 predicate places. [2024-01-29 22:59:51,274 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 230 transitions, 638 flow [2024-01-29 22:59:51,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 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-29 22:59:51,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:51,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:59:51,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:59:51,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 22:59:51,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash 739838682, now seen corresponding path program 1 times [2024-01-29 22:59:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042338824] [2024-01-29 22:59:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:51,335 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-29 22:59:51,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042338824] [2024-01-29 22:59:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042338824] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:51,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712427846] [2024-01-29 22:59:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:51,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:51,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:51,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:51,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 453 [2024-01-29 22:59:51,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 230 transitions, 638 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-29 22:59:51,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:51,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 453 [2024-01-29 22:59:51,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:54,101 INFO L124 PetriNetUnfolderBase]: 18519/35192 cut-off events. [2024-01-29 22:59:54,101 INFO L125 PetriNetUnfolderBase]: For 6868/6868 co-relation queries the response was YES. [2024-01-29 22:59:54,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73761 conditions, 35192 events. 18519/35192 cut-off events. For 6868/6868 co-relation queries the response was YES. Maximal size of possible extension queue 1852. Compared 367633 event pairs, 9235 based on Foata normal form. 0/16069 useless extension candidates. Maximal degree in co-relation 34397. Up to 27287 conditions per place. [2024-01-29 22:59:54,235 INFO L140 encePairwiseOnDemand]: 433/453 looper letters, 299 selfloop transitions, 10 changer transitions 0/353 dead transitions. [2024-01-29 22:59:54,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 353 transitions, 1566 flow [2024-01-29 22:59:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2024-01-29 22:59:54,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2891832229580574 [2024-01-29 22:59:54,238 INFO L175 Difference]: Start difference. First operand has 233 places, 230 transitions, 638 flow. Second operand 4 states and 524 transitions. [2024-01-29 22:59:54,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 353 transitions, 1566 flow [2024-01-29 22:59:54,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 353 transitions, 1566 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 22:59:54,283 INFO L231 Difference]: Finished difference. Result has 235 places, 229 transitions, 726 flow [2024-01-29 22:59:54,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=726, PETRI_PLACES=235, PETRI_TRANSITIONS=229} [2024-01-29 22:59:54,285 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -222 predicate places. [2024-01-29 22:59:54,286 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 229 transitions, 726 flow [2024-01-29 22:59:54,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-29 22:59:54,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:54,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:59:54,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:59:54,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 22:59:54,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:54,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1460167965, now seen corresponding path program 1 times [2024-01-29 22:59:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058267975] [2024-01-29 22:59:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:54,334 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-29 22:59:54,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:54,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058267975] [2024-01-29 22:59:54,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058267975] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:54,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:54,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252659504] [2024-01-29 22:59:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:54,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:54,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:54,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:54,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 453 [2024-01-29 22:59:54,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 229 transitions, 726 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-29 22:59:54,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:54,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 453 [2024-01-29 22:59:54,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:56,727 INFO L124 PetriNetUnfolderBase]: 15417/29788 cut-off events. [2024-01-29 22:59:56,727 INFO L125 PetriNetUnfolderBase]: For 11992/11992 co-relation queries the response was YES. [2024-01-29 22:59:56,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65716 conditions, 29788 events. 15417/29788 cut-off events. For 11992/11992 co-relation queries the response was YES. Maximal size of possible extension queue 1337. Compared 305669 event pairs, 5360 based on Foata normal form. 122/15463 useless extension candidates. Maximal degree in co-relation 32941. Up to 21068 conditions per place. [2024-01-29 22:59:57,001 INFO L140 encePairwiseOnDemand]: 435/453 looper letters, 360 selfloop transitions, 14 changer transitions 0/417 dead transitions. [2024-01-29 22:59:57,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 417 transitions, 1963 flow [2024-01-29 22:59:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2024-01-29 22:59:57,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32064017660044153 [2024-01-29 22:59:57,005 INFO L175 Difference]: Start difference. First operand has 235 places, 229 transitions, 726 flow. Second operand 4 states and 581 transitions. [2024-01-29 22:59:57,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 417 transitions, 1963 flow [2024-01-29 22:59:57,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 417 transitions, 1900 flow, removed 27 selfloop flow, removed 2 redundant places. [2024-01-29 22:59:57,103 INFO L231 Difference]: Finished difference. Result has 236 places, 231 transitions, 795 flow [2024-01-29 22:59:57,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=795, PETRI_PLACES=236, PETRI_TRANSITIONS=231} [2024-01-29 22:59:57,104 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -221 predicate places. [2024-01-29 22:59:57,104 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 231 transitions, 795 flow [2024-01-29 22:59:57,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 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-29 22:59:57,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:57,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:57,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:59:57,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 22:59:57,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1979427858, now seen corresponding path program 1 times [2024-01-29 22:59:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756985129] [2024-01-29 22:59:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:57,148 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-29 22:59:57,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756985129] [2024-01-29 22:59:57,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756985129] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:57,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:57,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312269395] [2024-01-29 22:59:57,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:57,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:57,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:57,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:57,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 453 [2024-01-29 22:59:57,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 231 transitions, 795 flow. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-29 22:59:57,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:57,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 453 [2024-01-29 22:59:57,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:59:59,101 INFO L124 PetriNetUnfolderBase]: 12914/25155 cut-off events. [2024-01-29 22:59:59,101 INFO L125 PetriNetUnfolderBase]: For 13673/13673 co-relation queries the response was YES. [2024-01-29 22:59:59,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57090 conditions, 25155 events. 12914/25155 cut-off events. For 13673/13673 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 251186 event pairs, 5443 based on Foata normal form. 80/13188 useless extension candidates. Maximal degree in co-relation 28356. Up to 17339 conditions per place. [2024-01-29 22:59:59,210 INFO L140 encePairwiseOnDemand]: 436/453 looper letters, 279 selfloop transitions, 9 changer transitions 0/330 dead transitions. [2024-01-29 22:59:59,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 330 transitions, 1672 flow [2024-01-29 22:59:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:59:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:59:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2024-01-29 22:59:59,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2682119205298013 [2024-01-29 22:59:59,212 INFO L175 Difference]: Start difference. First operand has 236 places, 231 transitions, 795 flow. Second operand 4 states and 486 transitions. [2024-01-29 22:59:59,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 330 transitions, 1672 flow [2024-01-29 22:59:59,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 330 transitions, 1672 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 22:59:59,242 INFO L231 Difference]: Finished difference. Result has 239 places, 233 transitions, 886 flow [2024-01-29 22:59:59,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=886, PETRI_PLACES=239, PETRI_TRANSITIONS=233} [2024-01-29 22:59:59,243 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -218 predicate places. [2024-01-29 22:59:59,243 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 233 transitions, 886 flow [2024-01-29 22:59:59,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-29 22:59:59,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:59:59,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:59:59,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:59:59,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 22:59:59,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:59:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 440504296, now seen corresponding path program 1 times [2024-01-29 22:59:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:59:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435783512] [2024-01-29 22:59:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:59:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:59:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:59:59,275 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-29 22:59:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:59:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435783512] [2024-01-29 22:59:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435783512] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:59:59,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:59:59,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:59:59,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201023397] [2024-01-29 22:59:59,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:59:59,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:59:59,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:59:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:59:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:59:59,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 453 [2024-01-29 22:59:59,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 233 transitions, 886 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-29 22:59:59,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:59:59,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 453 [2024-01-29 22:59:59,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:01,404 INFO L124 PetriNetUnfolderBase]: 12630/24645 cut-off events. [2024-01-29 23:00:01,405 INFO L125 PetriNetUnfolderBase]: For 16304/16304 co-relation queries the response was YES. [2024-01-29 23:00:01,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57786 conditions, 24645 events. 12630/24645 cut-off events. For 16304/16304 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 245167 event pairs, 7018 based on Foata normal form. 0/13703 useless extension candidates. Maximal degree in co-relation 28856. Up to 20727 conditions per place. [2024-01-29 23:00:01,498 INFO L140 encePairwiseOnDemand]: 443/453 looper letters, 241 selfloop transitions, 10 changer transitions 0/292 dead transitions. [2024-01-29 23:00:01,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 292 transitions, 1562 flow [2024-01-29 23:00:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2024-01-29 23:00:01,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2422737306843267 [2024-01-29 23:00:01,500 INFO L175 Difference]: Start difference. First operand has 239 places, 233 transitions, 886 flow. Second operand 4 states and 439 transitions. [2024-01-29 23:00:01,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 292 transitions, 1562 flow [2024-01-29 23:00:01,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 292 transitions, 1556 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:00:01,535 INFO L231 Difference]: Finished difference. Result has 240 places, 230 transitions, 924 flow [2024-01-29 23:00:01,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=924, PETRI_PLACES=240, PETRI_TRANSITIONS=230} [2024-01-29 23:00:01,536 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -217 predicate places. [2024-01-29 23:00:01,536 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 230 transitions, 924 flow [2024-01-29 23:00:01,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 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-29 23:00:01,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:01,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:01,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:00:01,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 23:00:01,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash 120965701, now seen corresponding path program 1 times [2024-01-29 23:00:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:01,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323003960] [2024-01-29 23:00:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:01,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:01,652 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-29 23:00:01,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323003960] [2024-01-29 23:00:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323003960] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:01,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326704522] [2024-01-29 23:00:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:01,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:01,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 453 [2024-01-29 23:00:01,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 230 transitions, 924 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-29 23:00:01,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:01,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 453 [2024-01-29 23:00:01,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:03,624 INFO L124 PetriNetUnfolderBase]: 11507/22033 cut-off events. [2024-01-29 23:00:03,624 INFO L125 PetriNetUnfolderBase]: For 17531/17531 co-relation queries the response was YES. [2024-01-29 23:00:03,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53241 conditions, 22033 events. 11507/22033 cut-off events. For 17531/17531 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 213018 event pairs, 6535 based on Foata normal form. 1214/14405 useless extension candidates. Maximal degree in co-relation 26464. Up to 20224 conditions per place. [2024-01-29 23:00:03,727 INFO L140 encePairwiseOnDemand]: 434/453 looper letters, 199 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2024-01-29 23:00:03,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 239 transitions, 1360 flow [2024-01-29 23:00:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2024-01-29 23:00:03,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2163355408388521 [2024-01-29 23:00:03,729 INFO L175 Difference]: Start difference. First operand has 240 places, 230 transitions, 924 flow. Second operand 4 states and 392 transitions. [2024-01-29 23:00:03,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 239 transitions, 1360 flow [2024-01-29 23:00:03,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 239 transitions, 1340 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:00:03,798 INFO L231 Difference]: Finished difference. Result has 223 places, 213 transitions, 870 flow [2024-01-29 23:00:03,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=870, PETRI_PLACES=223, PETRI_TRANSITIONS=213} [2024-01-29 23:00:03,799 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -234 predicate places. [2024-01-29 23:00:03,799 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 213 transitions, 870 flow [2024-01-29 23:00:03,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-29 23:00:03,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:03,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:03,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:00:03,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 23:00:03,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash -545025006, now seen corresponding path program 1 times [2024-01-29 23:00:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:03,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260581401] [2024-01-29 23:00:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:03,909 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-29 23:00:03,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:03,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260581401] [2024-01-29 23:00:03,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260581401] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:03,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:03,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:00:03,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228569607] [2024-01-29 23:00:03,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:03,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:03,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:03,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:03,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 453 [2024-01-29 23:00:03,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 213 transitions, 870 flow. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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-29 23:00:03,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:03,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 453 [2024-01-29 23:00:03,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:05,860 INFO L124 PetriNetUnfolderBase]: 11063/21270 cut-off events. [2024-01-29 23:00:05,860 INFO L125 PetriNetUnfolderBase]: For 16035/16035 co-relation queries the response was YES. [2024-01-29 23:00:05,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51190 conditions, 21270 events. 11063/21270 cut-off events. For 16035/16035 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 205285 event pairs, 5832 based on Foata normal form. 48/12709 useless extension candidates. Maximal degree in co-relation 51147. Up to 18639 conditions per place. [2024-01-29 23:00:06,015 INFO L140 encePairwiseOnDemand]: 438/453 looper letters, 214 selfloop transitions, 7 changer transitions 0/259 dead transitions. [2024-01-29 23:00:06,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 259 transitions, 1486 flow [2024-01-29 23:00:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2024-01-29 23:00:06,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24724061810154527 [2024-01-29 23:00:06,019 INFO L175 Difference]: Start difference. First operand has 223 places, 213 transitions, 870 flow. Second operand 4 states and 448 transitions. [2024-01-29 23:00:06,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 259 transitions, 1486 flow [2024-01-29 23:00:06,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 259 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:06,276 INFO L231 Difference]: Finished difference. Result has 226 places, 219 transitions, 954 flow [2024-01-29 23:00:06,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=954, PETRI_PLACES=226, PETRI_TRANSITIONS=219} [2024-01-29 23:00:06,277 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -231 predicate places. [2024-01-29 23:00:06,277 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 219 transitions, 954 flow [2024-01-29 23:00:06,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 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-29 23:00:06,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:06,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:06,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:00:06,278 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 23:00:06,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash 271938898, now seen corresponding path program 1 times [2024-01-29 23:00:06,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:06,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116823896] [2024-01-29 23:00:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:06,325 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-29 23:00:06,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116823896] [2024-01-29 23:00:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116823896] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:00:06,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887903223] [2024-01-29 23:00:06,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:06,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:06,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:06,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:06,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 453 [2024-01-29 23:00:06,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 219 transitions, 954 flow. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 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-29 23:00:06,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:06,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 453 [2024-01-29 23:00:06,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:08,010 INFO L124 PetriNetUnfolderBase]: 10342/19336 cut-off events. [2024-01-29 23:00:08,010 INFO L125 PetriNetUnfolderBase]: For 16665/16665 co-relation queries the response was YES. [2024-01-29 23:00:08,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48322 conditions, 19336 events. 10342/19336 cut-off events. For 16665/16665 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 180935 event pairs, 3296 based on Foata normal form. 1022/13283 useless extension candidates. Maximal degree in co-relation 48278. Up to 18106 conditions per place. [2024-01-29 23:00:08,096 INFO L140 encePairwiseOnDemand]: 435/453 looper letters, 230 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2024-01-29 23:00:08,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 260 transitions, 1608 flow [2024-01-29 23:00:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:00:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:00:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2024-01-29 23:00:08,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22958057395143489 [2024-01-29 23:00:08,098 INFO L175 Difference]: Start difference. First operand has 226 places, 219 transitions, 954 flow. Second operand 4 states and 416 transitions. [2024-01-29 23:00:08,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 260 transitions, 1608 flow [2024-01-29 23:00:08,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 260 transitions, 1608 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 23:00:08,192 INFO L231 Difference]: Finished difference. Result has 213 places, 203 transitions, 922 flow [2024-01-29 23:00:08,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=922, PETRI_PLACES=213, PETRI_TRANSITIONS=203} [2024-01-29 23:00:08,193 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -244 predicate places. [2024-01-29 23:00:08,193 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 203 transitions, 922 flow [2024-01-29 23:00:08,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 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-29 23:00:08,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:08,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:08,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 23:00:08,194 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 23:00:08,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash -159822986, now seen corresponding path program 1 times [2024-01-29 23:00:08,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:08,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551224756] [2024-01-29 23:00:08,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:08,224 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-29 23:00:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:08,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551224756] [2024-01-29 23:00:08,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551224756] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:08,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:08,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:00:08,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782024824] [2024-01-29 23:00:08,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:08,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:00:08,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:00:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:00:08,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 453 [2024-01-29 23:00:08,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 203 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-29 23:00:08,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:08,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 453 [2024-01-29 23:00:08,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:09,798 INFO L124 PetriNetUnfolderBase]: 10066/18807 cut-off events. [2024-01-29 23:00:09,798 INFO L125 PetriNetUnfolderBase]: For 16208/16208 co-relation queries the response was YES. [2024-01-29 23:00:09,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47056 conditions, 18807 events. 10066/18807 cut-off events. For 16208/16208 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 175838 event pairs, 6140 based on Foata normal form. 31/11715 useless extension candidates. Maximal degree in co-relation 47011. Up to 15925 conditions per place. [2024-01-29 23:00:09,909 INFO L140 encePairwiseOnDemand]: 446/453 looper letters, 201 selfloop transitions, 5 changer transitions 0/235 dead transitions. [2024-01-29 23:00:09,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 235 transitions, 1475 flow [2024-01-29 23:00:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:00:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:00:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2024-01-29 23:00:09,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2678440029433407 [2024-01-29 23:00:09,911 INFO L175 Difference]: Start difference. First operand has 213 places, 203 transitions, 922 flow. Second operand 3 states and 364 transitions. [2024-01-29 23:00:09,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 235 transitions, 1475 flow [2024-01-29 23:00:10,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 235 transitions, 1470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:10,008 INFO L231 Difference]: Finished difference. Result has 213 places, 202 transitions, 940 flow [2024-01-29 23:00:10,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=940, PETRI_PLACES=213, PETRI_TRANSITIONS=202} [2024-01-29 23:00:10,009 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -244 predicate places. [2024-01-29 23:00:10,009 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 202 transitions, 940 flow [2024-01-29 23:00:10,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-29 23:00:10,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:10,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:10,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 23:00:10,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err22ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 23:00:10,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash 217174181, now seen corresponding path program 1 times [2024-01-29 23:00:10,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:10,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512719910] [2024-01-29 23:00:10,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:10,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:10,054 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-29 23:00:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512719910] [2024-01-29 23:00:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512719910] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:10,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:00:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274013246] [2024-01-29 23:00:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:10,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:00:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:00:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:00:10,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 453 [2024-01-29 23:00:10,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 202 transitions, 940 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-29 23:00:10,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:10,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 453 [2024-01-29 23:00:10,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:11,438 INFO L124 PetriNetUnfolderBase]: 9954/18627 cut-off events. [2024-01-29 23:00:11,439 INFO L125 PetriNetUnfolderBase]: For 16901/16901 co-relation queries the response was YES. [2024-01-29 23:00:11,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46916 conditions, 18627 events. 9954/18627 cut-off events. For 16901/16901 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 173682 event pairs, 5636 based on Foata normal form. 13/11697 useless extension candidates. Maximal degree in co-relation 46869. Up to 17203 conditions per place. [2024-01-29 23:00:11,564 INFO L140 encePairwiseOnDemand]: 445/453 looper letters, 188 selfloop transitions, 5 changer transitions 0/222 dead transitions. [2024-01-29 23:00:11,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 222 transitions, 1404 flow [2024-01-29 23:00:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:00:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:00:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2024-01-29 23:00:11,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26048565121412803 [2024-01-29 23:00:11,566 INFO L175 Difference]: Start difference. First operand has 213 places, 202 transitions, 940 flow. Second operand 3 states and 354 transitions. [2024-01-29 23:00:11,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 222 transitions, 1404 flow [2024-01-29 23:00:11,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 222 transitions, 1365 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-01-29 23:00:11,650 INFO L231 Difference]: Finished difference. Result has 212 places, 202 transitions, 927 flow [2024-01-29 23:00:11,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=927, PETRI_PLACES=212, PETRI_TRANSITIONS=202} [2024-01-29 23:00:11,650 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -245 predicate places. [2024-01-29 23:00:11,651 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 202 transitions, 927 flow [2024-01-29 23:00:11,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-29 23:00:11,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:11,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:11,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 23:00:11,651 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err29ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 23:00:11,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash 217174188, now seen corresponding path program 1 times [2024-01-29 23:00:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:11,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537996452] [2024-01-29 23:00:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:11,696 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-29 23:00:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:11,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537996452] [2024-01-29 23:00:11,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537996452] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:11,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:11,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:00:11,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927457915] [2024-01-29 23:00:11,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:11,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:00:11,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:11,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:00:11,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:00:11,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 453 [2024-01-29 23:00:11,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 202 transitions, 927 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-29 23:00:11,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:11,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 453 [2024-01-29 23:00:11,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:00:13,153 INFO L124 PetriNetUnfolderBase]: 9854/18433 cut-off events. [2024-01-29 23:00:13,153 INFO L125 PetriNetUnfolderBase]: For 15387/15387 co-relation queries the response was YES. [2024-01-29 23:00:13,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46025 conditions, 18433 events. 9854/18433 cut-off events. For 15387/15387 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 171713 event pairs, 5642 based on Foata normal form. 50/11652 useless extension candidates. Maximal degree in co-relation 45979. Up to 17195 conditions per place. [2024-01-29 23:00:13,259 INFO L140 encePairwiseOnDemand]: 446/453 looper letters, 184 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2024-01-29 23:00:13,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 218 transitions, 1370 flow [2024-01-29 23:00:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:00:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:00:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2024-01-29 23:00:13,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2568064753495217 [2024-01-29 23:00:13,261 INFO L175 Difference]: Start difference. First operand has 212 places, 202 transitions, 927 flow. Second operand 3 states and 349 transitions. [2024-01-29 23:00:13,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 218 transitions, 1370 flow [2024-01-29 23:00:13,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 218 transitions, 1360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:00:13,338 INFO L231 Difference]: Finished difference. Result has 213 places, 202 transitions, 940 flow [2024-01-29 23:00:13,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=940, PETRI_PLACES=213, PETRI_TRANSITIONS=202} [2024-01-29 23:00:13,339 INFO L281 CegarLoopForPetriNet]: 457 programPoint places, -244 predicate places. [2024-01-29 23:00:13,339 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 202 transitions, 940 flow [2024-01-29 23:00:13,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-29 23:00:13,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:00:13,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:00:13,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 23:00:13,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err23ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 773 more)] === [2024-01-29 23:00:13,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:00:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash 217174182, now seen corresponding path program 1 times [2024-01-29 23:00:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:00:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309059496] [2024-01-29 23:00:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:00:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:00:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:00:13,403 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-29 23:00:13,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:00:13,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309059496] [2024-01-29 23:00:13,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309059496] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:00:13,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:00:13,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:00:13,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441454701] [2024-01-29 23:00:13,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:00:13,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:00:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:00:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:00:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:00:13,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 453 [2024-01-29 23:00:13,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 202 transitions, 940 flow. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 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-29 23:00:13,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:00:13,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 453 [2024-01-29 23:00:13,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand