./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/circular_buffer_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ab2e0ac4 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/circular_buffer_bad.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-ab2e0ac-m [2024-01-29 14:39:47,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 14:39:48,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 14:39:48,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 14:39:48,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 14:39:48,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 14:39:48,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 14:39:48,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 14:39:48,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 14:39:48,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 14:39:48,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 14:39:48,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 14:39:48,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 14:39:48,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 14:39:48,070 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 14:39:48,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 14:39:48,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 14:39:48,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 14:39:48,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 14:39:48,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 14:39:48,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 14:39:48,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 14:39:48,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 14:39:48,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 14:39:48,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 14:39:48,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 14:39:48,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 14:39:48,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 14:39:48,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 14:39:48,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 14:39:48,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 14:39:48,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 14:39:48,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:39:48,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 14:39:48,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 14:39:48,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 14:39:48,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 14:39:48,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 14:39:48,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 14:39:48,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 14:39:48,077 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 14:39:48,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 14:39:48,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 14:39:48,077 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 14:39:48,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 14:39:48,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 14:39:48,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 14:39:48,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 14:39:48,322 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 14:39:48,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2024-01-29 14:39:49,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 14:39:49,679 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 14:39:49,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2024-01-29 14:39:49,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f8ff1d7/dbf5db8fe4c248fda550450c42d7bcd6/FLAGcd1117b99 [2024-01-29 14:39:49,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f8ff1d7/dbf5db8fe4c248fda550450c42d7bcd6 [2024-01-29 14:39:49,711 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 14:39:49,712 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 14:39:49,712 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/circular_buffer_bad.yml/witness.yml [2024-01-29 14:39:49,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 14:39:49,845 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 14:39:49,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 14:39:49,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 14:39:49,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 14:39:49,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:39:49" (1/2) ... [2024-01-29 14:39:49,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478432be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:39:49, skipping insertion in model container [2024-01-29 14:39:49,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 02:39:49" (1/2) ... [2024-01-29 14:39:49,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1cd28a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 02:39:49, skipping insertion in model container [2024-01-29 14:39:49,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:39:49" (2/2) ... [2024-01-29 14:39:49,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478432be and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:39:49, skipping insertion in model container [2024-01-29 14:39:49,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:39:49" (2/2) ... [2024-01-29 14:39:49,854 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 14:39:49,933 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 14:39:49,934 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,934 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] b <= 6 [2024-01-29 14:39:49,935 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] 0 <= b [2024-01-29 14:39:49,935 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] b <= 127 [2024-01-29 14:39:49,935 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] send == (_Bool)1 [2024-01-29 14:39:49,935 INFO L98 nessWitnessExtractor]: Location invariant before [L710-L710] (((((b == 0 || b == 1) || b == 2) || b == 3) || b == 4) || b == 5) || b == 6 [2024-01-29 14:39:49,935 INFO L98 nessWitnessExtractor]: Location invariant before [L750-L750] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,935 INFO L98 nessWitnessExtractor]: Location invariant before [L750-L750] (unsigned long )arg == 0UL [2024-01-29 14:39:49,935 INFO L98 nessWitnessExtractor]: Location invariant before [L750-L750] ((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4 [2024-01-29 14:39:49,936 INFO L98 nessWitnessExtractor]: Location invariant before [L750-L750] receive == (_Bool)0 [2024-01-29 14:39:49,936 INFO L98 nessWitnessExtractor]: Location invariant before [L747-L747] receive == (_Bool)1 [2024-01-29 14:39:49,936 INFO L98 nessWitnessExtractor]: Location invariant before [L747-L747] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,936 INFO L98 nessWitnessExtractor]: Location invariant before [L747-L747] (unsigned long )arg == 0UL [2024-01-29 14:39:49,936 INFO L98 nessWitnessExtractor]: Location invariant before [L747-L747] ((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || ((((-128 <= i && 5 <= i) && i <= 6) && i <= 127) && (((((((i == -1 || i == 0) || i == 1) || i == 2) || i == 3) || i == 4) || i == 5) || i == 6))) || i == 4 [2024-01-29 14:39:49,936 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] max == 10 [2024-01-29 14:39:49,936 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] send == (_Bool)0 [2024-01-29 14:39:49,937 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] receive == (_Bool)0 [2024-01-29 14:39:49,937 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] 10 == max [2024-01-29 14:39:49,937 INFO L98 nessWitnessExtractor]: Location invariant before [L735-L735] (unsigned long )arg == 0UL [2024-01-29 14:39:49,937 INFO L98 nessWitnessExtractor]: Location invariant before [L735-L735] i == 7 [2024-01-29 14:39:49,937 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,938 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] receive == (_Bool)1 [2024-01-29 14:39:49,938 INFO L98 nessWitnessExtractor]: Location invariant before [L752-L752] (unsigned long )arg == 0UL [2024-01-29 14:39:49,938 INFO L98 nessWitnessExtractor]: Location invariant before [L752-L752] i == 7 [2024-01-29 14:39:49,938 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] 0 <= b [2024-01-29 14:39:49,938 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] b <= 6 [2024-01-29 14:39:49,938 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] b <= 127 [2024-01-29 14:39:49,938 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] send == (_Bool)1 [2024-01-29 14:39:49,939 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] (((((b == 0 || b == 1) || b == 2) || b == 3) || b == 4) || b == 5) || b == 6 [2024-01-29 14:39:49,939 INFO L98 nessWitnessExtractor]: Location invariant before [L709-L709] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,939 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,939 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] receive == (_Bool)1 [2024-01-29 14:39:49,939 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] receive == (_Bool)1 [2024-01-29 14:39:49,939 INFO L98 nessWitnessExtractor]: Location invariant before [L702-L702] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,939 INFO L98 nessWitnessExtractor]: Location invariant before [L730-L730] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,940 INFO L98 nessWitnessExtractor]: Location invariant before [L730-L730] (((((i == 5 || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || i == 6 [2024-01-29 14:39:49,940 INFO L98 nessWitnessExtractor]: Location invariant before [L730-L730] (unsigned long )arg == 0UL [2024-01-29 14:39:49,940 INFO L98 nessWitnessExtractor]: Location invariant before [L730-L730] send == (_Bool)1 [2024-01-29 14:39:49,941 INFO L98 nessWitnessExtractor]: Location invariant after [L745-L746] receive == (_Bool)1 [2024-01-29 14:39:49,941 INFO L98 nessWitnessExtractor]: Location invariant before [L745-L746] (unsigned long )arg == 0UL [2024-01-29 14:39:49,941 INFO L98 nessWitnessExtractor]: Location invariant after [L745-L746] ((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4 [2024-01-29 14:39:49,941 INFO L98 nessWitnessExtractor]: Location invariant before [L745-L746] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,942 INFO L98 nessWitnessExtractor]: Location invariant before [L745-L746] (((((((((i == 3 || i == 2) || i == 2) || i == 1) || i == 1) || (0 == i && i == 0)) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || (5 <= i && i <= 6)) || i == 4) || i == 4 [2024-01-29 14:39:49,942 INFO L98 nessWitnessExtractor]: Location invariant after [L745-L746] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,942 INFO L98 nessWitnessExtractor]: Location invariant before [L745-L746] receive == (_Bool)1 [2024-01-29 14:39:49,942 INFO L98 nessWitnessExtractor]: Location invariant after [L745-L746] (unsigned long )arg == 0UL [2024-01-29 14:39:49,942 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] send == (_Bool)1 [2024-01-29 14:39:49,942 INFO L98 nessWitnessExtractor]: Location invariant before [L761-L761] receive == (_Bool)0 [2024-01-29 14:39:49,943 INFO L98 nessWitnessExtractor]: Location invariant before [L758-L758] send == (_Bool)0 [2024-01-29 14:39:49,943 INFO L98 nessWitnessExtractor]: Location invariant before [L758-L758] receive == (_Bool)0 [2024-01-29 14:39:49,943 INFO L98 nessWitnessExtractor]: Loop invariant at [L740-L751] (unsigned long )arg == 0UL [2024-01-29 14:39:49,943 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] (unsigned long )arg == 0UL [2024-01-29 14:39:49,943 INFO L98 nessWitnessExtractor]: Location invariant before [L726-L726] (((((i == 6 || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-01-29 14:39:49,943 INFO L98 nessWitnessExtractor]: Location invariant before [L743-L749] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,944 INFO L98 nessWitnessExtractor]: Location invariant before [L743-L749] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,944 INFO L98 nessWitnessExtractor]: Location invariant before [L743-L749] (unsigned long )arg == 0UL [2024-01-29 14:39:49,944 INFO L98 nessWitnessExtractor]: Location invariant before [L743-L749] ((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4 [2024-01-29 14:39:49,945 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] (((((b == 0 || b == 1) || b == 2) || b == 3) || b == 4) || b == 5) || b == 6 [2024-01-29 14:39:49,945 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] 0 <= b [2024-01-29 14:39:49,945 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] send == (_Bool)1 [2024-01-29 14:39:49,945 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] b <= 6 [2024-01-29 14:39:49,945 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] b <= 127 [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L717-L717] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L729-L729] (((((i == 5 || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || i == 6 [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L729-L729] (unsigned long )arg == 0UL [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L729-L729] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L729-L729] send == (_Bool)1 [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L759-L759] send == (_Bool)0 [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L759-L759] receive == (_Bool)0 [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L760-L760] receive == (_Bool)0 [2024-01-29 14:39:49,946 INFO L98 nessWitnessExtractor]: Location invariant before [L760-L760] send == (_Bool)1 [2024-01-29 14:39:49,947 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,947 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (((((i == 5 || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || i == 6 [2024-01-29 14:39:49,947 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] send == (_Bool)0 [2024-01-29 14:39:49,947 INFO L98 nessWitnessExtractor]: Location invariant before [L733-L733] (unsigned long )arg == 0UL [2024-01-29 14:39:49,947 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L718] b <= 127 [2024-01-29 14:39:49,947 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L718] send == (_Bool)1 [2024-01-29 14:39:49,947 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L718] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,948 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L718] 0 <= b [2024-01-29 14:39:49,948 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L718] b <= 6 [2024-01-29 14:39:49,948 INFO L98 nessWitnessExtractor]: Location invariant before [L707-L718] (((((b == 0 || b == 1) || b == 2) || b == 3) || b == 4) || b == 5) || b == 6 [2024-01-29 14:39:49,948 INFO L98 nessWitnessExtractor]: Location invariant after [L688-L692] 10 == max [2024-01-29 14:39:49,949 INFO L98 nessWitnessExtractor]: Location invariant after [L688-L692] receive == (_Bool)0 [2024-01-29 14:39:49,949 INFO L98 nessWitnessExtractor]: Location invariant after [L688-L692] max == 10 [2024-01-29 14:39:49,949 INFO L98 nessWitnessExtractor]: Location invariant after [L688-L692] send == (_Bool)0 [2024-01-29 14:39:49,949 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] b <= 127 [2024-01-29 14:39:49,949 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] send == (_Bool)1 [2024-01-29 14:39:49,949 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] (((((b == 0 || b == 1) || b == 2) || b == 3) || b == 4) || b == 5) || b == 6 [2024-01-29 14:39:49,949 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] b <= 6 [2024-01-29 14:39:49,949 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,950 INFO L98 nessWitnessExtractor]: Location invariant before [L719-L719] 0 <= b [2024-01-29 14:39:49,950 INFO L98 nessWitnessExtractor]: Location invariant before [L731-L731] (((((i == 5 || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0)) || i == 6 [2024-01-29 14:39:49,950 INFO L98 nessWitnessExtractor]: Location invariant before [L731-L731] (unsigned long )arg == 0UL [2024-01-29 14:39:49,950 INFO L98 nessWitnessExtractor]: Location invariant before [L731-L731] send == (_Bool)0 [2024-01-29 14:39:49,950 INFO L98 nessWitnessExtractor]: Location invariant before [L731-L731] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,950 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] receive == (_Bool)0 [2024-01-29 14:39:49,950 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] max == 10 [2024-01-29 14:39:49,950 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] send == (_Bool)0 [2024-01-29 14:39:49,951 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] 10 == max [2024-01-29 14:39:49,951 INFO L98 nessWitnessExtractor]: Location invariant before [L748-L748] receive == (_Bool)0 [2024-01-29 14:39:49,951 INFO L98 nessWitnessExtractor]: Location invariant before [L748-L748] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,951 INFO L98 nessWitnessExtractor]: Location invariant before [L748-L748] ((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || ((((-128 <= i && 5 <= i) && i <= 6) && i <= 127) && (((((((i == -1 || i == 0) || i == 1) || i == 2) || i == 3) || i == 4) || i == 5) || i == 6))) || i == 4 [2024-01-29 14:39:49,951 INFO L98 nessWitnessExtractor]: Location invariant before [L748-L748] (unsigned long )arg == 0UL [2024-01-29 14:39:49,951 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L713] 0 <= b [2024-01-29 14:39:49,952 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L713] send == (_Bool)1 [2024-01-29 14:39:49,952 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L713] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,952 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L713] (((((b == 0 || b == 1) || b == 2) || b == 3) || b == 4) || b == 5) || b == 6 [2024-01-29 14:39:49,952 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L713] b <= 127 [2024-01-29 14:39:49,953 INFO L98 nessWitnessExtractor]: Location invariant before [L712-L713] b <= 6 [2024-01-29 14:39:49,953 INFO L98 nessWitnessExtractor]: Location invariant before [L695-L703] receive == (_Bool)1 [2024-01-29 14:39:49,954 INFO L98 nessWitnessExtractor]: Location invariant before [L695-L703] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,954 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] ((((i == 3 || i == 2) || i == 1) || (0 == i && i == 0)) || (5 <= i && i <= 6)) || i == 4 [2024-01-29 14:39:49,954 INFO L98 nessWitnessExtractor]: Location invariant before [L742-L742] (unsigned long )arg == 0UL [2024-01-29 14:39:49,954 INFO L98 nessWitnessExtractor]: Loop invariant at [L724-L734] (unsigned long )arg == 0UL [2024-01-29 14:39:49,954 INFO L98 nessWitnessExtractor]: Location invariant before [L757-L757] send == (_Bool)0 [2024-01-29 14:39:49,955 INFO L98 nessWitnessExtractor]: Location invariant before [L757-L757] receive == (_Bool)0 [2024-01-29 14:39:49,955 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L732] send == (_Bool)0 || send == (_Bool)1 [2024-01-29 14:39:49,955 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L732] (((((i == 6 || i == 5) || i == 4) || i == 3) || i == 2) || i == 1) || (0 == i && i == 0) [2024-01-29 14:39:49,955 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L732] receive == (_Bool)0 || receive == (_Bool)1 [2024-01-29 14:39:49,955 INFO L98 nessWitnessExtractor]: Location invariant before [L727-L732] (unsigned long )arg == 0UL [2024-01-29 14:39:50,049 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 14:39:50,317 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30440,30453] [2024-01-29 14:39:50,329 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30895,30908] [2024-01-29 14:39:50,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:39:50,361 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 [2024-01-29 14:39:50,430 WARN L424 MainDispatcher]: Unable to annotate void initLog(int max) { buffer_size = max; first = next = 0; } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 14:39:50,445 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30440,30453] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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 14:39:50,468 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30895,30908] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local 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 14:39:50,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 14:39:50,571 INFO L206 MainTranslator]: Completed translation [2024-01-29 14:39:50,572 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 02:39:50 WrapperNode [2024-01-29 14:39:50,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 14:39:50,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 14:39:50,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 14:39:50,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 14:39:50,578 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,593 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,620 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2024-01-29 14:39:50,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 14:39:50,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 14:39:50,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 14:39:50,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 14:39:50,630 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,630 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,634 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,647 INFO L175 MemorySlicer]: Split 18 memory accesses to 6 slices as follows [2, 1, 3, 8, 2, 2]. 44 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8, 0, 0]. The 4 writes are split as follows [0, 0, 2, 0, 1, 1]. [2024-01-29 14:39:50,648 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,648 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,657 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,660 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,662 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,663 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 14:39:50,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 14:39:50,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 14:39:50,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 14:39:50,684 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 02:39:50" (1/1) ... [2024-01-29 14:39:50,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 14:39:50,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:39:50,734 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 14:39:50,758 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 14:39:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 14:39:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 14:39:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 14:39:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 14:39:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-29 14:39:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-29 14:39:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-29 14:39:50,788 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-29 14:39:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-29 14:39:50,788 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-29 14:39:50,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 14:39:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 14:39:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 14:39:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 14:39:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-29 14:39:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-29 14:39:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 14:39:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 14:39:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 14:39:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 14:39:50,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-01-29 14:39:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-01-29 14:39:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-01-29 14:39:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-01-29 14:39:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-01-29 14:39:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-01-29 14:39:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 14:39:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 14:39:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 14:39:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 14:39:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-29 14:39:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-29 14:39:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 14:39:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 14:39:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 14:39:50,801 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 14:39:50,930 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 14:39:50,932 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 14:39:51,334 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 14:39:51,334 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 14:39:51,412 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 14:39:51,412 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-29 14:39:51,412 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:39:51 BoogieIcfgContainer [2024-01-29 14:39:51,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 14:39:51,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 14:39:51,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 14:39:51,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 14:39:51,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 02:39:49" (1/4) ... [2024-01-29 14:39:51,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4664734f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 02:39:51, skipping insertion in model container [2024-01-29 14:39:51,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 02:39:49" (2/4) ... [2024-01-29 14:39:51,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4664734f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:39:51, skipping insertion in model container [2024-01-29 14:39:51,417 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 02:39:50" (3/4) ... [2024-01-29 14:39:51,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4664734f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 02:39:51, skipping insertion in model container [2024-01-29 14:39:51,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 02:39:51" (4/4) ... [2024-01-29 14:39:51,418 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-01-29 14:39:51,430 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 14:39:51,431 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 120 error locations. [2024-01-29 14:39:51,431 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 14:39:51,512 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-29 14:39:51,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 279 transitions, 572 flow [2024-01-29 14:39:51,645 INFO L124 PetriNetUnfolderBase]: 8/277 cut-off events. [2024-01-29 14:39:51,646 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-29 14:39:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 277 events. 8/277 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 885 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 237. Up to 2 conditions per place. [2024-01-29 14:39:51,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 279 transitions, 572 flow [2024-01-29 14:39:51,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 275 transitions, 559 flow [2024-01-29 14:39:51,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 14:39:51,683 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;@178f3278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 14:39:51,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 224 error locations. [2024-01-29 14:39:51,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 14:39:51,685 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 14:39:51,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 14:39:51,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:51,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 14:39:51,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:51,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash 23660, now seen corresponding path program 1 times [2024-01-29 14:39:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893324533] [2024-01-29 14:39:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:52,001 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 14:39:52,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893324533] [2024-01-29 14:39:52,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893324533] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:52,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:52,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:39:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083982901] [2024-01-29 14:39:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:52,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:39:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:52,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:39:52,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:39:52,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 279 [2024-01-29 14:39:52,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 275 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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 14:39:52,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:52,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 279 [2024-01-29 14:39:52,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:53,267 INFO L124 PetriNetUnfolderBase]: 2426/9910 cut-off events. [2024-01-29 14:39:53,267 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-01-29 14:39:53,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14007 conditions, 9910 events. 2426/9910 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 94873 event pairs, 1061 based on Foata normal form. 368/7550 useless extension candidates. Maximal degree in co-relation 13563. Up to 3067 conditions per place. [2024-01-29 14:39:53,323 INFO L140 encePairwiseOnDemand]: 252/279 looper letters, 85 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2024-01-29 14:39:53,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 291 transitions, 773 flow [2024-01-29 14:39:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:39:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:39:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 14:39:53,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8697729988052568 [2024-01-29 14:39:53,336 INFO L175 Difference]: Start difference. First operand has 274 places, 275 transitions, 559 flow. Second operand 3 states and 728 transitions. [2024-01-29 14:39:53,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 291 transitions, 773 flow [2024-01-29 14:39:53,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 291 transitions, 765 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 14:39:53,345 INFO L231 Difference]: Finished difference. Result has 267 places, 267 transitions, 579 flow [2024-01-29 14:39:53,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=267, PETRI_TRANSITIONS=267} [2024-01-29 14:39:53,348 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -7 predicate places. [2024-01-29 14:39:53,349 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 267 transitions, 579 flow [2024-01-29 14:39:53,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 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 14:39:53,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:53,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 14:39:53,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 14:39:53,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:53,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash 734089, now seen corresponding path program 1 times [2024-01-29 14:39:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:53,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330573265] [2024-01-29 14:39:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:53,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:53,410 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 14:39:53,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:53,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330573265] [2024-01-29 14:39:53,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330573265] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:53,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:53,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 14:39:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846796284] [2024-01-29 14:39:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:53,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:39:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:39:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:39:53,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 279 [2024-01-29 14:39:53,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 267 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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 14:39:53,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:53,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 279 [2024-01-29 14:39:53,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:53,993 INFO L124 PetriNetUnfolderBase]: 1234/5470 cut-off events. [2024-01-29 14:39:53,994 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-01-29 14:39:54,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7664 conditions, 5470 events. 1234/5470 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 50142 event pairs, 739 based on Foata normal form. 260/4386 useless extension candidates. Maximal degree in co-relation 5589. Up to 1349 conditions per place. [2024-01-29 14:39:54,017 INFO L140 encePairwiseOnDemand]: 256/279 looper letters, 69 selfloop transitions, 4 changer transitions 0/258 dead transitions. [2024-01-29 14:39:54,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 258 transitions, 688 flow [2024-01-29 14:39:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:39:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:39:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-01-29 14:39:54,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8410991636798089 [2024-01-29 14:39:54,023 INFO L175 Difference]: Start difference. First operand has 267 places, 267 transitions, 579 flow. Second operand 3 states and 704 transitions. [2024-01-29 14:39:54,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 258 transitions, 688 flow [2024-01-29 14:39:54,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 258 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:39:54,029 INFO L231 Difference]: Finished difference. Result has 244 places, 242 transitions, 523 flow [2024-01-29 14:39:54,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=244, PETRI_TRANSITIONS=242} [2024-01-29 14:39:54,030 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -30 predicate places. [2024-01-29 14:39:54,030 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 242 transitions, 523 flow [2024-01-29 14:39:54,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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 14:39:54,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:54,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 14:39:54,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 14:39:54,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:54,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash 395076477, now seen corresponding path program 1 times [2024-01-29 14:39:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853773251] [2024-01-29 14:39:54,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:54,102 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 14:39:54,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:54,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853773251] [2024-01-29 14:39:54,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853773251] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:54,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:54,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:39:54,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944635288] [2024-01-29 14:39:54,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:54,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:39:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:54,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:39:54,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:39:54,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 279 [2024-01-29 14:39:54,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 242 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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 14:39:54,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:54,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 279 [2024-01-29 14:39:54,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:54,427 INFO L124 PetriNetUnfolderBase]: 765/3582 cut-off events. [2024-01-29 14:39:54,427 INFO L125 PetriNetUnfolderBase]: For 110/112 co-relation queries the response was YES. [2024-01-29 14:39:54,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5095 conditions, 3582 events. 765/3582 cut-off events. For 110/112 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 29262 event pairs, 610 based on Foata normal form. 0/2674 useless extension candidates. Maximal degree in co-relation 3120. Up to 1223 conditions per place. [2024-01-29 14:39:54,439 INFO L140 encePairwiseOnDemand]: 273/279 looper letters, 44 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-01-29 14:39:54,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 238 transitions, 607 flow [2024-01-29 14:39:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:39:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:39:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-01-29 14:39:54,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8661887694145759 [2024-01-29 14:39:54,441 INFO L175 Difference]: Start difference. First operand has 244 places, 242 transitions, 523 flow. Second operand 3 states and 725 transitions. [2024-01-29 14:39:54,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 238 transitions, 607 flow [2024-01-29 14:39:54,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 238 transitions, 599 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:39:54,447 INFO L231 Difference]: Finished difference. Result has 240 places, 238 transitions, 511 flow [2024-01-29 14:39:54,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=511, PETRI_PLACES=240, PETRI_TRANSITIONS=238} [2024-01-29 14:39:54,448 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -34 predicate places. [2024-01-29 14:39:54,448 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 238 transitions, 511 flow [2024-01-29 14:39:54,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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 14:39:54,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:54,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:39:54,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 14:39:54,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:54,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1683980441, now seen corresponding path program 1 times [2024-01-29 14:39:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293512912] [2024-01-29 14:39:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:54,513 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 14:39:54,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:54,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293512912] [2024-01-29 14:39:54,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293512912] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:54,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:54,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:39:54,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038559328] [2024-01-29 14:39:54,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:54,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:39:54,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:54,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:39:54,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:39:54,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 279 [2024-01-29 14:39:54,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 238 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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 14:39:54,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:54,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 279 [2024-01-29 14:39:54,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:54,843 INFO L124 PetriNetUnfolderBase]: 786/3331 cut-off events. [2024-01-29 14:39:54,843 INFO L125 PetriNetUnfolderBase]: For 142/154 co-relation queries the response was YES. [2024-01-29 14:39:54,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4779 conditions, 3331 events. 786/3331 cut-off events. For 142/154 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 25888 event pairs, 365 based on Foata normal form. 174/2693 useless extension candidates. Maximal degree in co-relation 4752. Up to 718 conditions per place. [2024-01-29 14:39:54,858 INFO L140 encePairwiseOnDemand]: 261/279 looper letters, 61 selfloop transitions, 3 changer transitions 0/241 dead transitions. [2024-01-29 14:39:54,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 241 transitions, 642 flow [2024-01-29 14:39:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:39:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:39:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2024-01-29 14:39:54,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8327359617682198 [2024-01-29 14:39:54,860 INFO L175 Difference]: Start difference. First operand has 240 places, 238 transitions, 511 flow. Second operand 3 states and 697 transitions. [2024-01-29 14:39:54,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 241 transitions, 642 flow [2024-01-29 14:39:54,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 241 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:39:54,863 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 488 flow [2024-01-29 14:39:54,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2024-01-29 14:39:54,864 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -46 predicate places. [2024-01-29 14:39:54,864 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 488 flow [2024-01-29 14:39:54,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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 14:39:54,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:54,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:39:54,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 14:39:54,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:54,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1629728355, now seen corresponding path program 1 times [2024-01-29 14:39:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002604386] [2024-01-29 14:39:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:54,943 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 14:39:54,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002604386] [2024-01-29 14:39:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002604386] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:54,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:54,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:39:54,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912464039] [2024-01-29 14:39:54,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:54,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:39:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:54,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:39:54,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:39:54,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 279 [2024-01-29 14:39:54,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 488 flow. Second operand has 4 states, 4 states have (on average 225.75) internal successors, (903), 4 states have internal predecessors, (903), 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 14:39:54,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:54,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 279 [2024-01-29 14:39:54,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:55,264 INFO L124 PetriNetUnfolderBase]: 729/4150 cut-off events. [2024-01-29 14:39:55,264 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2024-01-29 14:39:55,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 4150 events. 729/4150 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34127 event pairs, 134 based on Foata normal form. 268/3484 useless extension candidates. Maximal degree in co-relation 5194. Up to 1189 conditions per place. [2024-01-29 14:39:55,281 INFO L140 encePairwiseOnDemand]: 268/279 looper letters, 50 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-01-29 14:39:55,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 225 transitions, 594 flow [2024-01-29 14:39:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:39:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:39:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 953 transitions. [2024-01-29 14:39:55,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8539426523297491 [2024-01-29 14:39:55,284 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 488 flow. Second operand 4 states and 953 transitions. [2024-01-29 14:39:55,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 225 transitions, 594 flow [2024-01-29 14:39:55,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 225 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:39:55,287 INFO L231 Difference]: Finished difference. Result has 220 places, 216 transitions, 468 flow [2024-01-29 14:39:55,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=468, PETRI_PLACES=220, PETRI_TRANSITIONS=216} [2024-01-29 14:39:55,288 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -54 predicate places. [2024-01-29 14:39:55,288 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 216 transitions, 468 flow [2024-01-29 14:39:55,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 225.75) internal successors, (903), 4 states have internal predecessors, (903), 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 14:39:55,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:55,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:39:55,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 14:39:55,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:55,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1494086394, now seen corresponding path program 1 times [2024-01-29 14:39:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:55,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912729514] [2024-01-29 14:39:55,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:55,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:55,313 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 14:39:55,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912729514] [2024-01-29 14:39:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912729514] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:55,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:39:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027231485] [2024-01-29 14:39:55,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:55,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:39:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:39:55,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:39:55,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 279 [2024-01-29 14:39:55,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 216 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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 14:39:55,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:55,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 279 [2024-01-29 14:39:55,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:55,720 INFO L124 PetriNetUnfolderBase]: 1255/5561 cut-off events. [2024-01-29 14:39:55,720 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-01-29 14:39:55,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7991 conditions, 5561 events. 1255/5561 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 47265 event pairs, 648 based on Foata normal form. 106/4543 useless extension candidates. Maximal degree in co-relation 6280. Up to 1485 conditions per place. [2024-01-29 14:39:55,741 INFO L140 encePairwiseOnDemand]: 270/279 looper letters, 77 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-01-29 14:39:55,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 245 transitions, 692 flow [2024-01-29 14:39:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:39:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:39:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2024-01-29 14:39:55,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9091995221027479 [2024-01-29 14:39:55,743 INFO L175 Difference]: Start difference. First operand has 220 places, 216 transitions, 468 flow. Second operand 3 states and 761 transitions. [2024-01-29 14:39:55,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 245 transitions, 692 flow [2024-01-29 14:39:55,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 245 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:39:55,746 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 489 flow [2024-01-29 14:39:55,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=489, PETRI_PLACES=221, PETRI_TRANSITIONS=217} [2024-01-29 14:39:55,747 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -53 predicate places. [2024-01-29 14:39:55,747 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 489 flow [2024-01-29 14:39:55,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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 14:39:55,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:55,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:39:55,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 14:39:55,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:55,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1498684240, now seen corresponding path program 1 times [2024-01-29 14:39:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995794337] [2024-01-29 14:39:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:55,812 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 14:39:55,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:55,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995794337] [2024-01-29 14:39:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995794337] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:55,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:55,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:39:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082779369] [2024-01-29 14:39:55,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:55,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:39:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:39:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:39:55,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 279 [2024-01-29 14:39:55,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 217 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 225.25) internal successors, (901), 4 states have internal predecessors, (901), 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 14:39:55,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:55,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 279 [2024-01-29 14:39:55,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:56,224 INFO L124 PetriNetUnfolderBase]: 982/4097 cut-off events. [2024-01-29 14:39:56,224 INFO L125 PetriNetUnfolderBase]: For 272/308 co-relation queries the response was YES. [2024-01-29 14:39:56,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6160 conditions, 4097 events. 982/4097 cut-off events. For 272/308 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 31320 event pairs, 103 based on Foata normal form. 394/3790 useless extension candidates. Maximal degree in co-relation 5790. Up to 1417 conditions per place. [2024-01-29 14:39:56,240 INFO L140 encePairwiseOnDemand]: 267/279 looper letters, 75 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-01-29 14:39:56,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 240 transitions, 718 flow [2024-01-29 14:39:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:39:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:39:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 972 transitions. [2024-01-29 14:39:56,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2024-01-29 14:39:56,243 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 489 flow. Second operand 4 states and 972 transitions. [2024-01-29 14:39:56,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 240 transitions, 718 flow [2024-01-29 14:39:56,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 240 transitions, 712 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:39:56,247 INFO L231 Difference]: Finished difference. Result has 213 places, 207 transitions, 471 flow [2024-01-29 14:39:56,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=471, PETRI_PLACES=213, PETRI_TRANSITIONS=207} [2024-01-29 14:39:56,248 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -61 predicate places. [2024-01-29 14:39:56,248 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 207 transitions, 471 flow [2024-01-29 14:39:56,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 225.25) internal successors, (901), 4 states have internal predecessors, (901), 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 14:39:56,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:56,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:39:56,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 14:39:56,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err37ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:56,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:56,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1421478476, now seen corresponding path program 1 times [2024-01-29 14:39:56,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:56,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669487293] [2024-01-29 14:39:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:56,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:56,280 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 14:39:56,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:56,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669487293] [2024-01-29 14:39:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669487293] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:56,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:39:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980546688] [2024-01-29 14:39:56,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:56,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:39:56,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:56,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:39:56,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:39:56,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 279 [2024-01-29 14:39:56,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 207 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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 14:39:56,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:56,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 279 [2024-01-29 14:39:56,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:56,934 INFO L124 PetriNetUnfolderBase]: 1988/7767 cut-off events. [2024-01-29 14:39:56,935 INFO L125 PetriNetUnfolderBase]: For 440/486 co-relation queries the response was YES. [2024-01-29 14:39:56,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12059 conditions, 7767 events. 1988/7767 cut-off events. For 440/486 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 69182 event pairs, 1288 based on Foata normal form. 272/6878 useless extension candidates. Maximal degree in co-relation 11779. Up to 2492 conditions per place. [2024-01-29 14:39:56,968 INFO L140 encePairwiseOnDemand]: 269/279 looper letters, 80 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-01-29 14:39:56,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 237 transitions, 711 flow [2024-01-29 14:39:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:39:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:39:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2024-01-29 14:39:56,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9080047789725209 [2024-01-29 14:39:56,971 INFO L175 Difference]: Start difference. First operand has 213 places, 207 transitions, 471 flow. Second operand 3 states and 760 transitions. [2024-01-29 14:39:56,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 237 transitions, 711 flow [2024-01-29 14:39:56,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 237 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:39:56,975 INFO L231 Difference]: Finished difference. Result has 214 places, 208 transitions, 494 flow [2024-01-29 14:39:56,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=214, PETRI_TRANSITIONS=208} [2024-01-29 14:39:56,976 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -60 predicate places. [2024-01-29 14:39:56,976 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 208 transitions, 494 flow [2024-01-29 14:39:56,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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 14:39:56,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:56,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:39:56,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 14:39:56,977 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err11ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:56,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1967764844, now seen corresponding path program 1 times [2024-01-29 14:39:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:56,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518526378] [2024-01-29 14:39:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:57,031 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 14:39:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518526378] [2024-01-29 14:39:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518526378] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:39:57,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:39:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:39:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120097490] [2024-01-29 14:39:57,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:39:57,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:39:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:57,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:39:57,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:39:57,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 279 [2024-01-29 14:39:57,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 208 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 204.25) internal successors, (817), 4 states have internal predecessors, (817), 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 14:39:57,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:57,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 279 [2024-01-29 14:39:57,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:57,737 INFO L124 PetriNetUnfolderBase]: 2475/8255 cut-off events. [2024-01-29 14:39:57,738 INFO L125 PetriNetUnfolderBase]: For 970/1001 co-relation queries the response was YES. [2024-01-29 14:39:57,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14213 conditions, 8255 events. 2475/8255 cut-off events. For 970/1001 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 73065 event pairs, 1443 based on Foata normal form. 420/7936 useless extension candidates. Maximal degree in co-relation 11913. Up to 3196 conditions per place. [2024-01-29 14:39:57,775 INFO L140 encePairwiseOnDemand]: 251/279 looper letters, 111 selfloop transitions, 4 changer transitions 0/247 dead transitions. [2024-01-29 14:39:57,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 247 transitions, 834 flow [2024-01-29 14:39:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:39:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:39:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 940 transitions. [2024-01-29 14:39:57,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8422939068100358 [2024-01-29 14:39:57,778 INFO L175 Difference]: Start difference. First operand has 214 places, 208 transitions, 494 flow. Second operand 4 states and 940 transitions. [2024-01-29 14:39:57,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 247 transitions, 834 flow [2024-01-29 14:39:57,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 247 transitions, 828 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 14:39:57,783 INFO L231 Difference]: Finished difference. Result has 218 places, 210 transitions, 562 flow [2024-01-29 14:39:57,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=562, PETRI_PLACES=218, PETRI_TRANSITIONS=210} [2024-01-29 14:39:57,783 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -56 predicate places. [2024-01-29 14:39:57,784 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 210 transitions, 562 flow [2024-01-29 14:39:57,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 204.25) internal successors, (817), 4 states have internal predecessors, (817), 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 14:39:57,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:57,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:39:57,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 14:39:57,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err37ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:57,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash -612377997, now seen corresponding path program 1 times [2024-01-29 14:39:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229233567] [2024-01-29 14:39:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:39:57,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:57,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229233567] [2024-01-29 14:39:57,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229233567] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 14:39:57,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124825925] [2024-01-29 14:39:57,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:57,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:39:57,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:39:57,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:39:57,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-29 14:39:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:57,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-29 14:39:57,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:39:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:39:57,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:39:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:39:58,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124825925] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:39:58,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 14:39:58,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-01-29 14:39:58,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054285618] [2024-01-29 14:39:58,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 14:39:58,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-29 14:39:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:39:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-29 14:39:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-01-29 14:39:58,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 279 [2024-01-29 14:39:58,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 210 transitions, 562 flow. Second operand has 7 states, 7 states have (on average 221.28571428571428) internal successors, (1549), 7 states have internal predecessors, (1549), 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 14:39:58,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:39:58,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 279 [2024-01-29 14:39:58,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:39:59,520 INFO L124 PetriNetUnfolderBase]: 5733/14848 cut-off events. [2024-01-29 14:39:59,521 INFO L125 PetriNetUnfolderBase]: For 3853/4061 co-relation queries the response was YES. [2024-01-29 14:39:59,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28181 conditions, 14848 events. 5733/14848 cut-off events. For 3853/4061 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 131626 event pairs, 503 based on Foata normal form. 228/14252 useless extension candidates. Maximal degree in co-relation 27245. Up to 1900 conditions per place. [2024-01-29 14:39:59,589 INFO L140 encePairwiseOnDemand]: 268/279 looper letters, 210 selfloop transitions, 27 changer transitions 0/384 dead transitions. [2024-01-29 14:39:59,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 384 transitions, 1580 flow [2024-01-29 14:39:59,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-29 14:39:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-29 14:39:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1734 transitions. [2024-01-29 14:39:59,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8878648233486943 [2024-01-29 14:39:59,592 INFO L175 Difference]: Start difference. First operand has 218 places, 210 transitions, 562 flow. Second operand 7 states and 1734 transitions. [2024-01-29 14:39:59,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 384 transitions, 1580 flow [2024-01-29 14:39:59,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 384 transitions, 1556 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:39:59,600 INFO L231 Difference]: Finished difference. Result has 226 places, 227 transitions, 717 flow [2024-01-29 14:39:59,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=717, PETRI_PLACES=226, PETRI_TRANSITIONS=227} [2024-01-29 14:39:59,601 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -48 predicate places. [2024-01-29 14:39:59,601 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 227 transitions, 717 flow [2024-01-29 14:39:59,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 221.28571428571428) internal successors, (1549), 7 states have internal predecessors, (1549), 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 14:39:59,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:39:59,602 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:39:59,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-29 14:39:59,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-29 14:39:59,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:39:59,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:39:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1803848740, now seen corresponding path program 1 times [2024-01-29 14:39:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:39:59,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069652629] [2024-01-29 14:39:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:39:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:39:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:39:59,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:39:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069652629] [2024-01-29 14:39:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069652629] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 14:39:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072623169] [2024-01-29 14:39:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:39:59,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:39:59,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:39:59,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:39:59,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-29 14:39:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:00,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-29 14:40:00,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:40:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:40:00,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:40:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:40:00,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072623169] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:40:00,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 14:40:00,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2024-01-29 14:40:00,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631537794] [2024-01-29 14:40:00,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 14:40:00,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 14:40:00,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:00,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 14:40:00,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-29 14:40:00,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 279 [2024-01-29 14:40:00,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 227 transitions, 717 flow. Second operand has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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 14:40:00,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:00,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 279 [2024-01-29 14:40:00,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:01,663 INFO L124 PetriNetUnfolderBase]: 4704/13603 cut-off events. [2024-01-29 14:40:01,664 INFO L125 PetriNetUnfolderBase]: For 6819/7023 co-relation queries the response was YES. [2024-01-29 14:40:01,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25516 conditions, 13603 events. 4704/13603 cut-off events. For 6819/7023 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 127077 event pairs, 157 based on Foata normal form. 918/13741 useless extension candidates. Maximal degree in co-relation 24698. Up to 3546 conditions per place. [2024-01-29 14:40:01,734 INFO L140 encePairwiseOnDemand]: 269/279 looper letters, 169 selfloop transitions, 7 changer transitions 0/323 dead transitions. [2024-01-29 14:40:01,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 323 transitions, 1272 flow [2024-01-29 14:40:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 14:40:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 14:40:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2024-01-29 14:40:01,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8787335722819594 [2024-01-29 14:40:01,737 INFO L175 Difference]: Start difference. First operand has 226 places, 227 transitions, 717 flow. Second operand 6 states and 1471 transitions. [2024-01-29 14:40:01,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 323 transitions, 1272 flow [2024-01-29 14:40:01,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 323 transitions, 1264 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-29 14:40:01,752 INFO L231 Difference]: Finished difference. Result has 223 places, 207 transitions, 586 flow [2024-01-29 14:40:01,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=586, PETRI_PLACES=223, PETRI_TRANSITIONS=207} [2024-01-29 14:40:01,753 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -51 predicate places. [2024-01-29 14:40:01,753 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 207 transitions, 586 flow [2024-01-29 14:40:01,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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 14:40:01,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:01,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:01,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-29 14:40:01,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-29 14:40:01,965 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err59ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:01,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1946727546, now seen corresponding path program 1 times [2024-01-29 14:40:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:01,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355303452] [2024-01-29 14:40:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:02,058 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 14:40:02,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355303452] [2024-01-29 14:40:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355303452] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:40:02,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:40:02,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 14:40:02,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419281417] [2024-01-29 14:40:02,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:40:02,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:40:02,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:02,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:40:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:40:02,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 279 [2024-01-29 14:40:02,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 207 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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 14:40:02,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:02,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 279 [2024-01-29 14:40:02,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:03,068 INFO L124 PetriNetUnfolderBase]: 2939/10581 cut-off events. [2024-01-29 14:40:03,068 INFO L125 PetriNetUnfolderBase]: For 4199/4329 co-relation queries the response was YES. [2024-01-29 14:40:03,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19276 conditions, 10581 events. 2939/10581 cut-off events. For 4199/4329 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 98037 event pairs, 1689 based on Foata normal form. 854/10923 useless extension candidates. Maximal degree in co-relation 18562. Up to 3003 conditions per place. [2024-01-29 14:40:03,120 INFO L140 encePairwiseOnDemand]: 265/279 looper letters, 74 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2024-01-29 14:40:03,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 217 transitions, 803 flow [2024-01-29 14:40:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:40:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:40:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2024-01-29 14:40:03,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8315412186379928 [2024-01-29 14:40:03,123 INFO L175 Difference]: Start difference. First operand has 223 places, 207 transitions, 586 flow. Second operand 3 states and 696 transitions. [2024-01-29 14:40:03,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 217 transitions, 803 flow [2024-01-29 14:40:03,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 217 transitions, 793 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 14:40:03,135 INFO L231 Difference]: Finished difference. Result has 213 places, 197 transitions, 565 flow [2024-01-29 14:40:03,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=213, PETRI_TRANSITIONS=197} [2024-01-29 14:40:03,136 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -61 predicate places. [2024-01-29 14:40:03,136 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 197 transitions, 565 flow [2024-01-29 14:40:03,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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 14:40:03,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:03,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:03,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 14:40:03,137 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:03,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1720317193, now seen corresponding path program 1 times [2024-01-29 14:40:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134071782] [2024-01-29 14:40:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:03,153 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-29 14:40:03,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178861325] [2024-01-29 14:40:03,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:03,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:03,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:40:03,154 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:40:03,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-29 14:40:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:03,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-29 14:40:03,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:40:03,455 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 14:40:03,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-29 14:40:03,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:03,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134071782] [2024-01-29 14:40:03,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-29 14:40:03,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178861325] [2024-01-29 14:40:03,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178861325] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:40:03,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:40:03,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:40:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979003974] [2024-01-29 14:40:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:40:03,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 14:40:03,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:03,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 14:40:03,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 14:40:04,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 279 [2024-01-29 14:40:04,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 197 transitions, 565 flow. Second operand has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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 14:40:04,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:04,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 279 [2024-01-29 14:40:04,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:06,128 INFO L124 PetriNetUnfolderBase]: 4861/20720 cut-off events. [2024-01-29 14:40:06,129 INFO L125 PetriNetUnfolderBase]: For 7050/7222 co-relation queries the response was YES. [2024-01-29 14:40:06,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36823 conditions, 20720 events. 4861/20720 cut-off events. For 7050/7222 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 225759 event pairs, 2657 based on Foata normal form. 0/20042 useless extension candidates. Maximal degree in co-relation 36097. Up to 3990 conditions per place. [2024-01-29 14:40:06,257 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 99 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-01-29 14:40:06,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 245 transitions, 967 flow [2024-01-29 14:40:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 14:40:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 14:40:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1004 transitions. [2024-01-29 14:40:06,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.899641577060932 [2024-01-29 14:40:06,260 INFO L175 Difference]: Start difference. First operand has 213 places, 197 transitions, 565 flow. Second operand 4 states and 1004 transitions. [2024-01-29 14:40:06,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 245 transitions, 967 flow [2024-01-29 14:40:06,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 245 transitions, 959 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 14:40:06,285 INFO L231 Difference]: Finished difference. Result has 214 places, 197 transitions, 572 flow [2024-01-29 14:40:06,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=572, PETRI_PLACES=214, PETRI_TRANSITIONS=197} [2024-01-29 14:40:06,286 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -60 predicate places. [2024-01-29 14:40:06,286 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 197 transitions, 572 flow [2024-01-29 14:40:06,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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 14:40:06,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:06,287 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:06,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-29 14:40:06,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:06,498 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:06,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:06,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1772961124, now seen corresponding path program 1 times [2024-01-29 14:40:06,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:06,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542252827] [2024-01-29 14:40:06,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:06,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:40:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542252827] [2024-01-29 14:40:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542252827] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-29 14:40:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832793195] [2024-01-29 14:40:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:06,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:40:06,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:40:06,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-29 14:40:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:06,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-29 14:40:06,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:40:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:40:06,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:40:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:40:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832793195] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:40:06,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-29 14:40:06,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2024-01-29 14:40:06,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991653675] [2024-01-29 14:40:06,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-29 14:40:06,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 14:40:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:06,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 14:40:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-29 14:40:06,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 279 [2024-01-29 14:40:06,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 197 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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 14:40:06,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:06,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 279 [2024-01-29 14:40:06,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:11,205 INFO L124 PetriNetUnfolderBase]: 11283/38076 cut-off events. [2024-01-29 14:40:11,206 INFO L125 PetriNetUnfolderBase]: For 14585/14585 co-relation queries the response was YES. [2024-01-29 14:40:11,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70432 conditions, 38076 events. 11283/38076 cut-off events. For 14585/14585 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 434504 event pairs, 647 based on Foata normal form. 2648/39950 useless extension candidates. Maximal degree in co-relation 69506. Up to 6383 conditions per place. [2024-01-29 14:40:11,513 INFO L140 encePairwiseOnDemand]: 269/279 looper letters, 157 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2024-01-29 14:40:11,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 297 transitions, 1270 flow [2024-01-29 14:40:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 14:40:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 14:40:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1479 transitions. [2024-01-29 14:40:11,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8835125448028673 [2024-01-29 14:40:11,533 INFO L175 Difference]: Start difference. First operand has 214 places, 197 transitions, 572 flow. Second operand 6 states and 1479 transitions. [2024-01-29 14:40:11,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 297 transitions, 1270 flow [2024-01-29 14:40:11,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 297 transitions, 1270 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 14:40:11,594 INFO L231 Difference]: Finished difference. Result has 216 places, 193 transitions, 577 flow [2024-01-29 14:40:11,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=216, PETRI_TRANSITIONS=193} [2024-01-29 14:40:11,595 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -58 predicate places. [2024-01-29 14:40:11,595 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 193 transitions, 577 flow [2024-01-29 14:40:11,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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 14:40:11,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:11,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:11,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-29 14:40:11,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:11,806 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err32ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:11,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1488324889, now seen corresponding path program 1 times [2024-01-29 14:40:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251367202] [2024-01-29 14:40:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:11,948 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 14:40:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251367202] [2024-01-29 14:40:11,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251367202] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:40:11,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:40:11,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 14:40:11,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961303927] [2024-01-29 14:40:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:40:11,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 14:40:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:11,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 14:40:11,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 14:40:11,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 279 [2024-01-29 14:40:11,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 193 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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 14:40:11,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:11,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 279 [2024-01-29 14:40:11,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:14,175 INFO L124 PetriNetUnfolderBase]: 3963/21542 cut-off events. [2024-01-29 14:40:14,175 INFO L125 PetriNetUnfolderBase]: For 12648/12648 co-relation queries the response was YES. [2024-01-29 14:40:14,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38462 conditions, 21542 events. 3963/21542 cut-off events. For 12648/12648 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 232610 event pairs, 1071 based on Foata normal form. 610/21624 useless extension candidates. Maximal degree in co-relation 37624. Up to 5188 conditions per place. [2024-01-29 14:40:14,255 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 65 selfloop transitions, 4 changer transitions 0/209 dead transitions. [2024-01-29 14:40:14,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 812 flow [2024-01-29 14:40:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 14:40:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 14:40:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-01-29 14:40:14,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9008363201911589 [2024-01-29 14:40:14,257 INFO L175 Difference]: Start difference. First operand has 216 places, 193 transitions, 577 flow. Second operand 3 states and 754 transitions. [2024-01-29 14:40:14,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 209 transitions, 812 flow [2024-01-29 14:40:14,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 209 transitions, 794 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-01-29 14:40:14,298 INFO L231 Difference]: Finished difference. Result has 214 places, 191 transitions, 566 flow [2024-01-29 14:40:14,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=214, PETRI_TRANSITIONS=191} [2024-01-29 14:40:14,299 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -60 predicate places. [2024-01-29 14:40:14,299 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 191 transitions, 566 flow [2024-01-29 14:40:14,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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 14:40:14,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:14,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:14,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 14:40:14,300 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:14,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash -384663649, now seen corresponding path program 1 times [2024-01-29 14:40:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:14,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856024092] [2024-01-29 14:40:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:14,618 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 14:40:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:14,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856024092] [2024-01-29 14:40:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856024092] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:40:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:40:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-29 14:40:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079156444] [2024-01-29 14:40:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:40:14,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:40:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:40:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:40:14,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 279 [2024-01-29 14:40:14,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 191 transitions, 566 flow. Second operand has 5 states, 5 states have (on average 227.8) internal successors, (1139), 5 states have internal predecessors, (1139), 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 14:40:14,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:14,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 279 [2024-01-29 14:40:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:15,677 INFO L124 PetriNetUnfolderBase]: 2313/10074 cut-off events. [2024-01-29 14:40:15,678 INFO L125 PetriNetUnfolderBase]: For 6510/6510 co-relation queries the response was YES. [2024-01-29 14:40:15,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19569 conditions, 10074 events. 2313/10074 cut-off events. For 6510/6510 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 86541 event pairs, 975 based on Foata normal form. 10/9486 useless extension candidates. Maximal degree in co-relation 18882. Up to 3714 conditions per place. [2024-01-29 14:40:15,717 INFO L140 encePairwiseOnDemand]: 274/279 looper letters, 66 selfloop transitions, 4 changer transitions 0/205 dead transitions. [2024-01-29 14:40:15,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 205 transitions, 778 flow [2024-01-29 14:40:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-29 14:40:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-29 14:40:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2024-01-29 14:40:15,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8327359617682198 [2024-01-29 14:40:15,720 INFO L175 Difference]: Start difference. First operand has 214 places, 191 transitions, 566 flow. Second operand 6 states and 1394 transitions. [2024-01-29 14:40:15,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 205 transitions, 778 flow [2024-01-29 14:40:15,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 205 transitions, 763 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-29 14:40:15,731 INFO L231 Difference]: Finished difference. Result has 219 places, 191 transitions, 566 flow [2024-01-29 14:40:15,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=566, PETRI_PLACES=219, PETRI_TRANSITIONS=191} [2024-01-29 14:40:15,731 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -55 predicate places. [2024-01-29 14:40:15,731 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 191 transitions, 566 flow [2024-01-29 14:40:15,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.8) internal successors, (1139), 5 states have internal predecessors, (1139), 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 14:40:15,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:15,732 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:15,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 14:40:15,732 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err37ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:15,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1873221260, now seen corresponding path program 2 times [2024-01-29 14:40:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751232777] [2024-01-29 14:40:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-01-29 14:40:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751232777] [2024-01-29 14:40:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751232777] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:40:15,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:40:15,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 14:40:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714171547] [2024-01-29 14:40:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:40:15,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 14:40:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 14:40:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 14:40:15,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 279 [2024-01-29 14:40:15,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 191 transitions, 566 flow. Second operand has 5 states, 5 states have (on average 227.6) internal successors, (1138), 5 states have internal predecessors, (1138), 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 14:40:15,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:15,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 279 [2024-01-29 14:40:15,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:17,461 INFO L124 PetriNetUnfolderBase]: 3807/13310 cut-off events. [2024-01-29 14:40:17,461 INFO L125 PetriNetUnfolderBase]: For 8973/8973 co-relation queries the response was YES. [2024-01-29 14:40:17,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27263 conditions, 13310 events. 3807/13310 cut-off events. For 8973/8973 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 115993 event pairs, 837 based on Foata normal form. 0/12650 useless extension candidates. Maximal degree in co-relation 26379. Up to 4942 conditions per place. [2024-01-29 14:40:17,508 INFO L140 encePairwiseOnDemand]: 274/279 looper letters, 113 selfloop transitions, 9 changer transitions 3/253 dead transitions. [2024-01-29 14:40:17,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 253 transitions, 1088 flow [2024-01-29 14:40:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 14:40:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 14:40:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1214 transitions. [2024-01-29 14:40:17,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8702508960573476 [2024-01-29 14:40:17,511 INFO L175 Difference]: Start difference. First operand has 219 places, 191 transitions, 566 flow. Second operand 5 states and 1214 transitions. [2024-01-29 14:40:17,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 253 transitions, 1088 flow [2024-01-29 14:40:17,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 253 transitions, 1078 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:40:17,528 INFO L231 Difference]: Finished difference. Result has 219 places, 191 transitions, 591 flow [2024-01-29 14:40:17,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=219, PETRI_TRANSITIONS=191} [2024-01-29 14:40:17,528 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -55 predicate places. [2024-01-29 14:40:17,528 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 191 transitions, 591 flow [2024-01-29 14:40:17,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.6) internal successors, (1138), 5 states have internal predecessors, (1138), 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 14:40:17,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:17,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:17,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 14:40:17,529 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:17,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1187618679, now seen corresponding path program 1 times [2024-01-29 14:40:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512964731] [2024-01-29 14:40:17,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:17,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:17,544 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-29 14:40:17,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139885969] [2024-01-29 14:40:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:17,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:17,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:40:17,545 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:40:17,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-29 14:40:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:17,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-29 14:40:17,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:40:18,160 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 14:40:18,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-29 14:40:18,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:18,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512964731] [2024-01-29 14:40:18,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-29 14:40:18,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139885969] [2024-01-29 14:40:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139885969] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:40:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:40:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-29 14:40:18,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714271120] [2024-01-29 14:40:18,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:40:18,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 14:40:18,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 14:40:18,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-29 14:40:18,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 279 [2024-01-29 14:40:18,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 191 transitions, 591 flow. Second operand has 6 states, 6 states have (on average 226.16666666666666) internal successors, (1357), 6 states have internal predecessors, (1357), 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 14:40:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:18,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 279 [2024-01-29 14:40:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:19,463 INFO L124 PetriNetUnfolderBase]: 2727/11726 cut-off events. [2024-01-29 14:40:19,463 INFO L125 PetriNetUnfolderBase]: For 12765/12765 co-relation queries the response was YES. [2024-01-29 14:40:19,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23728 conditions, 11726 events. 2727/11726 cut-off events. For 12765/12765 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 102477 event pairs, 723 based on Foata normal form. 0/11172 useless extension candidates. Maximal degree in co-relation 23017. Up to 3124 conditions per place. [2024-01-29 14:40:19,502 INFO L140 encePairwiseOnDemand]: 273/279 looper letters, 89 selfloop transitions, 5 changer transitions 0/228 dead transitions. [2024-01-29 14:40:19,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 228 transitions, 984 flow [2024-01-29 14:40:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-29 14:40:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-29 14:40:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1629 transitions. [2024-01-29 14:40:19,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8341013824884793 [2024-01-29 14:40:19,505 INFO L175 Difference]: Start difference. First operand has 219 places, 191 transitions, 591 flow. Second operand 7 states and 1629 transitions. [2024-01-29 14:40:19,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 228 transitions, 984 flow [2024-01-29 14:40:19,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 228 transitions, 954 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-29 14:40:19,530 INFO L231 Difference]: Finished difference. Result has 223 places, 192 transitions, 596 flow [2024-01-29 14:40:19,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=596, PETRI_PLACES=223, PETRI_TRANSITIONS=192} [2024-01-29 14:40:19,531 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -51 predicate places. [2024-01-29 14:40:19,531 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 192 transitions, 596 flow [2024-01-29 14:40:19,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.16666666666666) internal successors, (1357), 6 states have internal predecessors, (1357), 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 14:40:19,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:19,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:19,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-29 14:40:19,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-01-29 14:40:19,743 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:19,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:19,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1230724013, now seen corresponding path program 1 times [2024-01-29 14:40:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:19,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63835289] [2024-01-29 14:40:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:19,758 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-29 14:40:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607773183] [2024-01-29 14:40:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:19,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:19,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:40:19,760 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:40:19,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-29 14:40:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:19,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 18 conjunts are in the unsatisfiable core [2024-01-29 14:40:19,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:40:19,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-01-29 14:40:20,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2024-01-29 14:40:20,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2024-01-29 14:40:20,284 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 14:40:20,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-29 14:40:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:20,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63835289] [2024-01-29 14:40:20,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-29 14:40:20,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607773183] [2024-01-29 14:40:20,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607773183] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 14:40:20,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 14:40:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-29 14:40:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101745365] [2024-01-29 14:40:20,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 14:40:20,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-29 14:40:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-29 14:40:20,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-01-29 14:40:21,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 279 [2024-01-29 14:40:21,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 192 transitions, 596 flow. Second operand has 10 states, 10 states have (on average 165.6) internal successors, (1656), 10 states have internal predecessors, (1656), 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 14:40:21,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:21,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 279 [2024-01-29 14:40:21,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:24,477 INFO L124 PetriNetUnfolderBase]: 7303/22061 cut-off events. [2024-01-29 14:40:24,478 INFO L125 PetriNetUnfolderBase]: For 27329/27353 co-relation queries the response was YES. [2024-01-29 14:40:24,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49927 conditions, 22061 events. 7303/22061 cut-off events. For 27329/27353 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 182535 event pairs, 2345 based on Foata normal form. 0/21522 useless extension candidates. Maximal degree in co-relation 49288. Up to 5177 conditions per place. [2024-01-29 14:40:24,571 INFO L140 encePairwiseOnDemand]: 261/279 looper letters, 354 selfloop transitions, 51 changer transitions 11/510 dead transitions. [2024-01-29 14:40:24,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 510 transitions, 2638 flow [2024-01-29 14:40:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-29 14:40:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-01-29 14:40:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3776 transitions. [2024-01-29 14:40:24,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.644478579962451 [2024-01-29 14:40:24,577 INFO L175 Difference]: Start difference. First operand has 223 places, 192 transitions, 596 flow. Second operand 21 states and 3776 transitions. [2024-01-29 14:40:24,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 510 transitions, 2638 flow [2024-01-29 14:40:24,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 510 transitions, 2630 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-29 14:40:24,609 INFO L231 Difference]: Finished difference. Result has 247 places, 236 transitions, 982 flow [2024-01-29 14:40:24,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=982, PETRI_PLACES=247, PETRI_TRANSITIONS=236} [2024-01-29 14:40:24,609 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -27 predicate places. [2024-01-29 14:40:24,610 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 236 transitions, 982 flow [2024-01-29 14:40:24,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 165.6) internal successors, (1656), 10 states have internal predecessors, (1656), 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 14:40:24,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:24,611 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:24,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-29 14:40:24,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:24,823 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err61ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:24,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 723546255, now seen corresponding path program 1 times [2024-01-29 14:40:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776944565] [2024-01-29 14:40:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:24,838 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-29 14:40:24,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101224225] [2024-01-29 14:40:24,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:24,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:24,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:40:24,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:40:24,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-29 14:40:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 14:40:24,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-29 14:40:24,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-29 14:40:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:40:25,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-29 14:40:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 14:40:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 14:40:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776944565] [2024-01-29 14:40:25,160 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-01-29 14:40:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101224225] [2024-01-29 14:40:25,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101224225] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-29 14:40:25,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-29 14:40:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-01-29 14:40:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975660167] [2024-01-29 14:40:25,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-29 14:40:25,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-29 14:40:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 14:40:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-29 14:40:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-01-29 14:40:25,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 279 [2024-01-29 14:40:25,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 236 transitions, 982 flow. Second operand has 9 states, 9 states have (on average 227.88888888888889) internal successors, (2051), 9 states have internal predecessors, (2051), 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 14:40:25,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 14:40:25,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 279 [2024-01-29 14:40:25,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 14:40:32,730 INFO L124 PetriNetUnfolderBase]: 13327/49180 cut-off events. [2024-01-29 14:40:32,731 INFO L125 PetriNetUnfolderBase]: For 59603/59645 co-relation queries the response was YES. [2024-01-29 14:40:32,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107085 conditions, 49180 events. 13327/49180 cut-off events. For 59603/59645 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 525412 event pairs, 1537 based on Foata normal form. 1014/48270 useless extension candidates. Maximal degree in co-relation 105948. Up to 4966 conditions per place. [2024-01-29 14:40:33,017 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 397 selfloop transitions, 15 changer transitions 0/551 dead transitions. [2024-01-29 14:40:33,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 551 transitions, 3527 flow [2024-01-29 14:40:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-29 14:40:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-29 14:40:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2254 transitions. [2024-01-29 14:40:33,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8976503385105535 [2024-01-29 14:40:33,021 INFO L175 Difference]: Start difference. First operand has 247 places, 236 transitions, 982 flow. Second operand 9 states and 2254 transitions. [2024-01-29 14:40:33,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 551 transitions, 3527 flow [2024-01-29 14:40:33,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 551 transitions, 3461 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 14:40:33,166 INFO L231 Difference]: Finished difference. Result has 257 places, 241 transitions, 1034 flow [2024-01-29 14:40:33,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1034, PETRI_PLACES=257, PETRI_TRANSITIONS=241} [2024-01-29 14:40:33,166 INFO L281 CegarLoopForPetriNet]: 274 programPoint places, -17 predicate places. [2024-01-29 14:40:33,166 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 241 transitions, 1034 flow [2024-01-29 14:40:33,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 227.88888888888889) internal successors, (2051), 9 states have internal predecessors, (2051), 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 14:40:33,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 14:40:33,167 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:33,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-29 14:40:33,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:33,368 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 221 more)] === [2024-01-29 14:40:33,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 14:40:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 580343572, now seen corresponding path program 1 times [2024-01-29 14:40:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 14:40:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722929378] [2024-01-29 14:40:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 14:40:33,386 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-01-29 14:40:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [920374247] [2024-01-29 14:40:33,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 14:40:33,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-29 14:40:33,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 14:40:33,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-29 14:40:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-29 14:40:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:40:33,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 14:40:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 14:40:33,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 14:40:33,650 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 14:40:33,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err19ASSERT_VIOLATIONERROR_FUNCTION (223 of 224 remaining) [2024-01-29 14:40:33,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (222 of 224 remaining) [2024-01-29 14:40:33,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (221 of 224 remaining) [2024-01-29 14:40:33,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (220 of 224 remaining) [2024-01-29 14:40:33,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (219 of 224 remaining) [2024-01-29 14:40:33,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (218 of 224 remaining) [2024-01-29 14:40:33,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (217 of 224 remaining) [2024-01-29 14:40:33,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (216 of 224 remaining) [2024-01-29 14:40:33,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (215 of 224 remaining) [2024-01-29 14:40:33,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (214 of 224 remaining) [2024-01-29 14:40:33,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (213 of 224 remaining) [2024-01-29 14:40:33,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (212 of 224 remaining) [2024-01-29 14:40:33,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (211 of 224 remaining) [2024-01-29 14:40:33,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (210 of 224 remaining) [2024-01-29 14:40:33,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (209 of 224 remaining) [2024-01-29 14:40:33,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (208 of 224 remaining) [2024-01-29 14:40:33,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (207 of 224 remaining) [2024-01-29 14:40:33,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (206 of 224 remaining) [2024-01-29 14:40:33,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (205 of 224 remaining) [2024-01-29 14:40:33,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (204 of 224 remaining) [2024-01-29 14:40:33,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (203 of 224 remaining) [2024-01-29 14:40:33,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (202 of 224 remaining) [2024-01-29 14:40:33,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (201 of 224 remaining) [2024-01-29 14:40:33,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err61ASSERT_VIOLATIONWITNESS_INVARIANT (200 of 224 remaining) [2024-01-29 14:40:33,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (199 of 224 remaining) [2024-01-29 14:40:33,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err62ASSERT_VIOLATIONWITNESS_INVARIANT (198 of 224 remaining) [2024-01-29 14:40:33,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (197 of 224 remaining) [2024-01-29 14:40:33,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (196 of 224 remaining) [2024-01-29 14:40:33,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (195 of 224 remaining) [2024-01-29 14:40:33,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (194 of 224 remaining) [2024-01-29 14:40:33,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (193 of 224 remaining) [2024-01-29 14:40:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err56ASSERT_VIOLATIONWITNESS_INVARIANT (192 of 224 remaining) [2024-01-29 14:40:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (191 of 224 remaining) [2024-01-29 14:40:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err57ASSERT_VIOLATIONWITNESS_INVARIANT (190 of 224 remaining) [2024-01-29 14:40:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (189 of 224 remaining) [2024-01-29 14:40:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err58ASSERT_VIOLATIONWITNESS_INVARIANT (188 of 224 remaining) [2024-01-29 14:40:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (187 of 224 remaining) [2024-01-29 14:40:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err59ASSERT_VIOLATIONWITNESS_INVARIANT (186 of 224 remaining) [2024-01-29 14:40:33,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (185 of 224 remaining) [2024-01-29 14:40:33,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (184 of 224 remaining) [2024-01-29 14:40:33,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (183 of 224 remaining) [2024-01-29 14:40:33,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err60ASSERT_VIOLATIONWITNESS_INVARIANT (182 of 224 remaining) [2024-01-29 14:40:33,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (181 of 224 remaining) [2024-01-29 14:40:33,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (180 of 224 remaining) [2024-01-29 14:40:33,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (179 of 224 remaining) [2024-01-29 14:40:33,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (178 of 224 remaining) [2024-01-29 14:40:33,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err36ASSERT_VIOLATIONWITNESS_INVARIANT (177 of 224 remaining) [2024-01-29 14:40:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (176 of 224 remaining) [2024-01-29 14:40:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err37ASSERT_VIOLATIONWITNESS_INVARIANT (175 of 224 remaining) [2024-01-29 14:40:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (174 of 224 remaining) [2024-01-29 14:40:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err38ASSERT_VIOLATIONWITNESS_INVARIANT (173 of 224 remaining) [2024-01-29 14:40:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (172 of 224 remaining) [2024-01-29 14:40:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err39ASSERT_VIOLATIONWITNESS_INVARIANT (171 of 224 remaining) [2024-01-29 14:40:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (170 of 224 remaining) [2024-01-29 14:40:33,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err40ASSERT_VIOLATIONWITNESS_INVARIANT (169 of 224 remaining) [2024-01-29 14:40:33,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (168 of 224 remaining) [2024-01-29 14:40:33,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err41ASSERT_VIOLATIONWITNESS_INVARIANT (167 of 224 remaining) [2024-01-29 14:40:33,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (166 of 224 remaining) [2024-01-29 14:40:33,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (165 of 224 remaining) [2024-01-29 14:40:33,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err48ASSERT_VIOLATIONWITNESS_INVARIANT (164 of 224 remaining) [2024-01-29 14:40:33,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (163 of 224 remaining) [2024-01-29 14:40:33,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err49ASSERT_VIOLATIONWITNESS_INVARIANT (162 of 224 remaining) [2024-01-29 14:40:33,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (161 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err50ASSERT_VIOLATIONWITNESS_INVARIANT (160 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (159 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err51ASSERT_VIOLATIONWITNESS_INVARIANT (158 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err28ASSERT_VIOLATIONWITNESS_INVARIANT (157 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err52ASSERT_VIOLATIONWITNESS_INVARIANT (156 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err29ASSERT_VIOLATIONWITNESS_INVARIANT (155 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err53ASSERT_VIOLATIONWITNESS_INVARIANT (154 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err30ASSERT_VIOLATIONWITNESS_INVARIANT (153 of 224 remaining) [2024-01-29 14:40:33,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err54ASSERT_VIOLATIONWITNESS_INVARIANT (152 of 224 remaining) [2024-01-29 14:40:33,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err31ASSERT_VIOLATIONWITNESS_INVARIANT (151 of 224 remaining) [2024-01-29 14:40:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err55ASSERT_VIOLATIONWITNESS_INVARIANT (150 of 224 remaining) [2024-01-29 14:40:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err32ASSERT_VIOLATIONWITNESS_INVARIANT (149 of 224 remaining) [2024-01-29 14:40:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err33ASSERT_VIOLATIONWITNESS_INVARIANT (148 of 224 remaining) [2024-01-29 14:40:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err34ASSERT_VIOLATIONWITNESS_INVARIANT (147 of 224 remaining) [2024-01-29 14:40:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err42ASSERT_VIOLATIONWITNESS_INVARIANT (146 of 224 remaining) [2024-01-29 14:40:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err35ASSERT_VIOLATIONERROR_FUNCTION (145 of 224 remaining) [2024-01-29 14:40:33,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err43ASSERT_VIOLATIONWITNESS_INVARIANT (144 of 224 remaining) [2024-01-29 14:40:33,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err44ASSERT_VIOLATIONWITNESS_INVARIANT (143 of 224 remaining) [2024-01-29 14:40:33,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err45ASSERT_VIOLATIONWITNESS_INVARIANT (142 of 224 remaining) [2024-01-29 14:40:33,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err46ASSERT_VIOLATIONWITNESS_INVARIANT (141 of 224 remaining) [2024-01-29 14:40:33,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err47ASSERT_VIOLATIONWITNESS_INVARIANT (140 of 224 remaining) [2024-01-29 14:40:33,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (139 of 224 remaining) [2024-01-29 14:40:33,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (138 of 224 remaining) [2024-01-29 14:40:33,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err37ASSERT_VIOLATIONWITNESS_INVARIANT (137 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (136 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err38ASSERT_VIOLATIONWITNESS_INVARIANT (135 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (134 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (133 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (132 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (131 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (130 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err32ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 224 remaining) [2024-01-29 14:40:33,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 224 remaining) [2024-01-29 14:40:33,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err33ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 224 remaining) [2024-01-29 14:40:33,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 224 remaining) [2024-01-29 14:40:33,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err34ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 224 remaining) [2024-01-29 14:40:33,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 224 remaining) [2024-01-29 14:40:33,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err35ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 224 remaining) [2024-01-29 14:40:33,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 224 remaining) [2024-01-29 14:40:33,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 224 remaining) [2024-01-29 14:40:33,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err36ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 224 remaining) [2024-01-29 14:40:33,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 224 remaining) [2024-01-29 14:40:33,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 224 remaining) [2024-01-29 14:40:33,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 224 remaining) [2024-01-29 14:40:33,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 224 remaining) [2024-01-29 14:40:33,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 224 remaining) [2024-01-29 14:40:33,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 224 remaining) [2024-01-29 14:40:33,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 224 remaining) [2024-01-29 14:40:33,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err19ASSERT_VIOLATIONERROR_FUNCTION (112 of 224 remaining) [2024-01-29 14:40:33,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 224 remaining) [2024-01-29 14:40:33,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 224 remaining) [2024-01-29 14:40:33,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 224 remaining) [2024-01-29 14:40:33,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 224 remaining) [2024-01-29 14:40:33,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 224 remaining) [2024-01-29 14:40:33,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 224 remaining) [2024-01-29 14:40:33,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err27ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 224 remaining) [2024-01-29 14:40:33,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err28ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err29ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err30ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err31ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err61ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err62ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 224 remaining) [2024-01-29 14:40:33,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 224 remaining) [2024-01-29 14:40:33,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 224 remaining) [2024-01-29 14:40:33,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 224 remaining) [2024-01-29 14:40:33,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 224 remaining) [2024-01-29 14:40:33,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 224 remaining) [2024-01-29 14:40:33,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err56ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 224 remaining) [2024-01-29 14:40:33,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err8ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 224 remaining) [2024-01-29 14:40:33,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err57ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 224 remaining) [2024-01-29 14:40:33,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err9ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 224 remaining) [2024-01-29 14:40:33,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err58ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 224 remaining) [2024-01-29 14:40:33,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err10ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 224 remaining) [2024-01-29 14:40:33,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err59ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 224 remaining) [2024-01-29 14:40:33,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err11ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 224 remaining) [2024-01-29 14:40:33,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err12ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 224 remaining) [2024-01-29 14:40:33,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err13ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 224 remaining) [2024-01-29 14:40:33,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err60ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 224 remaining) [2024-01-29 14:40:33,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err14ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err15ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err16ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err17ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err36ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err18ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err37ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err19ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err38ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 224 remaining) [2024-01-29 14:40:33,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err20ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 224 remaining) [2024-01-29 14:40:33,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err39ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 224 remaining) [2024-01-29 14:40:33,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err21ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 224 remaining) [2024-01-29 14:40:33,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err40ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 224 remaining) [2024-01-29 14:40:33,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err22ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 224 remaining) [2024-01-29 14:40:33,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err41ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 224 remaining) [2024-01-29 14:40:33,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err23ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 224 remaining) [2024-01-29 14:40:33,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err24ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 224 remaining) [2024-01-29 14:40:33,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err48ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 224 remaining) [2024-01-29 14:40:33,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err25ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 224 remaining) [2024-01-29 14:40:33,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err49ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 224 remaining) [2024-01-29 14:40:33,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err26ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 224 remaining) [2024-01-29 14:40:33,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err50ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 224 remaining) [2024-01-29 14:40:33,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err27ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 224 remaining) [2024-01-29 14:40:33,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err51ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 224 remaining) [2024-01-29 14:40:33,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err28ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 224 remaining) [2024-01-29 14:40:33,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err52ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 224 remaining) [2024-01-29 14:40:33,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err29ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 224 remaining) [2024-01-29 14:40:33,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err53ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 224 remaining) [2024-01-29 14:40:33,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err30ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 224 remaining) [2024-01-29 14:40:33,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err54ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 224 remaining) [2024-01-29 14:40:33,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err31ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 224 remaining) [2024-01-29 14:40:33,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err55ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 224 remaining) [2024-01-29 14:40:33,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err32ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 224 remaining) [2024-01-29 14:40:33,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err33ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 224 remaining) [2024-01-29 14:40:33,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err34ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 224 remaining) [2024-01-29 14:40:33,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err42ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 224 remaining) [2024-01-29 14:40:33,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err35ASSERT_VIOLATIONERROR_FUNCTION (43 of 224 remaining) [2024-01-29 14:40:33,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err43ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 224 remaining) [2024-01-29 14:40:33,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err44ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 224 remaining) [2024-01-29 14:40:33,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err45ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 224 remaining) [2024-01-29 14:40:33,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err46ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 224 remaining) [2024-01-29 14:40:33,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err47ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 224 remaining) [2024-01-29 14:40:33,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 224 remaining) [2024-01-29 14:40:33,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 224 remaining) [2024-01-29 14:40:33,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err37ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 224 remaining) [2024-01-29 14:40:33,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 224 remaining) [2024-01-29 14:40:33,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err38ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 224 remaining) [2024-01-29 14:40:33,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 224 remaining) [2024-01-29 14:40:33,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 224 remaining) [2024-01-29 14:40:33,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 224 remaining) [2024-01-29 14:40:33,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 224 remaining) [2024-01-29 14:40:33,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 224 remaining) [2024-01-29 14:40:33,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err32ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 224 remaining) [2024-01-29 14:40:33,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err8ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 224 remaining) [2024-01-29 14:40:33,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err33ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 224 remaining) [2024-01-29 14:40:33,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err9ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 224 remaining) [2024-01-29 14:40:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err34ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 224 remaining) [2024-01-29 14:40:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err10ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 224 remaining) [2024-01-29 14:40:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err35ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 224 remaining) [2024-01-29 14:40:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err11ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 224 remaining) [2024-01-29 14:40:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err12ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 224 remaining) [2024-01-29 14:40:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err36ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 224 remaining) [2024-01-29 14:40:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err13ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 224 remaining) [2024-01-29 14:40:33,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err17ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 224 remaining) [2024-01-29 14:40:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err14ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 224 remaining) [2024-01-29 14:40:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err18ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 224 remaining) [2024-01-29 14:40:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err15ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 224 remaining) [2024-01-29 14:40:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err16ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 224 remaining) [2024-01-29 14:40:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err20ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 224 remaining) [2024-01-29 14:40:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err21ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 224 remaining) [2024-01-29 14:40:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err22ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 224 remaining) [2024-01-29 14:40:33,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err23ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 224 remaining) [2024-01-29 14:40:33,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err24ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 224 remaining) [2024-01-29 14:40:33,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err25ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 224 remaining) [2024-01-29 14:40:33,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err26ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 224 remaining) [2024-01-29 14:40:33,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err27ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 224 remaining) [2024-01-29 14:40:33,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err28ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 224 remaining) [2024-01-29 14:40:33,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err29ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 224 remaining) [2024-01-29 14:40:33,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err30ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 224 remaining) [2024-01-29 14:40:33,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err31ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 224 remaining) [2024-01-29 14:40:33,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-29 14:40:33,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-01-29 14:40:33,899 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 14:40:33,905 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 14:40:33,905 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 14:40:33,970 INFO L503 ceAbstractionStarter]: Automizer considered 118 witness invariants [2024-01-29 14:40:33,970 INFO L504 ceAbstractionStarter]: WitnessConsidered=118 [2024-01-29 14:40:33,971 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 02:40:33 BasicIcfg [2024-01-29 14:40:33,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 14:40:33,971 INFO L158 Benchmark]: Toolchain (without parser) took 44126.30ms. Allocated memory was 167.8MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 85.9MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-01-29 14:40:33,971 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 120.5MB in the end (delta: 244.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:40:33,972 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 14:40:33,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.07ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 85.7MB in the beginning and 213.9MB in the end (delta: -128.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-01-29 14:40:33,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.62ms. Allocated memory is still 268.4MB. Free memory was 213.9MB in the beginning and 210.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:40:33,972 INFO L158 Benchmark]: Boogie Preprocessor took 61.95ms. Allocated memory is still 268.4MB. Free memory was 210.8MB in the beginning and 206.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 14:40:33,972 INFO L158 Benchmark]: RCFGBuilder took 729.22ms. Allocated memory is still 268.4MB. Free memory was 206.6MB in the beginning and 143.6MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-01-29 14:40:33,973 INFO L158 Benchmark]: TraceAbstraction took 42557.07ms. Allocated memory was 268.4MB in the beginning and 9.8GB in the end (delta: 9.6GB). Free memory was 143.6MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-01-29 14:40:33,974 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 120.5MB in the end (delta: 244.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.07ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 85.7MB in the beginning and 213.9MB in the end (delta: -128.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.62ms. Allocated memory is still 268.4MB. Free memory was 213.9MB in the beginning and 210.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.95ms. Allocated memory is still 268.4MB. Free memory was 210.8MB in the beginning and 206.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 729.22ms. Allocated memory is still 268.4MB. Free memory was 206.6MB in the beginning and 143.6MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 42557.07ms. Allocated memory was 268.4MB in the beginning and 9.8GB in the end (delta: 9.6GB). Free memory was 143.6MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 static char buffer[10]; [L682] 0 static char buffer[10]; [L683] 0 static unsigned int first; [L684] 0 static unsigned int next; [L685] 0 static int buffer_size; [L686] 0 _Bool send, receive; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L687] 0 pthread_mutex_t m; [L756] 0 pthread_t id1, id2; VAL [buffer={3:0}, buffer_size=0, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=0] [L757] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [buffer={3:0}, buffer_size=0, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=0] [L757] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L758] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [buffer={3:0}, buffer_size=0, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=0] [L758] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L758] CALL 0 initLog(10) [L690] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IntegerLiteral[10],IdentifierExpression[max]]]] VAL [\old(max)=10, buffer={3:0}, buffer_size=0, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L690] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [\old(max)=10, buffer={3:0}, buffer_size=0, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L690] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [\old(max)=10, buffer={3:0}, buffer_size=0, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L690] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[max],IntegerLiteral[10]]]] [L690] 0 buffer_size = max VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L691] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IntegerLiteral[10],IdentifierExpression[max]]]] VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L691] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L691] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[max],IntegerLiteral[10]]]] VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L691] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L691] EXPR 0 next = 0 [L691] 0 first = next = 0 [L758] RET 0 initLog(10) [L759] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=0] [L759] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L759] 0 send=1 VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=1] [L760] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=1] [L760] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L760] 0 receive=0 VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=1] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=1] [L761] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1={5:0}, id2={6:0}, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; [L740] 2 i=0 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L742] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[5],IdentifierExpression[i]],BinaryExpression[COMPLEQ,IdentifierExpression[i],IntegerLiteral[6]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L750] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i++ VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; [L724] 1 i=0 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L726] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[5]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[1]]],BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IntegerLiteral[0],IdentifierExpression[i]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[i],IntegerLiteral[6]]]]] [L729] CALL 1 insertLogElement(i) [L707] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[6]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L707] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],IntegerLiteral[6]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L707] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[b]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L707] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L707] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L707] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],IntegerLiteral[127]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[6]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],IntegerLiteral[127]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],IntegerLiteral[6]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[b]]]] [L709] 1 buffer[next] = b VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[6]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],IntegerLiteral[127]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[b]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],IntegerLiteral[6]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],IntegerLiteral[6]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[b],IntegerLiteral[127]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[2]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[3]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[4]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[5]]],BinaryExpression[COMPEQ,IdentifierExpression[b],IntegerLiteral[6]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[b]]]] VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=1, send=0] [L697] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=1, send=0] [L697] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[receive],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[send],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L698] EXPR 2 buffer[first-1] [L698] 2 return buffer[first-1]; [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) [L746] 2 reach_error() VAL [arg={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=1, send=0] - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 726]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 735]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 727]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 731]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 740]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 740]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 500 locations, 224 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.4s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3889 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3085 mSDsluCounter, 3003 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2247 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5841 IncrementalHoareTripleChecker+Invalid, 6240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 756 mSDtfsCounter, 5841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 883 GetRequests, 809 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1034occurred in iteration=20, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1314 NumberOfCodeBlocks, 1314 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1434 ConstructedInterpolants, 9 QuantifiedInterpolants, 4805 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2080 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 106/232 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 14:40:34,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE