./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/triangular-longer-2.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/pthread/triangular-longer-2.i ./goblint.2024-06-19_11-23-25.files/protection/triangular-longer-2.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-27 18:08:51,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:08:51,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:08:51,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:08:51,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:08:51,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:08:51,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:08:51,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:08:51,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:08:51,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:08:51,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:08:51,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:08:51,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:08:51,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:08:51,406 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:08:51,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:08:51,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:08:51,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:08:51,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:08:51,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:08:51,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:08:51,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:08:51,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:08:51,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:08:51,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:08:51,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:08:51,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:08:51,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:08:51,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:08:51,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:08:51,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:08:51,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:08:51,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:08:51,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:08:51,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:08:51,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:08:51,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:08:51,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:08:51,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:08:51,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:08:51,415 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:08:51,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:08:51,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:08:51,416 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-27 18:08:51,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:08:51,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:08:51,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:08:51,767 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:08:51,769 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:08:51,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/triangular-longer-2.yml/witness.yml [2024-06-27 18:08:51,844 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:08:51,845 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:08:51,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-06-27 18:08:53,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:08:53,384 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:08:53,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-06-27 18:08:53,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95330096e/f4bd1146be394b059df09880fe49ec24/FLAG7b86ee229 [2024-06-27 18:08:53,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95330096e/f4bd1146be394b059df09880fe49ec24 [2024-06-27 18:08:53,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:08:53,429 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:08:53,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:08:53,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:08:53,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:08:53,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:08:51" (1/2) ... [2024-06-27 18:08:53,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700325e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:08:53, skipping insertion in model container [2024-06-27 18:08:53,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:08:51" (1/2) ... [2024-06-27 18:08:53,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1bdfd70f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:08:53, skipping insertion in model container [2024-06-27 18:08:53,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:08:53" (2/2) ... [2024-06-27 18:08:53,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700325e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:53, skipping insertion in model container [2024-06-27 18:08:53,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:08:53" (2/2) ... [2024-06-27 18:08:53,445 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:08:53,476 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:08:53,477 INFO L97 edCorrectnessWitness]: Location invariant before [L715-L715] (! multithreaded || (4 <= j && j % 2 == 0)) && (! multithreaded || (3 <= i && i % 2 == 1)) [2024-06-27 18:08:53,477 INFO L97 edCorrectnessWitness]: Location invariant before [L714-L714] (! multithreaded || (4 <= j && j % 2 == 0)) && (! multithreaded || (3 <= i && i % 2 == 1)) [2024-06-27 18:08:53,477 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:08:53,477 INFO L106 edCorrectnessWitness]: ghost_update [L713-L713] multithreaded = 1; [2024-06-27 18:08:53,528 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:08:53,921 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-06-27 18:08:53,926 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:08:53,934 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:08:54,022 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-06-27 18:08:54,023 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:08:54,061 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:08:54,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54 WrapperNode [2024-06-27 18:08:54,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:08:54,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:08:54,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:08:54,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:08:54,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,098 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-06-27 18:08:54,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:08:54,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:08:54,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:08:54,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:08:54,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,126 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 18:08:54,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:08:54,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:08:54,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:08:54,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:08:54,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (1/1) ... [2024-06-27 18:08:54,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:08:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:08:54,201 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-27 18:08:54,250 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-27 18:08:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 18:08:54,288 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 18:08:54,288 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 18:08:54,289 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 18:08:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:08:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:08:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:08:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:08:54,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:08:54,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:08:54,291 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:08:54,441 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:08:54,444 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:08:54,621 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:08:54,621 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:08:54,696 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:08:54,696 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 18:08:54,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:08:54 BoogieIcfgContainer [2024-06-27 18:08:54,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:08:54,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:08:54,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:08:54,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:08:54,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:08:51" (1/4) ... [2024-06-27 18:08:54,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a43c3a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:08:54, skipping insertion in model container [2024-06-27 18:08:54,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:08:53" (2/4) ... [2024-06-27 18:08:54,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a43c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:08:54, skipping insertion in model container [2024-06-27 18:08:54,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:08:54" (3/4) ... [2024-06-27 18:08:54,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a43c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:08:54, skipping insertion in model container [2024-06-27 18:08:54,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:08:54" (4/4) ... [2024-06-27 18:08:54,704 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2024-06-27 18:08:54,721 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:08:54,721 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 18:08:54,721 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:08:54,766 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 18:08:54,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 66 flow [2024-06-27 18:08:54,828 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-06-27 18:08:54,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:08:54,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-06-27 18:08:54,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 66 flow [2024-06-27 18:08:54,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 60 flow [2024-06-27 18:08:54,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:08:54,847 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;@9b3ff94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:08:54,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 18:08:54,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:08:54,850 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:08:54,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:08:54,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:54,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:08:54,851 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-27 18:08:54,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash 176651994, now seen corresponding path program 1 times [2024-06-27 18:08:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480825245] [2024-06-27 18:08:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:54,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:55,529 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-27 18:08:55,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480825245] [2024-06-27 18:08:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480825245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:55,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:55,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:08:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853436818] [2024-06-27 18:08:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:55,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:08:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:55,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:08:55,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:08:55,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-27 18:08:55,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-27 18:08:55,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:55,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-27 18:08:55,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:55,731 INFO L124 PetriNetUnfolderBase]: 172/337 cut-off events. [2024-06-27 18:08:55,731 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 18:08:55,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 337 events. 172/337 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1436 event pairs, 45 based on Foata normal form. 20/331 useless extension candidates. Maximal degree in co-relation 625. Up to 211 conditions per place. [2024-06-27 18:08:55,735 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 23 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2024-06-27 18:08:55,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 139 flow [2024-06-27 18:08:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:08:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:08:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-27 18:08:55,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2024-06-27 18:08:55,749 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 60 flow. Second operand 3 states and 65 transitions. [2024-06-27 18:08:55,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 139 flow [2024-06-27 18:08:55,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:08:55,754 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 75 flow [2024-06-27 18:08:55,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-06-27 18:08:55,759 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-27 18:08:55,759 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 75 flow [2024-06-27 18:08:55,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-27 18:08:55,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:55,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:55,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:08:55,761 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-27 18:08:55,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:55,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1314428841, now seen corresponding path program 1 times [2024-06-27 18:08:55,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:55,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371976720] [2024-06-27 18:08:55,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:55,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:56,033 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-27 18:08:56,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:56,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371976720] [2024-06-27 18:08:56,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371976720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:56,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:56,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:08:56,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327709581] [2024-06-27 18:08:56,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:56,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:08:56,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:08:56,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:08:56,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-27 18:08:56,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-27 18:08:56,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:56,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-27 18:08:56,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:56,197 INFO L124 PetriNetUnfolderBase]: 160/331 cut-off events. [2024-06-27 18:08:56,197 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-06-27 18:08:56,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 331 events. 160/331 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1438 event pairs, 37 based on Foata normal form. 21/342 useless extension candidates. Maximal degree in co-relation 697. Up to 109 conditions per place. [2024-06-27 18:08:56,209 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2024-06-27 18:08:56,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 199 flow [2024-06-27 18:08:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:08:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:08:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-27 18:08:56,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6620689655172414 [2024-06-27 18:08:56,211 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 75 flow. Second operand 5 states and 96 transitions. [2024-06-27 18:08:56,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 199 flow [2024-06-27 18:08:56,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:08:56,218 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 98 flow [2024-06-27 18:08:56,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-27 18:08:56,220 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-27 18:08:56,221 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 98 flow [2024-06-27 18:08:56,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-27 18:08:56,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:56,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:56,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:08:56,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:08:56,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1917013662, now seen corresponding path program 1 times [2024-06-27 18:08:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640575977] [2024-06-27 18:08:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:56,409 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-27 18:08:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:56,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640575977] [2024-06-27 18:08:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640575977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:56,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:56,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:08:56,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470017156] [2024-06-27 18:08:56,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:56,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:08:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:08:56,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:08:56,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:56,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-27 18:08:56,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:56,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:56,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:56,562 INFO L124 PetriNetUnfolderBase]: 244/502 cut-off events. [2024-06-27 18:08:56,562 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2024-06-27 18:08:56,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 502 events. 244/502 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2451 event pairs, 88 based on Foata normal form. 18/504 useless extension candidates. Maximal degree in co-relation 1117. Up to 255 conditions per place. [2024-06-27 18:08:56,570 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 27 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2024-06-27 18:08:56,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 184 flow [2024-06-27 18:08:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:08:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:08:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-27 18:08:56,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2024-06-27 18:08:56,572 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 98 flow. Second operand 5 states and 74 transitions. [2024-06-27 18:08:56,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 184 flow [2024-06-27 18:08:56,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:08:56,576 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 103 flow [2024-06-27 18:08:56,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2024-06-27 18:08:56,577 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-27 18:08:56,578 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 103 flow [2024-06-27 18:08:56,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-27 18:08:56,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:56,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:56,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:08:56,579 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-27 18:08:56,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 344931938, now seen corresponding path program 1 times [2024-06-27 18:08:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846716729] [2024-06-27 18:08:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:56,703 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-27 18:08:56,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846716729] [2024-06-27 18:08:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846716729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:56,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:08:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128163167] [2024-06-27 18:08:56,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:56,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:08:56,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:08:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:08:56,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:56,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-27 18:08:56,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:56,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:56,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:56,876 INFO L124 PetriNetUnfolderBase]: 532/914 cut-off events. [2024-06-27 18:08:56,877 INFO L125 PetriNetUnfolderBase]: For 795/795 co-relation queries the response was YES. [2024-06-27 18:08:56,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 914 events. 532/914 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4083 event pairs, 145 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 2252. Up to 397 conditions per place. [2024-06-27 18:08:56,882 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 6 changer transitions 24/65 dead transitions. [2024-06-27 18:08:56,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 366 flow [2024-06-27 18:08:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:08:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:08:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-27 18:08:56,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-06-27 18:08:56,884 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 103 flow. Second operand 6 states and 106 transitions. [2024-06-27 18:08:56,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 366 flow [2024-06-27 18:08:56,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 359 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 18:08:56,886 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 137 flow [2024-06-27 18:08:56,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2024-06-27 18:08:56,887 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-27 18:08:56,887 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 137 flow [2024-06-27 18:08:56,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-27 18:08:56,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:56,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:56,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:08:56,888 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-27 18:08:56,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2107222436, now seen corresponding path program 1 times [2024-06-27 18:08:56,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:56,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107207887] [2024-06-27 18:08:56,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:56,976 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-27 18:08:56,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:56,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107207887] [2024-06-27 18:08:56,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107207887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:56,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:56,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:08:56,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553990359] [2024-06-27 18:08:56,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:56,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:08:56,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:56,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:08:56,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:08:57,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:57,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-27 18:08:57,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:57,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:57,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:57,232 INFO L124 PetriNetUnfolderBase]: 496/889 cut-off events. [2024-06-27 18:08:57,232 INFO L125 PetriNetUnfolderBase]: For 980/980 co-relation queries the response was YES. [2024-06-27 18:08:57,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 889 events. 496/889 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4135 event pairs, 136 based on Foata normal form. 27/909 useless extension candidates. Maximal degree in co-relation 2404. Up to 373 conditions per place. [2024-06-27 18:08:57,238 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 10 changer transitions 24/89 dead transitions. [2024-06-27 18:08:57,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 511 flow [2024-06-27 18:08:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:08:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:08:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 18:08:57,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.593103448275862 [2024-06-27 18:08:57,240 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 137 flow. Second operand 10 states and 172 transitions. [2024-06-27 18:08:57,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 511 flow [2024-06-27 18:08:57,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 494 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 18:08:57,245 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 201 flow [2024-06-27 18:08:57,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=201, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2024-06-27 18:08:57,246 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-06-27 18:08:57,246 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 201 flow [2024-06-27 18:08:57,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-27 18:08:57,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:57,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:57,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:08:57,247 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-27 18:08:57,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1447649696, now seen corresponding path program 2 times [2024-06-27 18:08:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218496973] [2024-06-27 18:08:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:57,320 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-27 18:08:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:57,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218496973] [2024-06-27 18:08:57,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218496973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:57,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:57,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:08:57,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980982688] [2024-06-27 18:08:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:57,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:08:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:08:57,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:08:57,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:57,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-27 18:08:57,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:57,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:57,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:57,520 INFO L124 PetriNetUnfolderBase]: 442/805 cut-off events. [2024-06-27 18:08:57,520 INFO L125 PetriNetUnfolderBase]: For 1997/1997 co-relation queries the response was YES. [2024-06-27 18:08:57,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 805 events. 442/805 cut-off events. For 1997/1997 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3612 event pairs, 160 based on Foata normal form. 27/825 useless extension candidates. Maximal degree in co-relation 2515. Up to 442 conditions per place. [2024-06-27 18:08:57,525 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 41 selfloop transitions, 13 changer transitions 27/86 dead transitions. [2024-06-27 18:08:57,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 606 flow [2024-06-27 18:08:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 18:08:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 18:08:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-27 18:08:57,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.578544061302682 [2024-06-27 18:08:57,527 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 201 flow. Second operand 9 states and 151 transitions. [2024-06-27 18:08:57,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 606 flow [2024-06-27 18:08:57,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 583 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 18:08:57,534 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 313 flow [2024-06-27 18:08:57,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=313, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-06-27 18:08:57,535 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-27 18:08:57,535 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 313 flow [2024-06-27 18:08:57,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-27 18:08:57,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:57,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:57,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:08:57,536 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-27 18:08:57,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1033578543, now seen corresponding path program 1 times [2024-06-27 18:08:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:57,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41710457] [2024-06-27 18:08:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:57,639 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-27 18:08:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41710457] [2024-06-27 18:08:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41710457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:08:57,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:08:57,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 18:08:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719004319] [2024-06-27 18:08:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:08:57,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:08:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:08:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:08:57,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:57,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-27 18:08:57,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:57,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:57,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:57,888 INFO L124 PetriNetUnfolderBase]: 424/785 cut-off events. [2024-06-27 18:08:57,888 INFO L125 PetriNetUnfolderBase]: For 2720/2720 co-relation queries the response was YES. [2024-06-27 18:08:57,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 785 events. 424/785 cut-off events. For 2720/2720 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3432 event pairs, 76 based on Foata normal form. 27/799 useless extension candidates. Maximal degree in co-relation 2639. Up to 223 conditions per place. [2024-06-27 18:08:57,893 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 43 selfloop transitions, 19 changer transitions 28/95 dead transitions. [2024-06-27 18:08:57,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 740 flow [2024-06-27 18:08:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 18:08:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 18:08:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 18:08:57,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5724137931034483 [2024-06-27 18:08:57,895 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 313 flow. Second operand 10 states and 166 transitions. [2024-06-27 18:08:57,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 740 flow [2024-06-27 18:08:57,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 717 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-27 18:08:57,905 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 403 flow [2024-06-27 18:08:57,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2024-06-27 18:08:57,906 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-27 18:08:57,906 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 403 flow [2024-06-27 18:08:57,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-27 18:08:57,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:57,906 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:57,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:08:57,907 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-27 18:08:57,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1338349260, now seen corresponding path program 1 times [2024-06-27 18:08:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:57,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972488159] [2024-06-27 18:08:57,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:58,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:58,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972488159] [2024-06-27 18:08:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972488159] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:08:58,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373725420] [2024-06-27 18:08:58,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:58,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:08:58,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:08:58,005 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-27 18:08:58,023 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-27 18:08:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:58,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 18:08:58,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:08:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:58,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:08:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:08:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373725420] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:08:58,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:08:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-06-27 18:08:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628873016] [2024-06-27 18:08:58,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:08:58,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 18:08:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 18:08:58,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-06-27 18:08:58,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:58,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 403 flow. Second operand has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:08:58,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:58,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:58,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:08:58,801 INFO L124 PetriNetUnfolderBase]: 640/1166 cut-off events. [2024-06-27 18:08:58,802 INFO L125 PetriNetUnfolderBase]: For 6513/6513 co-relation queries the response was YES. [2024-06-27 18:08:58,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4352 conditions, 1166 events. 640/1166 cut-off events. For 6513/6513 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5223 event pairs, 64 based on Foata normal form. 45/1198 useless extension candidates. Maximal degree in co-relation 4316. Up to 265 conditions per place. [2024-06-27 18:08:58,810 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 65 selfloop transitions, 34 changer transitions 56/160 dead transitions. [2024-06-27 18:08:58,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 160 transitions, 1351 flow [2024-06-27 18:08:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 18:08:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 18:08:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 313 transitions. [2024-06-27 18:08:58,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5680580762250453 [2024-06-27 18:08:58,812 INFO L175 Difference]: Start difference. First operand has 70 places, 46 transitions, 403 flow. Second operand 19 states and 313 transitions. [2024-06-27 18:08:58,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 160 transitions, 1351 flow [2024-06-27 18:08:58,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 160 transitions, 1262 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-27 18:08:58,836 INFO L231 Difference]: Finished difference. Result has 87 places, 62 transitions, 701 flow [2024-06-27 18:08:58,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=701, PETRI_PLACES=87, PETRI_TRANSITIONS=62} [2024-06-27 18:08:58,836 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-27 18:08:58,837 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 62 transitions, 701 flow [2024-06-27 18:08:58,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:08:58,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:08:58,837 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:08:58,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 18:08:59,052 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-27 18:08:59,053 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-27 18:08:59,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:08:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -768213302, now seen corresponding path program 1 times [2024-06-27 18:08:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:08:59,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438963852] [2024-06-27 18:08:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:08:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:08:59,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:08:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438963852] [2024-06-27 18:08:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438963852] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:08:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435255012] [2024-06-27 18:08:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:08:59,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:08:59,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:08:59,191 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-27 18:08:59,214 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-27 18:08:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:08:59,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 18:08:59,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:08:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:08:59,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:08:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:08:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435255012] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:08:59,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:08:59,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-27 18:08:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321411417] [2024-06-27 18:08:59,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:08:59,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 18:08:59,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:08:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 18:08:59,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-06-27 18:08:59,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:08:59,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 62 transitions, 701 flow. Second operand has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 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-27 18:08:59,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:08:59,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:08:59,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:09:00,555 INFO L124 PetriNetUnfolderBase]: 1324/2454 cut-off events. [2024-06-27 18:09:00,556 INFO L125 PetriNetUnfolderBase]: For 21518/21518 co-relation queries the response was YES. [2024-06-27 18:09:00,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10496 conditions, 2454 events. 1324/2454 cut-off events. For 21518/21518 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12878 event pairs, 136 based on Foata normal form. 81/2528 useless extension candidates. Maximal degree in co-relation 10455. Up to 589 conditions per place. [2024-06-27 18:09:00,574 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 128 selfloop transitions, 67 changer transitions 91/291 dead transitions. [2024-06-27 18:09:00,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 291 transitions, 3146 flow [2024-06-27 18:09:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-06-27 18:09:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-06-27 18:09:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 523 transitions. [2024-06-27 18:09:00,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5635775862068966 [2024-06-27 18:09:00,577 INFO L175 Difference]: Start difference. First operand has 87 places, 62 transitions, 701 flow. Second operand 32 states and 523 transitions. [2024-06-27 18:09:00,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 291 transitions, 3146 flow [2024-06-27 18:09:00,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 291 transitions, 2379 flow, removed 364 selfloop flow, removed 11 redundant places. [2024-06-27 18:09:00,615 INFO L231 Difference]: Finished difference. Result has 125 places, 108 transitions, 1226 flow [2024-06-27 18:09:00,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1226, PETRI_PLACES=125, PETRI_TRANSITIONS=108} [2024-06-27 18:09:00,616 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-27 18:09:00,617 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 108 transitions, 1226 flow [2024-06-27 18:09:00,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 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-27 18:09:00,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:09:00,617 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:00,635 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-27 18:09:00,832 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-27 18:09:00,833 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-27 18:09:00,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:09:00,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1478704196, now seen corresponding path program 2 times [2024-06-27 18:09:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:09:00,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071460648] [2024-06-27 18:09:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:09:00,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:09:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:09:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:00,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:09:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071460648] [2024-06-27 18:09:00,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071460648] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:09:00,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368870592] [2024-06-27 18:09:00,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 18:09:00,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:09:00,964 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-27 18:09:00,979 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-27 18:09:01,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 18:09:01,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:09:01,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 18:09:01,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:09:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:01,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:09:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368870592] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:09:01,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:09:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-27 18:09:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562478034] [2024-06-27 18:09:01,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:09:01,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 18:09:01,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:09:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 18:09:01,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-06-27 18:09:01,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:09:01,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 108 transitions, 1226 flow. Second operand has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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-27 18:09:01,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:09:01,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:09:01,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:09:02,477 INFO L124 PetriNetUnfolderBase]: 1918/3533 cut-off events. [2024-06-27 18:09:02,478 INFO L125 PetriNetUnfolderBase]: For 85928/85928 co-relation queries the response was YES. [2024-06-27 18:09:02,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18144 conditions, 3533 events. 1918/3533 cut-off events. For 85928/85928 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 20248 event pairs, 112 based on Foata normal form. 117/3643 useless extension candidates. Maximal degree in co-relation 18086. Up to 715 conditions per place. [2024-06-27 18:09:02,508 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 132 selfloop transitions, 114 changer transitions 113/364 dead transitions. [2024-06-27 18:09:02,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 364 transitions, 4687 flow [2024-06-27 18:09:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-06-27 18:09:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-06-27 18:09:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 572 transitions. [2024-06-27 18:09:02,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5635467980295567 [2024-06-27 18:09:02,515 INFO L175 Difference]: Start difference. First operand has 125 places, 108 transitions, 1226 flow. Second operand 35 states and 572 transitions. [2024-06-27 18:09:02,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 364 transitions, 4687 flow [2024-06-27 18:09:02,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 364 transitions, 4051 flow, removed 304 selfloop flow, removed 14 redundant places. [2024-06-27 18:09:02,709 INFO L231 Difference]: Finished difference. Result has 158 places, 155 transitions, 2129 flow [2024-06-27 18:09:02,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2129, PETRI_PLACES=158, PETRI_TRANSITIONS=155} [2024-06-27 18:09:02,710 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-27 18:09:02,710 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 155 transitions, 2129 flow [2024-06-27 18:09:02,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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-27 18:09:02,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:09:02,710 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:02,734 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-27 18:09:02,910 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-27 18:09:02,911 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-27 18:09:02,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:09:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1924986963, now seen corresponding path program 3 times [2024-06-27 18:09:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:09:02,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338277419] [2024-06-27 18:09:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:09:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:09:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:09:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:09:03,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:09:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338277419] [2024-06-27 18:09:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338277419] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:09:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117230111] [2024-06-27 18:09:03,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 18:09:03,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:09:03,204 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-27 18:09:03,221 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-27 18:09:03,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-06-27 18:09:03,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:09:03,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-27 18:09:03,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:09:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:09:03,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:09:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:09:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117230111] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:09:03,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:09:03,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-06-27 18:09:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944730776] [2024-06-27 18:09:03,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:09:03,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-06-27 18:09:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:09:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-06-27 18:09:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2024-06-27 18:09:03,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:09:03,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 2129 flow. Second operand has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 26 states have internal predecessors, (289), 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-27 18:09:03,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:09:03,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:09:03,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:09:05,992 INFO L124 PetriNetUnfolderBase]: 3241/5883 cut-off events. [2024-06-27 18:09:05,992 INFO L125 PetriNetUnfolderBase]: For 240073/240073 co-relation queries the response was YES. [2024-06-27 18:09:06,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37393 conditions, 5883 events. 3241/5883 cut-off events. For 240073/240073 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 34032 event pairs, 58 based on Foata normal form. 117/5993 useless extension candidates. Maximal degree in co-relation 37323. Up to 1207 conditions per place. [2024-06-27 18:09:06,048 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 173 selfloop transitions, 207 changer transitions 164/549 dead transitions. [2024-06-27 18:09:06,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 549 transitions, 9562 flow [2024-06-27 18:09:06,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-06-27 18:09:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-06-27 18:09:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 866 transitions. [2024-06-27 18:09:06,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5634352635003254 [2024-06-27 18:09:06,051 INFO L175 Difference]: Start difference. First operand has 158 places, 155 transitions, 2129 flow. Second operand 53 states and 866 transitions. [2024-06-27 18:09:06,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 549 transitions, 9562 flow [2024-06-27 18:09:06,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 549 transitions, 7969 flow, removed 763 selfloop flow, removed 20 redundant places. [2024-06-27 18:09:06,640 INFO L231 Difference]: Finished difference. Result has 213 places, 261 transitions, 4646 flow [2024-06-27 18:09:06,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4646, PETRI_PLACES=213, PETRI_TRANSITIONS=261} [2024-06-27 18:09:06,641 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-27 18:09:06,641 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 261 transitions, 4646 flow [2024-06-27 18:09:06,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 26 states have internal predecessors, (289), 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-27 18:09:06,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:09:06,642 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:06,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 18:09:06,857 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-27 18:09:06,857 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-27 18:09:06,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:09:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -293836576, now seen corresponding path program 4 times [2024-06-27 18:09:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:09:06,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956134852] [2024-06-27 18:09:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:09:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:09:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:09:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:09:07,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:09:07,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956134852] [2024-06-27 18:09:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956134852] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:09:07,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777708559] [2024-06-27 18:09:07,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 18:09:07,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:07,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:09:07,342 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-27 18:09:07,360 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-27 18:09:07,416 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 18:09:07,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:09:07,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 18:09:07,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:09:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:09:07,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:09:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:09:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777708559] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:09:08,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:09:08,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-27 18:09:08,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950332646] [2024-06-27 18:09:08,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:09:08,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-27 18:09:08,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:09:08,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-27 18:09:08,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2024-06-27 18:09:08,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:09:08,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 261 transitions, 4646 flow. Second operand has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-27 18:09:08,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:09:08,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:09:08,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:09:11,218 INFO L124 PetriNetUnfolderBase]: 3637/6941 cut-off events. [2024-06-27 18:09:11,218 INFO L125 PetriNetUnfolderBase]: For 430246/430246 co-relation queries the response was YES. [2024-06-27 18:09:11,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47837 conditions, 6941 events. 3637/6941 cut-off events. For 430246/430246 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 43349 event pairs, 864 based on Foata normal form. 63/6997 useless extension candidates. Maximal degree in co-relation 47744. Up to 3565 conditions per place. [2024-06-27 18:09:11,293 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 344 selfloop transitions, 132 changer transitions 135/616 dead transitions. [2024-06-27 18:09:11,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 616 transitions, 12520 flow [2024-06-27 18:09:11,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-06-27 18:09:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-06-27 18:09:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 828 transitions. [2024-06-27 18:09:11,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538711776187378 [2024-06-27 18:09:11,298 INFO L175 Difference]: Start difference. First operand has 213 places, 261 transitions, 4646 flow. Second operand 53 states and 828 transitions. [2024-06-27 18:09:11,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 616 transitions, 12520 flow [2024-06-27 18:09:12,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 616 transitions, 8339 flow, removed 2061 selfloop flow, removed 22 redundant places. [2024-06-27 18:09:12,423 INFO L231 Difference]: Finished difference. Result has 249 places, 317 transitions, 4502 flow [2024-06-27 18:09:12,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3169, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4502, PETRI_PLACES=249, PETRI_TRANSITIONS=317} [2024-06-27 18:09:12,425 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-27 18:09:12,425 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 317 transitions, 4502 flow [2024-06-27 18:09:12,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-27 18:09:12,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:09:12,426 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:12,437 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-27 18:09:12,627 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-27 18:09:12,628 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-27 18:09:12,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:09:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash 551863886, now seen corresponding path program 5 times [2024-06-27 18:09:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:09:12,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629453101] [2024-06-27 18:09:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:09:12,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:09:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:09:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:09:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629453101] [2024-06-27 18:09:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629453101] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:09:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037916566] [2024-06-27 18:09:13,020 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 18:09:13,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:13,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:09:13,021 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:09:13,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-27 18:09:13,091 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-06-27 18:09:13,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:09:13,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 18:09:13,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:09:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:13,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:09:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:13,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037916566] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:09:13,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:09:13,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-27 18:09:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055146931] [2024-06-27 18:09:13,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:09:13,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-27 18:09:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:09:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-27 18:09:13,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2024-06-27 18:09:14,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:09:14,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 317 transitions, 4502 flow. Second operand has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-27 18:09:14,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:09:14,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:09:14,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:09:17,289 INFO L124 PetriNetUnfolderBase]: 4933/9726 cut-off events. [2024-06-27 18:09:17,290 INFO L125 PetriNetUnfolderBase]: For 552049/552049 co-relation queries the response was YES. [2024-06-27 18:09:17,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58686 conditions, 9726 events. 4933/9726 cut-off events. For 552049/552049 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 65520 event pairs, 232 based on Foata normal form. 81/9800 useless extension candidates. Maximal degree in co-relation 58587. Up to 1549 conditions per place. [2024-06-27 18:09:17,379 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 268 selfloop transitions, 374 changer transitions 157/804 dead transitions. [2024-06-27 18:09:17,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 804 transitions, 12958 flow [2024-06-27 18:09:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-27 18:09:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-27 18:09:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 934 transitions. [2024-06-27 18:09:17,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458796025715955 [2024-06-27 18:09:17,382 INFO L175 Difference]: Start difference. First operand has 249 places, 317 transitions, 4502 flow. Second operand 59 states and 934 transitions. [2024-06-27 18:09:17,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 804 transitions, 12958 flow [2024-06-27 18:09:19,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 804 transitions, 11935 flow, removed 432 selfloop flow, removed 29 redundant places. [2024-06-27 18:09:19,261 INFO L231 Difference]: Finished difference. Result has 297 places, 456 transitions, 7409 flow [2024-06-27 18:09:19,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3945, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=7409, PETRI_PLACES=297, PETRI_TRANSITIONS=456} [2024-06-27 18:09:19,262 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-27 18:09:19,263 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 456 transitions, 7409 flow [2024-06-27 18:09:19,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-27 18:09:19,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:09:19,263 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:19,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-27 18:09:19,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:19,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:09:19,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:09:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1935927198, now seen corresponding path program 6 times [2024-06-27 18:09:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:09:19,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132732372] [2024-06-27 18:09:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:09:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:09:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:09:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:19,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:09:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132732372] [2024-06-27 18:09:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132732372] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:09:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827514169] [2024-06-27 18:09:19,977 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 18:09:19,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:19,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:09:19,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:09:20,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-27 18:09:20,067 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-06-27 18:09:20,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:09:20,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 18:09:20,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:09:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:20,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:09:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827514169] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:09:20,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:09:20,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-06-27 18:09:20,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928955289] [2024-06-27 18:09:20,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:09:20,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-06-27 18:09:20,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:09:20,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-06-27 18:09:20,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2024-06-27 18:09:20,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 18:09:20,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 456 transitions, 7409 flow. Second operand has 42 states, 42 states have (on average 9.214285714285714) internal successors, (387), 42 states have internal predecessors, (387), 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-27 18:09:20,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:09:20,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 18:09:20,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:09:25,319 INFO L124 PetriNetUnfolderBase]: 6049/11939 cut-off events. [2024-06-27 18:09:25,319 INFO L125 PetriNetUnfolderBase]: For 945101/945101 co-relation queries the response was YES. [2024-06-27 18:09:25,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80050 conditions, 11939 events. 6049/11939 cut-off events. For 945101/945101 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 84218 event pairs, 118 based on Foata normal form. 81/12013 useless extension candidates. Maximal degree in co-relation 79931. Up to 1903 conditions per place. [2024-06-27 18:09:25,552 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 265 selfloop transitions, 479 changer transitions 155/904 dead transitions. [2024-06-27 18:09:25,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 904 transitions, 16349 flow [2024-06-27 18:09:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-27 18:09:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-27 18:09:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 826 transitions. [2024-06-27 18:09:25,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-06-27 18:09:25,555 INFO L175 Difference]: Start difference. First operand has 297 places, 456 transitions, 7409 flow. Second operand 59 states and 826 transitions. [2024-06-27 18:09:25,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 904 transitions, 16349 flow [2024-06-27 18:09:28,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 904 transitions, 14782 flow, removed 737 selfloop flow, removed 22 redundant places. [2024-06-27 18:09:28,698 INFO L231 Difference]: Finished difference. Result has 351 places, 554 transitions, 9702 flow [2024-06-27 18:09:28,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=6402, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=9702, PETRI_PLACES=351, PETRI_TRANSITIONS=554} [2024-06-27 18:09:28,699 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 320 predicate places. [2024-06-27 18:09:28,700 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 554 transitions, 9702 flow [2024-06-27 18:09:28,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 9.214285714285714) internal successors, (387), 42 states have internal predecessors, (387), 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-27 18:09:28,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:09:28,700 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:28,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-06-27 18:09:28,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:28,901 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:09:28,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:09:28,902 INFO L85 PathProgramCache]: Analyzing trace with hash -212495846, now seen corresponding path program 7 times [2024-06-27 18:09:28,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:09:28,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630146006] [2024-06-27 18:09:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:09:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:09:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:09:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:09:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630146006] [2024-06-27 18:09:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630146006] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:09:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330616251] [2024-06-27 18:09:29,279 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 18:09:29,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:09:29,281 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:09:29,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-27 18:09:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:09:29,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 18:09:29,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:09:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:29,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:09:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330616251] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:09:29,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:09:29,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-27 18:09:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429730066] [2024-06-27 18:09:29,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:09:29,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-27 18:09:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:09:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-27 18:09:29,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2024-06-27 18:09:29,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 18:09:29,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 554 transitions, 9702 flow. Second operand has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-27 18:09:29,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:09:29,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 18:09:29,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:09:34,751 INFO L124 PetriNetUnfolderBase]: 6742/13212 cut-off events. [2024-06-27 18:09:34,752 INFO L125 PetriNetUnfolderBase]: For 1498314/1498314 co-relation queries the response was YES. [2024-06-27 18:09:34,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100847 conditions, 13212 events. 6742/13212 cut-off events. For 1498314/1498314 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 93955 event pairs, 62 based on Foata normal form. 81/13286 useless extension candidates. Maximal degree in co-relation 100710. Up to 2119 conditions per place. [2024-06-27 18:09:34,883 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 258 selfloop transitions, 543 changer transitions 149/955 dead transitions. [2024-06-27 18:09:34,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 955 transitions, 19323 flow [2024-06-27 18:09:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-27 18:09:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-27 18:09:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 958 transitions. [2024-06-27 18:09:34,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.559906487434249 [2024-06-27 18:09:34,886 INFO L175 Difference]: Start difference. First operand has 351 places, 554 transitions, 9702 flow. Second operand 59 states and 958 transitions. [2024-06-27 18:09:34,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 955 transitions, 19323 flow [2024-06-27 18:09:39,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 955 transitions, 16861 flow, removed 989 selfloop flow, removed 34 redundant places. [2024-06-27 18:09:39,426 INFO L231 Difference]: Finished difference. Result has 387 places, 611 transitions, 11245 flow [2024-06-27 18:09:39,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=8058, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=497, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=11245, PETRI_PLACES=387, PETRI_TRANSITIONS=611} [2024-06-27 18:09:39,427 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 356 predicate places. [2024-06-27 18:09:39,427 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 611 transitions, 11245 flow [2024-06-27 18:09:39,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-27 18:09:39,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:09:39,427 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:39,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-06-27 18:09:39,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-27 18:09:39,632 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:09:39,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:09:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash 246150633, now seen corresponding path program 8 times [2024-06-27 18:09:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:09:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600260424] [2024-06-27 18:09:39,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:09:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:09:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:09:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:09:40,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600260424] [2024-06-27 18:09:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600260424] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:09:40,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681957945] [2024-06-27 18:09:40,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 18:09:40,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:09:40,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:09:40,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:09:40,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-27 18:09:40,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 18:09:40,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:09:40,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2024-06-27 18:09:40,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:09:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:40,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:09:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:09:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681957945] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:09:40,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:09:40,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2024-06-27 18:09:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096679597] [2024-06-27 18:09:40,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:09:40,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-06-27 18:09:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:09:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-06-27 18:09:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1413, Unknown=0, NotChecked=0, Total=1806 [2024-06-27 18:09:40,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 18:09:40,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 611 transitions, 11245 flow. Second operand has 43 states, 43 states have (on average 9.186046511627907) internal successors, (395), 43 states have internal predecessors, (395), 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-27 18:09:40,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:09:40,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 18:09:40,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:09:45,826 INFO L124 PetriNetUnfolderBase]: 7039/13834 cut-off events. [2024-06-27 18:09:45,826 INFO L125 PetriNetUnfolderBase]: For 1836173/1836173 co-relation queries the response was YES. [2024-06-27 18:09:45,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109545 conditions, 13834 events. 7039/13834 cut-off events. For 1836173/1836173 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 98650 event pairs, 282 based on Foata normal form. 63/13884 useless extension candidates. Maximal degree in co-relation 109396. Up to 2239 conditions per place. [2024-06-27 18:09:45,980 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 246 selfloop transitions, 535 changer transitions 111/897 dead transitions. [2024-06-27 18:09:45,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 897 transitions, 18857 flow [2024-06-27 18:09:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-06-27 18:09:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-06-27 18:09:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 665 transitions. [2024-06-27 18:09:45,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48789435069699194 [2024-06-27 18:09:45,983 INFO L175 Difference]: Start difference. First operand has 387 places, 611 transitions, 11245 flow. Second operand 47 states and 665 transitions. [2024-06-27 18:09:45,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 897 transitions, 18857 flow [2024-06-27 18:09:52,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 897 transitions, 15210 flow, removed 1424 selfloop flow, removed 45 redundant places. [2024-06-27 18:09:52,569 INFO L231 Difference]: Finished difference. Result has 390 places, 642 transitions, 11013 flow [2024-06-27 18:09:52,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9032, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=508, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=11013, PETRI_PLACES=390, PETRI_TRANSITIONS=642} [2024-06-27 18:09:52,570 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 359 predicate places. [2024-06-27 18:09:52,570 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 642 transitions, 11013 flow [2024-06-27 18:09:52,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 9.186046511627907) internal successors, (395), 43 states have internal predecessors, (395), 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-27 18:09:52,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:09:52,571 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:52,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-06-27 18:09:52,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-06-27 18:09:52,772 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 18:09:52,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:09:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash -973799792, now seen corresponding path program 9 times [2024-06-27 18:09:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:09:52,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201702932] [2024-06-27 18:09:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:09:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:09:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:09:52,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 18:09:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 18:09:52,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 18:09:52,834 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 18:09:52,836 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 18:09:52,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 18:09:52,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 18:09:52,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 18:09:52,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 18:09:52,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:09:52,839 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1, 1, 1] [2024-06-27 18:09:52,845 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 18:09:52,845 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 18:09:52,922 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 18:09:52,922 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 18:09:52,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 06:09:52 BasicIcfg [2024-06-27 18:09:52,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 18:09:52,923 INFO L158 Benchmark]: Toolchain (without parser) took 59494.99ms. Allocated memory was 178.3MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 142.6MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-06-27 18:09:52,924 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:09:52,924 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 104.9MB. Free memory was 73.2MB in the beginning and 73.0MB in the end (delta: 209.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:09:52,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.41ms. Allocated memory is still 178.3MB. Free memory was 142.6MB in the beginning and 118.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-06-27 18:09:52,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.78ms. Allocated memory is still 178.3MB. Free memory was 118.6MB in the beginning and 116.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 18:09:52,925 INFO L158 Benchmark]: Boogie Preprocessor took 38.75ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 18:09:52,925 INFO L158 Benchmark]: RCFGBuilder took 558.08ms. Allocated memory is still 178.3MB. Free memory was 114.4MB in the beginning and 129.5MB in the end (delta: -15.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 18:09:52,925 INFO L158 Benchmark]: TraceAbstraction took 58224.60ms. Allocated memory was 178.3MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 128.5MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 18:09:52,927 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 1.02ms. Allocated memory is still 104.9MB. Free memory was 73.2MB in the beginning and 73.0MB in the end (delta: 209.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 629.41ms. Allocated memory is still 178.3MB. Free memory was 142.6MB in the beginning and 118.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.78ms. Allocated memory is still 178.3MB. Free memory was 118.6MB in the beginning and 116.5MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.75ms. Allocated memory is still 178.3MB. Free memory was 116.5MB in the beginning and 114.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 558.08ms. Allocated memory is still 178.3MB. Free memory was 114.4MB in the beginning and 129.5MB in the end (delta: -15.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 58224.60ms. Allocated memory was 178.3MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 128.5MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] 0 //@ ghost multithreaded = 1; VAL [\old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] 0 //@ assert ((!multithreaded || ((4 <= j) && ((j % 2) == 0))) && (!multithreaded || ((3 <= i) && ((i % 2) == 1)))); [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=7, id1=-1, id2=0, j=6, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, i=7, j=6, k=1] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L715] 0 //@ assert ((!multithreaded || ((4 <= j) && ((j % 2) == 0))) && (!multithreaded || ((3 <= i) && ((i % 2) == 1)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, i=23, id1=-1, id2=0, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=23, id1=-1, id2=0, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 58.0s, OverallIterations: 17, TraceHistogramMax: 10, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 47.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7366 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7253 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10590 IncrementalHoareTripleChecker+Invalid, 10984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 8 mSDtfsCounter, 10590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1445 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15051 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11245occurred in iteration=15, InterpolantAutomatonStates: 464, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1409 ConstructedInterpolants, 0 QuantifiedInterpolants, 6011 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1322 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 39/3345 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 18:09:52,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE