./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-dec-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-dec-subseq.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:07:22,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:07:22,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:07:22,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:07:22,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:07:22,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:07:22,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:07:22,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:07:22,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:07:22,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:07:22,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:07:22,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:07:22,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:07:22,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:07:22,906 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:07:22,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:07:22,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:07:22,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:07:22,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:07:22,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:07:22,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:07:22,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:07:22,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:07:22,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:07:22,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:07:22,909 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:07:22,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:07:22,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:07:22,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:07:22,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:07:22,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:07:22,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:07:22,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:07:22,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:07:22,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:07:22,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:07:22,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:07:22,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:07:22,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:07:22,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:07:22,913 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:07:22,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:07:22,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:07:22,914 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-06-28 01:07:23,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:07:23,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:07:23,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:07:23,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:07:23,134 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:07:23,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-28 01:07:24,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:07:24,507 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:07:24,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-28 01:07:24,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203648f4c/446a0dad6ddc4f688b46b6b5d9ead281/FLAGb1db494bd [2024-06-28 01:07:24,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/203648f4c/446a0dad6ddc4f688b46b6b5d9ead281 [2024-06-28 01:07:24,526 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:07:24,526 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:07:24,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-dec-subseq.wvr.yml/witness.yml [2024-06-28 01:07:24,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:07:24,613 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:07:24,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:07:24,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:07:24,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:07:24,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:07:24" (1/2) ... [2024-06-28 01:07:24,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd8e051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:24, skipping insertion in model container [2024-06-28 01:07:24,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:07:24" (1/2) ... [2024-06-28 01:07:24,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3861bd2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:24, skipping insertion in model container [2024-06-28 01:07:24,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:24" (2/2) ... [2024-06-28 01:07:24,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd8e051 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24, skipping insertion in model container [2024-06-28 01:07:24,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:24" (2/2) ... [2024-06-28 01:07:24,624 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:07:24,640 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:07:24,641 INFO L97 edCorrectnessWitness]: Location invariant before [L102-L102] (! multithreaded || 0 <= i) && (! multithreaded || 0 <= i) [2024-06-28 01:07:24,641 INFO L97 edCorrectnessWitness]: Location invariant before [L103-L103] (! multithreaded || 0 <= i) && (! multithreaded || 0 <= i) [2024-06-28 01:07:24,641 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:07:24,642 INFO L106 edCorrectnessWitness]: ghost_update [L101-L101] multithreaded = 1; [2024-06-28 01:07:24,657 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:07:24,823 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-28 01:07:24,836 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:07:24,842 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:07:24,885 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-28 01:07:24,887 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:07:24,900 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:07:24,901 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24 WrapperNode [2024-06-28 01:07:24,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:07:24,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:07:24,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:07:24,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:07:24,907 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 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,923 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 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,940 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 192 [2024-06-28 01:07:24,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:07:24,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:07:24,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:07:24,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:07:24,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,970 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-28 01:07:24,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:07:24,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:07:24,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:07:24,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:07:24,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (1/1) ... [2024-06-28 01:07:24,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:07:24,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:25,004 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-06-28 01:07:25,015 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-06-28 01:07:25,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:07:25,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 01:07:25,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 01:07:25,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 01:07:25,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 01:07:25,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:07:25,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 01:07:25,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 01:07:25,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 01:07:25,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:07:25,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:07:25,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-28 01:07:25,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:07:25,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:07:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 01:07:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 01:07:25,036 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:07:25,160 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:07:25,181 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:07:25,447 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:07:25,448 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:07:25,722 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:07:25,723 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-28 01:07:25,724 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:07:25 BoogieIcfgContainer [2024-06-28 01:07:25,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:07:25,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:07:25,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:07:25,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:07:25,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:07:24" (1/4) ... [2024-06-28 01:07:25,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576a1da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:07:25, skipping insertion in model container [2024-06-28 01:07:25,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:24" (2/4) ... [2024-06-28 01:07:25,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576a1da0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:07:25, skipping insertion in model container [2024-06-28 01:07:25,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:24" (3/4) ... [2024-06-28 01:07:25,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576a1da0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:07:25, skipping insertion in model container [2024-06-28 01:07:25,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:07:25" (4/4) ... [2024-06-28 01:07:25,739 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-06-28 01:07:25,755 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:07:25,755 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 01:07:25,755 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:07:25,803 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-28 01:07:25,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2024-06-28 01:07:25,866 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-06-28 01:07:25,866 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-28 01:07:25,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-06-28 01:07:25,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2024-06-28 01:07:25,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 78 flow [2024-06-28 01:07:25,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:07:25,897 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;@5f12693d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:07:25,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 01:07:25,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:07:25,906 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2024-06-28 01:07:25,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:07:25,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:25,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:25,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:25,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:25,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1746555899, now seen corresponding path program 1 times [2024-06-28 01:07:25,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:25,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037610840] [2024-06-28 01:07:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:25,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:26,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037610840] [2024-06-28 01:07:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037610840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:26,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:26,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:07:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860799731] [2024-06-28 01:07:26,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:26,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:26,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:26,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:26,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:07:26,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06-28 01:07:26,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:26,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:07:26,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:26,464 INFO L124 PetriNetUnfolderBase]: 287/517 cut-off events. [2024-06-28 01:07:26,464 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-28 01:07:26,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 517 events. 287/517 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2366 event pairs, 96 based on Foata normal form. 24/450 useless extension candidates. Maximal degree in co-relation 939. Up to 285 conditions per place. [2024-06-28 01:07:26,469 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-06-28 01:07:26,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 205 flow [2024-06-28 01:07:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-28 01:07:26,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-28 01:07:26,482 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 3 states and 74 transitions. [2024-06-28 01:07:26,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 205 flow [2024-06-28 01:07:26,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:07:26,490 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 84 flow [2024-06-28 01:07:26,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2024-06-28 01:07:26,495 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-28 01:07:26,495 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 84 flow [2024-06-28 01:07:26,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06-28 01:07:26,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:26,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:26,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:07:26,497 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:26,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1523712316, now seen corresponding path program 1 times [2024-06-28 01:07:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:26,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083844947] [2024-06-28 01:07:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:26,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083844947] [2024-06-28 01:07:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083844947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429120246] [2024-06-28 01:07:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:26,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:26,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:26,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:26,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:07:26,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-28 01:07:26,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:26,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:07:26,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:26,740 INFO L124 PetriNetUnfolderBase]: 222/422 cut-off events. [2024-06-28 01:07:26,740 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-28 01:07:26,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 422 events. 222/422 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1963 event pairs, 71 based on Foata normal form. 30/379 useless extension candidates. Maximal degree in co-relation 412. Up to 189 conditions per place. [2024-06-28 01:07:26,743 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 38 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-06-28 01:07:26,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 191 flow [2024-06-28 01:07:26,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:07:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:07:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-06-28 01:07:26,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-06-28 01:07:26,744 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 84 flow. Second operand 4 states and 82 transitions. [2024-06-28 01:07:26,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 191 flow [2024-06-28 01:07:26,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:26,746 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 78 flow [2024-06-28 01:07:26,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-06-28 01:07:26,746 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-28 01:07:26,747 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 78 flow [2024-06-28 01:07:26,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-28 01:07:26,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:26,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:26,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:07:26,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:26,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1499540965, now seen corresponding path program 1 times [2024-06-28 01:07:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48174986] [2024-06-28 01:07:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:26,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:26,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48174986] [2024-06-28 01:07:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48174986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:07:26,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783789026] [2024-06-28 01:07:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:26,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:26,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:26,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:07:26,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06-28 01:07:26,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:26,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:07:26,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:26,931 INFO L124 PetriNetUnfolderBase]: 201/373 cut-off events. [2024-06-28 01:07:26,932 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-06-28 01:07:26,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 373 events. 201/373 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1580 event pairs, 55 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 325. Up to 190 conditions per place. [2024-06-28 01:07:26,935 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2024-06-28 01:07:26,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 175 flow [2024-06-28 01:07:26,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:07:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:07:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-06-28 01:07:26,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-06-28 01:07:26,938 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 78 flow. Second operand 4 states and 77 transitions. [2024-06-28 01:07:26,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 175 flow [2024-06-28 01:07:26,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:07:26,940 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 85 flow [2024-06-28 01:07:26,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-06-28 01:07:26,942 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-06-28 01:07:26,942 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 85 flow [2024-06-28 01:07:26,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06-28 01:07:26,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:26,942 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-06-28 01:07:26,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:07:26,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:26,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1780392980, now seen corresponding path program 1 times [2024-06-28 01:07:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:26,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470414500] [2024-06-28 01:07:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:27,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:27,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470414500] [2024-06-28 01:07:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470414500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:27,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:27,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:07:27,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371559071] [2024-06-28 01:07:27,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:27,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:27,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:27,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:27,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:27,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:07:27,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-06-28 01:07:27,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:27,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:07:27,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:27,136 INFO L124 PetriNetUnfolderBase]: 213/425 cut-off events. [2024-06-28 01:07:27,136 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2024-06-28 01:07:27,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 425 events. 213/425 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1925 event pairs, 136 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 328. Up to 340 conditions per place. [2024-06-28 01:07:27,138 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 23 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-06-28 01:07:27,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 137 flow [2024-06-28 01:07:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-28 01:07:27,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2024-06-28 01:07:27,142 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 85 flow. Second operand 3 states and 61 transitions. [2024-06-28 01:07:27,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 137 flow [2024-06-28 01:07:27,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 131 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 01:07:27,144 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 91 flow [2024-06-28 01:07:27,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2024-06-28 01:07:27,145 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-06-28 01:07:27,146 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 91 flow [2024-06-28 01:07:27,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-06-28 01:07:27,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:27,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:27,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:07:27,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:27,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1409768404, now seen corresponding path program 1 times [2024-06-28 01:07:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722521410] [2024-06-28 01:07:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:27,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:27,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722521410] [2024-06-28 01:07:27,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722521410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:27,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744306779] [2024-06-28 01:07:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:27,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:27,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:07:27,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06-28 01:07:27,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:27,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:07:27,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:27,335 INFO L124 PetriNetUnfolderBase]: 270/539 cut-off events. [2024-06-28 01:07:27,336 INFO L125 PetriNetUnfolderBase]: For 37/40 co-relation queries the response was YES. [2024-06-28 01:07:27,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 539 events. 270/539 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2510 event pairs, 104 based on Foata normal form. 1/486 useless extension candidates. Maximal degree in co-relation 1069. Up to 240 conditions per place. [2024-06-28 01:07:27,338 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2024-06-28 01:07:27,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 207 flow [2024-06-28 01:07:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-28 01:07:27,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2024-06-28 01:07:27,339 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 91 flow. Second operand 3 states and 73 transitions. [2024-06-28 01:07:27,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 207 flow [2024-06-28 01:07:27,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 203 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:27,341 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 99 flow [2024-06-28 01:07:27,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-06-28 01:07:27,342 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-06-28 01:07:27,342 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 99 flow [2024-06-28 01:07:27,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06-28 01:07:27,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:27,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:27,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:07:27,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:27,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1983940103, now seen corresponding path program 1 times [2024-06-28 01:07:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514230374] [2024-06-28 01:07:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:27,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514230374] [2024-06-28 01:07:27,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514230374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:27,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:27,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153554426] [2024-06-28 01:07:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:27,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:27,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:07:27,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-06-28 01:07:27,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:27,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:07:27,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:27,475 INFO L124 PetriNetUnfolderBase]: 270/534 cut-off events. [2024-06-28 01:07:27,475 INFO L125 PetriNetUnfolderBase]: For 45/47 co-relation queries the response was YES. [2024-06-28 01:07:27,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 534 events. 270/534 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2437 event pairs, 110 based on Foata normal form. 7/498 useless extension candidates. Maximal degree in co-relation 1171. Up to 333 conditions per place. [2024-06-28 01:07:27,478 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 34 selfloop transitions, 2 changer transitions 4/48 dead transitions. [2024-06-28 01:07:27,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 218 flow [2024-06-28 01:07:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-28 01:07:27,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2024-06-28 01:07:27,480 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 99 flow. Second operand 3 states and 73 transitions. [2024-06-28 01:07:27,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 218 flow [2024-06-28 01:07:27,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:27,482 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 109 flow [2024-06-28 01:07:27,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2024-06-28 01:07:27,485 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-06-28 01:07:27,485 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 109 flow [2024-06-28 01:07:27,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-06-28 01:07:27,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:27,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:27,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:07:27,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:27,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1499428828, now seen corresponding path program 1 times [2024-06-28 01:07:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:27,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994909876] [2024-06-28 01:07:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:27,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:27,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994909876] [2024-06-28 01:07:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994909876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:27,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:27,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:07:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752488022] [2024-06-28 01:07:27,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:27,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:27,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:27,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:27,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:27,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:07:27,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06-28 01:07:27,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:27,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:07:27,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:27,690 INFO L124 PetriNetUnfolderBase]: 336/705 cut-off events. [2024-06-28 01:07:27,690 INFO L125 PetriNetUnfolderBase]: For 104/108 co-relation queries the response was YES. [2024-06-28 01:07:27,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 705 events. 336/705 cut-off events. For 104/108 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3643 event pairs, 272 based on Foata normal form. 14/659 useless extension candidates. Maximal degree in co-relation 1236. Up to 470 conditions per place. [2024-06-28 01:07:27,694 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 26 selfloop transitions, 2 changer transitions 18/54 dead transitions. [2024-06-28 01:07:27,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 259 flow [2024-06-28 01:07:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:07:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:07:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-28 01:07:27,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2024-06-28 01:07:27,695 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 109 flow. Second operand 5 states and 101 transitions. [2024-06-28 01:07:27,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 259 flow [2024-06-28 01:07:27,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:27,698 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 123 flow [2024-06-28 01:07:27,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-06-28 01:07:27,699 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2024-06-28 01:07:27,700 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 123 flow [2024-06-28 01:07:27,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06-28 01:07:27,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:27,700 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] [2024-06-28 01:07:27,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:07:27,700 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:27,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1842536997, now seen corresponding path program 1 times [2024-06-28 01:07:27,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:27,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658606728] [2024-06-28 01:07:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658606728] [2024-06-28 01:07:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658606728] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:28,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711300929] [2024-06-28 01:07:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:28,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:28,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:28,340 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-06-28 01:07:28,365 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-06-28 01:07:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:28,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-28 01:07:28,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:07:28,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-06-28 01:07:28,525 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 23 treesize of output 1 [2024-06-28 01:07:28,582 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-28 01:07:28,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-28 01:07:28,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-28 01:07:28,913 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-06-28 01:07:28,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-06-28 01:07:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:28,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:07:29,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:29,745 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2024-06-28 01:07:29,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:29,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 90 [2024-06-28 01:07:29,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:29,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2024-06-28 01:07:29,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:29,845 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 66 [2024-06-28 01:07:29,878 INFO L349 Elim1Store]: treesize reduction 9, result has 80.9 percent of original size [2024-06-28 01:07:29,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 181 [2024-06-28 01:07:29,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-28 01:07:29,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:29,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 120 [2024-06-28 01:07:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711300929] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:07:30,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:07:30,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2024-06-28 01:07:30,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840660059] [2024-06-28 01:07:30,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:07:30,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-06-28 01:07:30,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:30,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-06-28 01:07:30,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=911, Unknown=3, NotChecked=0, Total=1122 [2024-06-28 01:07:30,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-28 01:07:30,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 123 flow. Second operand has 34 states, 34 states have (on average 8.117647058823529) internal successors, (276), 34 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:30,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:30,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-28 01:07:30,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:34,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:07:38,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:07:43,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:07:52,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:07:56,115 INFO L124 PetriNetUnfolderBase]: 2719/4470 cut-off events. [2024-06-28 01:07:56,115 INFO L125 PetriNetUnfolderBase]: For 862/862 co-relation queries the response was YES. [2024-06-28 01:07:56,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10796 conditions, 4470 events. 2719/4470 cut-off events. For 862/862 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 25354 event pairs, 292 based on Foata normal form. 8/3929 useless extension candidates. Maximal degree in co-relation 10776. Up to 779 conditions per place. [2024-06-28 01:07:56,131 INFO L140 encePairwiseOnDemand]: 18/36 looper letters, 278 selfloop transitions, 92 changer transitions 121/495 dead transitions. [2024-06-28 01:07:56,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 495 transitions, 2425 flow [2024-06-28 01:07:56,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-06-28 01:07:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2024-06-28 01:07:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 812 transitions. [2024-06-28 01:07:56,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-28 01:07:56,134 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 123 flow. Second operand 56 states and 812 transitions. [2024-06-28 01:07:56,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 495 transitions, 2425 flow [2024-06-28 01:07:56,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 495 transitions, 2399 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-28 01:07:56,144 INFO L231 Difference]: Finished difference. Result has 136 places, 138 transitions, 988 flow [2024-06-28 01:07:56,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=988, PETRI_PLACES=136, PETRI_TRANSITIONS=138} [2024-06-28 01:07:56,146 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 101 predicate places. [2024-06-28 01:07:56,148 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 138 transitions, 988 flow [2024-06-28 01:07:56,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.117647058823529) internal successors, (276), 34 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:56,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:56,148 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] [2024-06-28 01:07:56,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-28 01:07:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:56,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:56,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash 892695088, now seen corresponding path program 2 times [2024-06-28 01:07:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443322385] [2024-06-28 01:07:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:57,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:57,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443322385] [2024-06-28 01:07:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443322385] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370248557] [2024-06-28 01:07:57,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:07:57,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:57,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:57,284 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-06-28 01:07:57,286 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-06-28 01:07:57,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:07:57,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:07:57,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 28 conjunts are in the unsatisfiable core [2024-06-28 01:07:57,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:07:57,839 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-06-28 01:07:57,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-06-28 01:07:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:57,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:02,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:08:02,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 174 [2024-06-28 01:08:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-28 01:08:02,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370248557] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:08:02,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:08:02,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 27 [2024-06-28 01:08:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129511853] [2024-06-28 01:08:02,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:08:02,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-28 01:08:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-28 01:08:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=623, Unknown=1, NotChecked=0, Total=756 [2024-06-28 01:08:06,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:08:06,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-28 01:08:06,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 138 transitions, 988 flow. Second operand has 28 states, 28 states have (on average 8.857142857142858) internal successors, (248), 28 states have internal predecessors, (248), 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-06-28 01:08:06,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:06,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-28 01:08:06,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:11,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:08:12,256 INFO L124 PetriNetUnfolderBase]: 2852/4693 cut-off events. [2024-06-28 01:08:12,257 INFO L125 PetriNetUnfolderBase]: For 35967/35970 co-relation queries the response was YES. [2024-06-28 01:08:12,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22672 conditions, 4693 events. 2852/4693 cut-off events. For 35967/35970 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 26387 event pairs, 179 based on Foata normal form. 5/4491 useless extension candidates. Maximal degree in co-relation 22598. Up to 1319 conditions per place. [2024-06-28 01:08:12,296 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 219 selfloop transitions, 127 changer transitions 25/375 dead transitions. [2024-06-28 01:08:12,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 375 transitions, 3340 flow [2024-06-28 01:08:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-06-28 01:08:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-06-28 01:08:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 375 transitions. [2024-06-28 01:08:12,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38580246913580246 [2024-06-28 01:08:12,298 INFO L175 Difference]: Start difference. First operand has 136 places, 138 transitions, 988 flow. Second operand 27 states and 375 transitions. [2024-06-28 01:08:12,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 375 transitions, 3340 flow [2024-06-28 01:08:12,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 375 transitions, 2863 flow, removed 216 selfloop flow, removed 15 redundant places. [2024-06-28 01:08:12,405 INFO L231 Difference]: Finished difference. Result has 147 places, 217 transitions, 1777 flow [2024-06-28 01:08:12,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1777, PETRI_PLACES=147, PETRI_TRANSITIONS=217} [2024-06-28 01:08:12,406 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 112 predicate places. [2024-06-28 01:08:12,406 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 217 transitions, 1777 flow [2024-06-28 01:08:12,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.857142857142858) internal successors, (248), 28 states have internal predecessors, (248), 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-06-28 01:08:12,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:12,407 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2024-06-28 01:08:12,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-28 01:08:12,619 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,SelfDestructingSolverStorable8 [2024-06-28 01:08:12,620 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:08:12,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1074861940, now seen corresponding path program 3 times [2024-06-28 01:08:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177431968] [2024-06-28 01:08:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:08:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177431968] [2024-06-28 01:08:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177431968] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758909580] [2024-06-28 01:08:12,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-28 01:08:12,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:12,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:12,684 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-06-28 01:08:12,708 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-06-28 01:08:12,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-28 01:08:12,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:08:12,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-28 01:08:12,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:08:12,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:08:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758909580] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:08:13,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:08:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 13 [2024-06-28 01:08:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262868137] [2024-06-28 01:08:13,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:08:13,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-28 01:08:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-28 01:08:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-06-28 01:08:13,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:08:13,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 217 transitions, 1777 flow. Second operand has 14 states, 14 states have (on average 16.571428571428573) internal successors, (232), 14 states have internal predecessors, (232), 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-06-28 01:08:13,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:13,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:08:13,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:13,975 INFO L124 PetriNetUnfolderBase]: 1544/3175 cut-off events. [2024-06-28 01:08:13,976 INFO L125 PetriNetUnfolderBase]: For 23435/23776 co-relation queries the response was YES. [2024-06-28 01:08:13,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15356 conditions, 3175 events. 1544/3175 cut-off events. For 23435/23776 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 20021 event pairs, 344 based on Foata normal form. 133/3249 useless extension candidates. Maximal degree in co-relation 15286. Up to 695 conditions per place. [2024-06-28 01:08:14,006 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 152 selfloop transitions, 34 changer transitions 102/302 dead transitions. [2024-06-28 01:08:14,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 302 transitions, 3076 flow [2024-06-28 01:08:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:08:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:08:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-06-28 01:08:14,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-06-28 01:08:14,008 INFO L175 Difference]: Start difference. First operand has 147 places, 217 transitions, 1777 flow. Second operand 9 states and 204 transitions. [2024-06-28 01:08:14,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 302 transitions, 3076 flow [2024-06-28 01:08:14,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 302 transitions, 2811 flow, removed 103 selfloop flow, removed 11 redundant places. [2024-06-28 01:08:14,062 INFO L231 Difference]: Finished difference. Result has 138 places, 142 transitions, 1228 flow [2024-06-28 01:08:14,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1228, PETRI_PLACES=138, PETRI_TRANSITIONS=142} [2024-06-28 01:08:14,063 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2024-06-28 01:08:14,063 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 142 transitions, 1228 flow [2024-06-28 01:08:14,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.571428571428573) internal successors, (232), 14 states have internal predecessors, (232), 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-06-28 01:08:14,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:14,064 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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] [2024-06-28 01:08:14,076 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-06-28 01:08:14,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:14,277 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:08:14,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1013509729, now seen corresponding path program 4 times [2024-06-28 01:08:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561693886] [2024-06-28 01:08:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-28 01:08:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561693886] [2024-06-28 01:08:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561693886] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314518049] [2024-06-28 01:08:14,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-28 01:08:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:14,437 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-06-28 01:08:14,462 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-06-28 01:08:14,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-28 01:08:14,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:08:14,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-28 01:08:14,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-28 01:08:14,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-28 01:08:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314518049] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:08:14,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:08:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-06-28 01:08:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874371858] [2024-06-28 01:08:14,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:08:14,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-28 01:08:14,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-28 01:08:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-06-28 01:08:14,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:08:14,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 142 transitions, 1228 flow. Second operand has 15 states, 15 states have (on average 13.6) internal successors, (204), 15 states have internal predecessors, (204), 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-06-28 01:08:14,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:14,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:08:14,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:15,162 INFO L124 PetriNetUnfolderBase]: 856/1889 cut-off events. [2024-06-28 01:08:15,162 INFO L125 PetriNetUnfolderBase]: For 10499/10583 co-relation queries the response was YES. [2024-06-28 01:08:15,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8507 conditions, 1889 events. 856/1889 cut-off events. For 10499/10583 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10674 event pairs, 240 based on Foata normal form. 55/1916 useless extension candidates. Maximal degree in co-relation 8464. Up to 924 conditions per place. [2024-06-28 01:08:15,205 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 83 selfloop transitions, 20 changer transitions 58/171 dead transitions. [2024-06-28 01:08:15,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 171 transitions, 1685 flow [2024-06-28 01:08:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:08:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:08:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-28 01:08:15,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-06-28 01:08:15,209 INFO L175 Difference]: Start difference. First operand has 138 places, 142 transitions, 1228 flow. Second operand 9 states and 159 transitions. [2024-06-28 01:08:15,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 171 transitions, 1685 flow [2024-06-28 01:08:15,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1558 flow, removed 57 selfloop flow, removed 15 redundant places. [2024-06-28 01:08:15,238 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 714 flow [2024-06-28 01:08:15,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=714, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2024-06-28 01:08:15,242 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 76 predicate places. [2024-06-28 01:08:15,242 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 714 flow [2024-06-28 01:08:15,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.6) internal successors, (204), 15 states have internal predecessors, (204), 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-06-28 01:08:15,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:15,243 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-06-28 01:08:15,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-28 01:08:15,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:15,443 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:08:15,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2098103611, now seen corresponding path program 5 times [2024-06-28 01:08:15,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:15,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441932638] [2024-06-28 01:08:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:08:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441932638] [2024-06-28 01:08:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441932638] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870765157] [2024-06-28 01:08:16,890 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-28 01:08:16,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:16,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:16,892 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-06-28 01:08:16,897 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-06-28 01:08:16,987 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-28 01:08:16,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:08:16,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 49 conjunts are in the unsatisfiable core [2024-06-28 01:08:16,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:26,090 INFO L349 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2024-06-28 01:08:26,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 52 [2024-06-28 01:08:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:08:27,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:58,246 WARN L293 SmtUtils]: Spent 15.00s on a formula simplification. DAG size of input: 325 DAG size of output: 289 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-28 01:08:58,246 INFO L349 Elim1Store]: treesize reduction 144, result has 87.7 percent of original size [2024-06-28 01:08:58,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 233 treesize of output 1086 [2024-06-28 01:15:39,954 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-28 01:15:39,955 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-28 01:15:39,971 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 101 [2024-06-28 01:15:39,973 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-06-28 01:15:40,155 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,SelfDestructingSolverStorable11 [2024-06-28 01:15:40,156 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-06-28 01:15:40,160 INFO L158 Benchmark]: Toolchain (without parser) took 495547.39ms. Allocated memory was 176.2MB in the beginning and 914.4MB in the end (delta: 738.2MB). Free memory was 116.0MB in the beginning and 706.9MB in the end (delta: -590.9MB). Peak memory consumption was 630.3MB. Max. memory is 16.1GB. [2024-06-28 01:15:40,160 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:15:40,160 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:15:40,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.26ms. Allocated memory is still 176.2MB. Free memory was 116.0MB in the beginning and 100.0MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-28 01:15:40,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.90ms. Allocated memory is still 176.2MB. Free memory was 100.0MB in the beginning and 97.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:15:40,161 INFO L158 Benchmark]: Boogie Preprocessor took 39.77ms. Allocated memory is still 176.2MB. Free memory was 97.8MB in the beginning and 95.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:15:40,161 INFO L158 Benchmark]: RCFGBuilder took 742.23ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 95.0MB in the beginning and 177.3MB in the end (delta: -82.3MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-06-28 01:15:40,161 INFO L158 Benchmark]: TraceAbstraction took 494431.58ms. Allocated memory was 239.1MB in the beginning and 914.4MB in the end (delta: 675.3MB). Free memory was 176.2MB in the beginning and 706.9MB in the end (delta: -530.6MB). Peak memory consumption was 626.2MB. Max. memory is 16.1GB. [2024-06-28 01:15:40,162 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.15ms. Allocated memory is still 176.2MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.26ms. Allocated memory is still 176.2MB. Free memory was 116.0MB in the beginning and 100.0MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.90ms. Allocated memory is still 176.2MB. Free memory was 100.0MB in the beginning and 97.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.77ms. Allocated memory is still 176.2MB. Free memory was 97.8MB in the beginning and 95.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 742.23ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 95.0MB in the beginning and 177.3MB in the end (delta: -82.3MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * TraceAbstraction took 494431.58ms. Allocated memory was 239.1MB in the beginning and 914.4MB in the end (delta: 675.3MB). Free memory was 176.2MB in the beginning and 706.9MB in the end (delta: -530.6MB). Peak memory consumption was 626.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-dec-subseq.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:15:42,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:15:42,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-28 01:15:42,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:15:42,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:15:42,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:15:42,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:15:42,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:15:42,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:15:42,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:15:42,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:15:42,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:15:42,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:15:42,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:15:42,138 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:15:42,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:15:42,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:15:42,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:15:42,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:15:42,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:15:42,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:15:42,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:15:42,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:15:42,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-28 01:15:42,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-28 01:15:42,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:15:42,141 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-28 01:15:42,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:15:42,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:15:42,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:15:42,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:15:42,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:15:42,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:15:42,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:15:42,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:15:42,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:15:42,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:15:42,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:15:42,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-28 01:15:42,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-28 01:15:42,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:15:42,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:15:42,150 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:15:42,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:15:42,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:15:42,150 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-28 01:15:42,150 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-06-28 01:15:42,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:15:42,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:15:42,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:15:42,438 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:15:42,439 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:15:42,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-dec-subseq.wvr.yml/witness.yml [2024-06-28 01:15:42,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:15:42,542 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:15:42,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-28 01:15:43,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:15:43,891 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:15:43,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-28 01:15:43,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c292194b4/d89fe7061c5d4228967e054d2df07ea8/FLAG01523b63e [2024-06-28 01:15:43,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c292194b4/d89fe7061c5d4228967e054d2df07ea8 [2024-06-28 01:15:43,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:15:43,908 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:15:43,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:15:43,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:15:43,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:15:43,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:42" (1/2) ... [2024-06-28 01:15:43,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aca593 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:43, skipping insertion in model container [2024-06-28 01:15:43,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:42" (1/2) ... [2024-06-28 01:15:43,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2ced9c3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:43, skipping insertion in model container [2024-06-28 01:15:43,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:15:43" (2/2) ... [2024-06-28 01:15:43,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aca593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:43, skipping insertion in model container [2024-06-28 01:15:43,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:15:43" (2/2) ... [2024-06-28 01:15:43,921 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:15:43,936 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:15:43,937 INFO L97 edCorrectnessWitness]: Location invariant before [L102-L102] (! multithreaded || 0 <= i) && (! multithreaded || 0 <= i) [2024-06-28 01:15:43,937 INFO L97 edCorrectnessWitness]: Location invariant before [L103-L103] (! multithreaded || 0 <= i) && (! multithreaded || 0 <= i) [2024-06-28 01:15:43,938 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:15:43,938 INFO L106 edCorrectnessWitness]: ghost_update [L101-L101] multithreaded = 1; [2024-06-28 01:15:43,955 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:15:44,129 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-28 01:15:44,141 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:15:44,153 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-28 01:15:44,159 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:15:44,179 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-28 01:15:44,185 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:15:44,192 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:15:44,247 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-28 01:15:44,249 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:15:44,266 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:15:44,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44 WrapperNode [2024-06-28 01:15:44,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:15:44,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:15:44,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:15:44,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:15:44,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,311 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 187 [2024-06-28 01:15:44,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:15:44,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:15:44,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:15:44,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:15:44,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,341 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-28 01:15:44,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:15:44,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:15:44,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:15:44,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:15:44,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (1/1) ... [2024-06-28 01:15:44,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:15:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:44,410 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-06-28 01:15:44,416 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-06-28 01:15:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:15:44,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 01:15:44,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 01:15:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 01:15:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 01:15:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-28 01:15:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-28 01:15:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:15:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:15:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-28 01:15:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-28 01:15:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-28 01:15:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:15:44,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:15:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-28 01:15:44,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-28 01:15:44,443 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:15:44,551 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:15:44,552 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:15:44,876 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:15:44,876 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:15:45,100 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:15:45,100 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-28 01:15:45,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:15:45 BoogieIcfgContainer [2024-06-28 01:15:45,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:15:45,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:15:45,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:15:45,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:15:45,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:42" (1/4) ... [2024-06-28 01:15:45,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bdc7e6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:15:45, skipping insertion in model container [2024-06-28 01:15:45,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:15:43" (2/4) ... [2024-06-28 01:15:45,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bdc7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:15:45, skipping insertion in model container [2024-06-28 01:15:45,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:44" (3/4) ... [2024-06-28 01:15:45,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bdc7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:15:45, skipping insertion in model container [2024-06-28 01:15:45,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:15:45" (4/4) ... [2024-06-28 01:15:45,109 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-06-28 01:15:45,125 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:15:45,125 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 01:15:45,125 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:15:45,161 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-28 01:15:45,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2024-06-28 01:15:45,220 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-06-28 01:15:45,221 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-28 01:15:45,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-06-28 01:15:45,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2024-06-28 01:15:45,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 78 flow [2024-06-28 01:15:45,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:15:45,243 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;@55bfb9a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:15:45,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 01:15:45,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:15:45,246 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2024-06-28 01:15:45,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:15:45,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:45,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:45,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:15:45,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1967476541, now seen corresponding path program 1 times [2024-06-28 01:15:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:15:45,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786704255] [2024-06-28 01:15:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:45,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:15:45,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:15:45,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-28 01:15:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:45,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-28 01:15:45,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:15:45,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:15:45,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:15:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786704255] [2024-06-28 01:15:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786704255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:45,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:15:45,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121765965] [2024-06-28 01:15:45,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:45,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:15:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:15:45,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:15:45,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:15:45,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:15:45,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06-28 01:15:45,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:45,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:15:45,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:45,582 INFO L124 PetriNetUnfolderBase]: 287/517 cut-off events. [2024-06-28 01:15:45,582 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-28 01:15:45,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 517 events. 287/517 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2378 event pairs, 96 based on Foata normal form. 24/451 useless extension candidates. Maximal degree in co-relation 939. Up to 285 conditions per place. [2024-06-28 01:15:45,587 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-06-28 01:15:45,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 205 flow [2024-06-28 01:15:45,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:15:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:15:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-28 01:15:45,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-28 01:15:45,613 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 3 states and 74 transitions. [2024-06-28 01:15:45,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 205 flow [2024-06-28 01:15:45,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:15:45,618 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 84 flow [2024-06-28 01:15:45,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2024-06-28 01:15:45,621 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-28 01:15:45,622 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 84 flow [2024-06-28 01:15:45,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-06-28 01:15:45,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:45,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:45,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-06-28 01:15:45,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:45,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:15:45,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1223388292, now seen corresponding path program 1 times [2024-06-28 01:15:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:15:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617959722] [2024-06-28 01:15:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:45,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:15:45,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:15:45,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-28 01:15:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:45,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-28 01:15:45,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:15:45,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:15:45,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:15:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617959722] [2024-06-28 01:15:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617959722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:45,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:45,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:15:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737914613] [2024-06-28 01:15:45,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:45,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:15:45,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:15:45,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:15:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:15:45,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:15:45,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-28 01:15:45,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:45,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:15:45,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:46,139 INFO L124 PetriNetUnfolderBase]: 393/696 cut-off events. [2024-06-28 01:15:46,139 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-06-28 01:15:46,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 696 events. 393/696 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3374 event pairs, 96 based on Foata normal form. 30/622 useless extension candidates. Maximal degree in co-relation 412. Up to 285 conditions per place. [2024-06-28 01:15:46,144 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 56 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2024-06-28 01:15:46,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 67 transitions, 276 flow [2024-06-28 01:15:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:15:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:15:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-28 01:15:46,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7013888888888888 [2024-06-28 01:15:46,145 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 84 flow. Second operand 4 states and 101 transitions. [2024-06-28 01:15:46,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 67 transitions, 276 flow [2024-06-28 01:15:46,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 67 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:15:46,147 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-06-28 01:15:46,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-06-28 01:15:46,148 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-06-28 01:15:46,148 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-06-28 01:15:46,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-28 01:15:46,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:46,149 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:46,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-28 01:15:46,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:46,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:15:46,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:46,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1132987047, now seen corresponding path program 2 times [2024-06-28 01:15:46,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:15:46,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375902401] [2024-06-28 01:15:46,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:15:46,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:15:46,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:15:46,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-28 01:15:46,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-28 01:15:46,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:46,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-28 01:15:46,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:15:46,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:15:46,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:15:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375902401] [2024-06-28 01:15:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375902401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:46,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461575788] [2024-06-28 01:15:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:46,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:15:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:15:46,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:15:46,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:15:46,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:15:46,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-06-28 01:15:46,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:46,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:15:46,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:46,554 INFO L124 PetriNetUnfolderBase]: 375/739 cut-off events. [2024-06-28 01:15:46,555 INFO L125 PetriNetUnfolderBase]: For 116/126 co-relation queries the response was YES. [2024-06-28 01:15:46,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 739 events. 375/739 cut-off events. For 116/126 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3788 event pairs, 239 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 418. Up to 606 conditions per place. [2024-06-28 01:15:46,558 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 24 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2024-06-28 01:15:46,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 154 flow [2024-06-28 01:15:46,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:15:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:15:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-28 01:15:46,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2024-06-28 01:15:46,559 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 3 states and 61 transitions. [2024-06-28 01:15:46,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 154 flow [2024-06-28 01:15:46,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 148 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 01:15:46,561 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 106 flow [2024-06-28 01:15:46,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2024-06-28 01:15:46,561 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-06-28 01:15:46,562 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 106 flow [2024-06-28 01:15:46,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-06-28 01:15:46,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:46,562 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:46,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-06-28 01:15:46,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:46,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:15:46,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1813222239, now seen corresponding path program 1 times [2024-06-28 01:15:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:15:46,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761803835] [2024-06-28 01:15:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:46,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:46,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:15:46,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:15:46,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-28 01:15:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:46,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-28 01:15:46,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:15:46,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:15:46,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:15:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761803835] [2024-06-28 01:15:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761803835] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:46,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:15:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-06-28 01:15:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785289176] [2024-06-28 01:15:46,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:46,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:15:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:15:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:15:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:15:46,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:15:46,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 106 flow. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-06-28 01:15:46,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:46,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:15:46,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:47,237 INFO L124 PetriNetUnfolderBase]: 575/1024 cut-off events. [2024-06-28 01:15:47,237 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2024-06-28 01:15:47,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 1024 events. 575/1024 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5063 event pairs, 71 based on Foata normal form. 100/976 useless extension candidates. Maximal degree in co-relation 2112. Up to 189 conditions per place. [2024-06-28 01:15:47,241 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 97 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2024-06-28 01:15:47,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 112 transitions, 481 flow [2024-06-28 01:15:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:15:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:15:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-28 01:15:47,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631944444444444 [2024-06-28 01:15:47,243 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 106 flow. Second operand 8 states and 191 transitions. [2024-06-28 01:15:47,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 112 transitions, 481 flow [2024-06-28 01:15:47,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 112 transitions, 477 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:15:47,245 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 122 flow [2024-06-28 01:15:47,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2024-06-28 01:15:47,246 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2024-06-28 01:15:47,246 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 122 flow [2024-06-28 01:15:47,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-06-28 01:15:47,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:47,246 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] [2024-06-28 01:15:47,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-06-28 01:15:47,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:47,453 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:15:47,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1379222949, now seen corresponding path program 1 times [2024-06-28 01:15:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:15:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313002287] [2024-06-28 01:15:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:47,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:47,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:15:47,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:15:47,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-28 01:15:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:47,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-28 01:15:47,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:15:47,561 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:15:47,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:15:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313002287] [2024-06-28 01:15:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313002287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:47,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:15:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126892970] [2024-06-28 01:15:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:47,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:15:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:15:47,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:15:47,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:15:47,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:15:47,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-06-28 01:15:47,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:47,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:15:47,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:47,726 INFO L124 PetriNetUnfolderBase]: 786/1523 cut-off events. [2024-06-28 01:15:47,726 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2024-06-28 01:15:47,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 1523 events. 786/1523 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8796 event pairs, 324 based on Foata normal form. 6/1427 useless extension candidates. Maximal degree in co-relation 3183. Up to 696 conditions per place. [2024-06-28 01:15:47,731 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 43 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-06-28 01:15:47,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 288 flow [2024-06-28 01:15:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:15:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:15:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-28 01:15:47,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2024-06-28 01:15:47,732 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 122 flow. Second operand 3 states and 73 transitions. [2024-06-28 01:15:47,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 288 flow [2024-06-28 01:15:47,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 249 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-28 01:15:47,734 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 113 flow [2024-06-28 01:15:47,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2024-06-28 01:15:47,735 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-06-28 01:15:47,735 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 113 flow [2024-06-28 01:15:47,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-06-28 01:15:47,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:47,735 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-06-28 01:15:47,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-06-28 01:15:47,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:47,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:15:47,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:47,939 INFO L85 PathProgramCache]: Analyzing trace with hash 356190104, now seen corresponding path program 1 times [2024-06-28 01:15:47,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:15:47,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453961200] [2024-06-28 01:15:47,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:47,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:47,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:15:47,940 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:15:47,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-28 01:15:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:48,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-28 01:15:48,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:15:48,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:15:48,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:15:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453961200] [2024-06-28 01:15:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453961200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:48,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:48,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:15:48,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526460295] [2024-06-28 01:15:48,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:15:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:15:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:15:48,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:15:48,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-28 01:15:48,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-06-28 01:15:48,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:48,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-28 01:15:48,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:48,386 INFO L124 PetriNetUnfolderBase]: 1505/2590 cut-off events. [2024-06-28 01:15:48,386 INFO L125 PetriNetUnfolderBase]: For 287/289 co-relation queries the response was YES. [2024-06-28 01:15:48,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2590 events. 1505/2590 cut-off events. For 287/289 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 13571 event pairs, 457 based on Foata normal form. 62/2321 useless extension candidates. Maximal degree in co-relation 5770. Up to 1490 conditions per place. [2024-06-28 01:15:48,394 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 60 selfloop transitions, 3 changer transitions 26/94 dead transitions. [2024-06-28 01:15:48,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 94 transitions, 457 flow [2024-06-28 01:15:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:15:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:15:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 01:15:48,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-28 01:15:48,396 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 113 flow. Second operand 7 states and 133 transitions. [2024-06-28 01:15:48,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 94 transitions, 457 flow [2024-06-28 01:15:48,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 94 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:15:48,398 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 137 flow [2024-06-28 01:15:48,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-06-28 01:15:48,399 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2024-06-28 01:15:48,399 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 137 flow [2024-06-28 01:15:48,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-06-28 01:15:48,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:48,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:48,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-06-28 01:15:48,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:48,605 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:15:48,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1130598002, now seen corresponding path program 1 times [2024-06-28 01:15:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:15:48,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101592708] [2024-06-28 01:15:48,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:48,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:48,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:15:48,607 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:15:48,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-28 01:15:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:48,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-28 01:15:48,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:15:48,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:15:48,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:15:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101592708] [2024-06-28 01:15:48,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101592708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:48,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:48,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955615547] [2024-06-28 01:15:48,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:48,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:15:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:15:48,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:15:48,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:15:48,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:15:48,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06-28 01:15:48,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:48,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:15:48,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:49,023 INFO L124 PetriNetUnfolderBase]: 876/1700 cut-off events. [2024-06-28 01:15:49,024 INFO L125 PetriNetUnfolderBase]: For 903/965 co-relation queries the response was YES. [2024-06-28 01:15:49,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 1700 events. 876/1700 cut-off events. For 903/965 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9497 event pairs, 727 based on Foata normal form. 25/1602 useless extension candidates. Maximal degree in co-relation 3975. Up to 1365 conditions per place. [2024-06-28 01:15:49,030 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 30 selfloop transitions, 2 changer transitions 18/58 dead transitions. [2024-06-28 01:15:49,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 299 flow [2024-06-28 01:15:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:15:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:15:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-06-28 01:15:49,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-28 01:15:49,032 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 137 flow. Second operand 4 states and 85 transitions. [2024-06-28 01:15:49,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 299 flow [2024-06-28 01:15:49,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 289 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 01:15:49,074 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 141 flow [2024-06-28 01:15:49,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-28 01:15:49,075 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2024-06-28 01:15:49,075 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 141 flow [2024-06-28 01:15:49,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06-28 01:15:49,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:49,075 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] [2024-06-28 01:15:49,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-06-28 01:15:49,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:49,276 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:15:49,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash -118228549, now seen corresponding path program 1 times [2024-06-28 01:15:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:15:49,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97342654] [2024-06-28 01:15:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:15:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:15:49,279 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:15:49,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-28 01:15:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:49,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-28 01:15:49,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:50,069 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-06-28 01:15:50,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 286 [2024-06-28 01:15:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:50,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:16:00,780 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 394 DAG size of output: 346 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-28 01:16:00,783 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-06-28 01:16:00,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 269 treesize of output 1571 [2024-06-28 01:16:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:16:03,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:16:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97342654] [2024-06-28 01:16:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97342654] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:16:03,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:16:03,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-06-28 01:16:03,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755634231] [2024-06-28 01:16:03,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:16:03,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-28 01:16:03,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:16:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-28 01:16:03,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2024-06-28 01:16:08,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:16:12,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:16:17,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:16:21,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:16:25,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:16:25,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:16:25,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 141 flow. Second operand has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 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-06-28 01:16:25,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:16:25,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:16:25,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:16:28,341 INFO L124 PetriNetUnfolderBase]: 2238/3793 cut-off events. [2024-06-28 01:16:28,341 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2024-06-28 01:16:28,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9297 conditions, 3793 events. 2238/3793 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 20268 event pairs, 176 based on Foata normal form. 5/3595 useless extension candidates. Maximal degree in co-relation 9277. Up to 1084 conditions per place. [2024-06-28 01:16:28,353 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 101 selfloop transitions, 10 changer transitions 4/120 dead transitions. [2024-06-28 01:16:28,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 120 transitions, 625 flow [2024-06-28 01:16:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:16:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:16:28,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 01:16:28,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-28 01:16:28,356 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 141 flow. Second operand 9 states and 152 transitions. [2024-06-28 01:16:28,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 120 transitions, 625 flow [2024-06-28 01:16:28,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 120 transitions, 619 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:16:28,359 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 206 flow [2024-06-28 01:16:28,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=206, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-06-28 01:16:28,360 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2024-06-28 01:16:28,360 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 206 flow [2024-06-28 01:16:28,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 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-06-28 01:16:28,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:16:28,360 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2024-06-28 01:16:28,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-06-28 01:16:28,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:28,565 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:16:28,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:16:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1127819688, now seen corresponding path program 2 times [2024-06-28 01:16:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:16:28,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491136619] [2024-06-28 01:16:28,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:16:28,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:28,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:16:28,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:16:28,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-28 01:16:28,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:16:28,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:16:28,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2024-06-28 01:16:28,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:16:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:16:29,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:16:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:16:30,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:16:30,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491136619] [2024-06-28 01:16:30,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491136619] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:16:30,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:16:30,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-06-28 01:16:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6556838] [2024-06-28 01:16:30,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:16:30,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-28 01:16:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:16:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-28 01:16:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-06-28 01:16:31,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-28 01:16:31,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 206 flow. Second operand has 15 states, 15 states have (on average 12.4) internal successors, (186), 15 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:16:31,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:16:31,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-28 01:16:31,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:16:36,833 INFO L124 PetriNetUnfolderBase]: 6127/10610 cut-off events. [2024-06-28 01:16:36,833 INFO L125 PetriNetUnfolderBase]: For 6687/6687 co-relation queries the response was YES. [2024-06-28 01:16:36,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29960 conditions, 10610 events. 6127/10610 cut-off events. For 6687/6687 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 70581 event pairs, 1328 based on Foata normal form. 286/10428 useless extension candidates. Maximal degree in co-relation 18862. Up to 1874 conditions per place. [2024-06-28 01:16:36,877 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 241 selfloop transitions, 39 changer transitions 19/304 dead transitions. [2024-06-28 01:16:36,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 304 transitions, 1850 flow [2024-06-28 01:16:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-06-28 01:16:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-06-28 01:16:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 431 transitions. [2024-06-28 01:16:36,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988425925925926 [2024-06-28 01:16:36,879 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 206 flow. Second operand 24 states and 431 transitions. [2024-06-28 01:16:36,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 304 transitions, 1850 flow [2024-06-28 01:16:36,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 304 transitions, 1824 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-28 01:16:36,896 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 549 flow [2024-06-28 01:16:36,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=549, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2024-06-28 01:16:36,897 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2024-06-28 01:16:36,897 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 549 flow [2024-06-28 01:16:36,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.4) internal successors, (186), 15 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:16:36,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:16:36,898 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2024-06-28 01:16:36,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-06-28 01:16:37,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:37,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:16:37,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:16:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1274851317, now seen corresponding path program 3 times [2024-06-28 01:16:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:16:37,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123914363] [2024-06-28 01:16:37,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-28 01:16:37,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:16:37,106 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:16:37,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-06-28 01:16:37,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-28 01:16:37,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:16:37,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-28 01:16:37,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:16:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:16:38,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:16:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:16:39,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:16:39,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123914363] [2024-06-28 01:16:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123914363] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:16:39,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:16:39,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-06-28 01:16:39,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629831050] [2024-06-28 01:16:39,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:16:39,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-28 01:16:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:16:39,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-28 01:16:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-06-28 01:16:40,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:16:40,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 549 flow. Second operand has 14 states, 14 states have (on average 15.214285714285714) internal successors, (213), 14 states have internal predecessors, (213), 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-06-28 01:16:40,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:16:40,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:16:40,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:16:43,724 INFO L124 PetriNetUnfolderBase]: 6215/12065 cut-off events. [2024-06-28 01:16:43,724 INFO L125 PetriNetUnfolderBase]: For 19965/20397 co-relation queries the response was YES. [2024-06-28 01:16:43,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40133 conditions, 12065 events. 6215/12065 cut-off events. For 19965/20397 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 98301 event pairs, 1459 based on Foata normal form. 355/11880 useless extension candidates. Maximal degree in co-relation 22527. Up to 2051 conditions per place. [2024-06-28 01:16:43,808 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 198 selfloop transitions, 42 changer transitions 11/262 dead transitions. [2024-06-28 01:16:43,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 262 transitions, 1872 flow [2024-06-28 01:16:43,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:16:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:16:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 278 transitions. [2024-06-28 01:16:43,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6435185185185185 [2024-06-28 01:16:43,811 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 549 flow. Second operand 12 states and 278 transitions. [2024-06-28 01:16:43,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 262 transitions, 1872 flow [2024-06-28 01:16:43,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 262 transitions, 1740 flow, removed 65 selfloop flow, removed 1 redundant places. [2024-06-28 01:16:43,895 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 721 flow [2024-06-28 01:16:43,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=721, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2024-06-28 01:16:43,896 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 64 predicate places. [2024-06-28 01:16:43,896 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 721 flow [2024-06-28 01:16:43,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.214285714285714) internal successors, (213), 14 states have internal predecessors, (213), 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-06-28 01:16:43,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:16:43,897 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] [2024-06-28 01:16:43,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-06-28 01:16:44,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:44,101 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:16:44,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:16:44,102 INFO L85 PathProgramCache]: Analyzing trace with hash 993356994, now seen corresponding path program 4 times [2024-06-28 01:16:44,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:16:44,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897710399] [2024-06-28 01:16:44,102 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-28 01:16:44,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:44,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:16:44,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:16:44,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-06-28 01:16:44,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-28 01:16:44,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:16:44,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-28 01:16:44,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:16:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:16:44,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:16:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:16:45,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:16:45,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897710399] [2024-06-28 01:16:45,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897710399] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:16:45,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:16:45,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-06-28 01:16:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507701283] [2024-06-28 01:16:45,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:16:45,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:16:45,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:16:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:16:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:16:45,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:16:45,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 721 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-06-28 01:16:45,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:16:45,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:16:45,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:16:47,276 INFO L124 PetriNetUnfolderBase]: 5519/10984 cut-off events. [2024-06-28 01:16:47,276 INFO L125 PetriNetUnfolderBase]: For 18957/19108 co-relation queries the response was YES. [2024-06-28 01:16:47,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36910 conditions, 10984 events. 5519/10984 cut-off events. For 18957/19108 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 88238 event pairs, 3905 based on Foata normal form. 33/10517 useless extension candidates. Maximal degree in co-relation 21385. Up to 8651 conditions per place. [2024-06-28 01:16:47,338 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 76 selfloop transitions, 3 changer transitions 47/135 dead transitions. [2024-06-28 01:16:47,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 135 transitions, 1045 flow [2024-06-28 01:16:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:16:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:16:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-28 01:16:47,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-28 01:16:47,340 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 721 flow. Second operand 6 states and 126 transitions. [2024-06-28 01:16:47,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 135 transitions, 1045 flow [2024-06-28 01:16:47,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 135 transitions, 1026 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 01:16:47,393 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 563 flow [2024-06-28 01:16:47,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=563, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-06-28 01:16:47,394 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 63 predicate places. [2024-06-28 01:16:47,394 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 563 flow [2024-06-28 01:16:47,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-06-28 01:16:47,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:16:47,394 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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] [2024-06-28 01:16:47,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-06-28 01:16:47,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:47,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:16:47,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:16:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1615312619, now seen corresponding path program 5 times [2024-06-28 01:16:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:16:47,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147429250] [2024-06-28 01:16:47,599 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-28 01:16:47,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:16:47,600 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:16:47,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-06-28 01:16:47,765 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-28 01:16:47,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:16:47,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-28 01:16:47,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:16:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-28 01:16:48,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:16:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-28 01:16:49,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:16:49,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147429250] [2024-06-28 01:16:49,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147429250] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:16:49,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:16:49,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2024-06-28 01:16:49,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873086532] [2024-06-28 01:16:49,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:16:49,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-28 01:16:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:16:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-28 01:16:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-06-28 01:16:49,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:16:49,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 563 flow. Second operand has 15 states, 15 states have (on average 11.266666666666667) internal successors, (169), 15 states have internal predecessors, (169), 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-06-28 01:16:49,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:16:49,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:16:49,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:16:53,770 INFO L124 PetriNetUnfolderBase]: 9654/16520 cut-off events. [2024-06-28 01:16:53,770 INFO L125 PetriNetUnfolderBase]: For 23308/23308 co-relation queries the response was YES. [2024-06-28 01:16:53,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54393 conditions, 16520 events. 9654/16520 cut-off events. For 23308/23308 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 114367 event pairs, 505 based on Foata normal form. 1099/16866 useless extension candidates. Maximal degree in co-relation 54354. Up to 5694 conditions per place. [2024-06-28 01:16:53,843 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 184 selfloop transitions, 41 changer transitions 52/282 dead transitions. [2024-06-28 01:16:53,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 282 transitions, 2277 flow [2024-06-28 01:16:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-28 01:16:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-28 01:16:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 284 transitions. [2024-06-28 01:16:53,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-06-28 01:16:53,846 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 563 flow. Second operand 18 states and 284 transitions. [2024-06-28 01:16:53,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 282 transitions, 2277 flow [2024-06-28 01:16:53,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 282 transitions, 2235 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 01:16:53,964 INFO L231 Difference]: Finished difference. Result has 111 places, 112 transitions, 892 flow [2024-06-28 01:16:53,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=892, PETRI_PLACES=111, PETRI_TRANSITIONS=112} [2024-06-28 01:16:53,965 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 76 predicate places. [2024-06-28 01:16:53,965 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 112 transitions, 892 flow [2024-06-28 01:16:53,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.266666666666667) internal successors, (169), 15 states have internal predecessors, (169), 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-06-28 01:16:53,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:16:53,965 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2024-06-28 01:16:53,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-06-28 01:16:54,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:54,169 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:16:54,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:16:54,170 INFO L85 PathProgramCache]: Analyzing trace with hash 939195715, now seen corresponding path program 6 times [2024-06-28 01:16:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:16:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149406781] [2024-06-28 01:16:54,170 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-28 01:16:54,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:16:54,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:16:54,171 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:16:54,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-06-28 01:16:54,348 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-28 01:16:54,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:16:54,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjunts are in the unsatisfiable core [2024-06-28 01:16:54,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:17:02,188 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 263 DAG size of output: 207 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-28 01:17:02,188 INFO L349 Elim1Store]: treesize reduction 268, result has 79.7 percent of original size [2024-06-28 01:17:02,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 298 treesize of output 1112 [2024-06-28 01:17:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-28 01:17:05,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:18:57,257 WARN L293 SmtUtils]: Spent 22.68s on a formula simplification. DAG size of input: 779 DAG size of output: 513 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-28 01:18:57,258 INFO L349 Elim1Store]: treesize reduction 1085, result has 70.2 percent of original size [2024-06-28 01:18:57,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 346 treesize of output 2619 [2024-06-28 01:19:26,183 WARN L293 SmtUtils]: Spent 15.21s on a formula simplification. DAG size of input: 843 DAG size of output: 401 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-28 01:19:26,183 INFO L349 Elim1Store]: treesize reduction 1986, result has 46.0 percent of original size [2024-06-28 01:19:26,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 332 treesize of output 1754 [2024-06-28 01:19:35,650 WARN L293 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 326 DAG size of output: 252 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-28 01:19:35,650 INFO L349 Elim1Store]: treesize reduction 324, result has 78.2 percent of original size [2024-06-28 01:19:35,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 260 treesize of output 1213 [2024-06-28 01:19:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-28 01:19:40,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:19:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149406781] [2024-06-28 01:19:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149406781] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:19:40,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:19:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2024-06-28 01:19:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025094544] [2024-06-28 01:19:40,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:19:40,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-06-28 01:19:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:19:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-06-28 01:19:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=476, Unknown=18, NotChecked=0, Total=600 [2024-06-28 01:19:44,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-06-28 01:19:48,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-06-28 01:19:52,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-06-28 01:19:56,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-06-28 01:20:00,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-06-28 01:20:00,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:20:00,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 892 flow. Second operand has 25 states, 25 states have (on average 9.64) internal successors, (241), 25 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:20:00,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:20:00,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:20:00,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:20:07,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-06-28 01:20:28,670 WARN L293 SmtUtils]: Spent 16.13s on a formula simplification. DAG size of input: 124 DAG size of output: 108 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-28 01:20:32,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:20:36,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:21:13,607 WARN L293 SmtUtils]: Spent 32.22s on a formula simplification. DAG size of input: 133 DAG size of output: 129 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-28 01:21:17,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:21:22,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:21:26,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15