./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x9.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x9.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-?-80b1b13-m [2024-01-31 16:46:00,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:46:01,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:46:01,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:46:01,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:46:01,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:46:01,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:46:01,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:46:01,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:46:01,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:46:01,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:46:01,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:46:01,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:46:01,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:46:01,130 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:46:01,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:46:01,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:46:01,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:46:01,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:46:01,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:46:01,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:46:01,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:46:01,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:46:01,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:46:01,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:46:01,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:46:01,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:46:01,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:46:01,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:46:01,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:46:01,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:46:01,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:46:01,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:46:01,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:46:01,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:46:01,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:46:01,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:46:01,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:46:01,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:46:01,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:46:01,139 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:46:01,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:46:01,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:46:01,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 16:46:01,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:46:01,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:46:01,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:46:01,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:46:01,417 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:46:01,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2024-01-31 16:46:02,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:46:02,801 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:46:02,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2024-01-31 16:46:02,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c6c942f/ae245c1eeeef4dfab3289eeef5c7e5ad/FLAG0e014c24c [2024-01-31 16:46:02,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c6c942f/ae245c1eeeef4dfab3289eeef5c7e5ad [2024-01-31 16:46:02,821 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:46:02,821 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:46:02,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x9.wvr.yml/witness.yml [2024-01-31 16:46:02,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:46:02,927 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:46:02,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:46:02,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:46:02,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:46:02,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:46:02" (1/2) ... [2024-01-31 16:46:02,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ef6e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:46:02, skipping insertion in model container [2024-01-31 16:46:02,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:46:02" (1/2) ... [2024-01-31 16:46:02,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@524c4d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:46:02, skipping insertion in model container [2024-01-31 16:46:02,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:46:02" (2/2) ... [2024-01-31 16:46:02,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ef6e83 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:02, skipping insertion in model container [2024-01-31 16:46:02,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:46:02" (2/2) ... [2024-01-31 16:46:02,937 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:46:02,971 INFO L93 nessWitnessExtractor]: Witness did not contain any usable entries. [2024-01-31 16:46:02,996 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:46:03,200 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c[2721,2734] [2024-01-31 16:46:03,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:46:03,221 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 16:46:03,245 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c[2721,2734] [2024-01-31 16:46:03,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:46:03,258 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:46:03,258 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03 WrapperNode [2024-01-31 16:46:03,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:46:03,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:46:03,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:46:03,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:46:03,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,289 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-01-31 16:46:03,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:46:03,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:46:03,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:46:03,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:46:03,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,318 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 16:46:03,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:46:03,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:46:03,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:46:03,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:46:03,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (1/1) ... [2024-01-31 16:46:03,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:46:03,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:46:03,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 16:46:03,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 16:46:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:46:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:46:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:46:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:46:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:46:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 16:46:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 16:46:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-31 16:46:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-31 16:46:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:46:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:46:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:46:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:46:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 16:46:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:46:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:46:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:46:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:46:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:46:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 16:46:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:46:03,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:46:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:46:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:46:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:46:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:46:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 16:46:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:46:03,412 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 16:46:03,532 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:46:03,535 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:46:03,743 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:46:03,744 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:46:04,028 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:46:04,028 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-31 16:46:04,029 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:46:04 BoogieIcfgContainer [2024-01-31 16:46:04,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:46:04,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:46:04,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:46:04,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:46:04,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:46:02" (1/4) ... [2024-01-31 16:46:04,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e10df47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:46:04, skipping insertion in model container [2024-01-31 16:46:04,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:46:02" (2/4) ... [2024-01-31 16:46:04,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e10df47 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:46:04, skipping insertion in model container [2024-01-31 16:46:04,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:46:03" (3/4) ... [2024-01-31 16:46:04,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e10df47 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:46:04, skipping insertion in model container [2024-01-31 16:46:04,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:46:04" (4/4) ... [2024-01-31 16:46:04,037 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2024-01-31 16:46:04,053 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:46:04,054 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-31 16:46:04,054 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:46:04,091 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-31 16:46:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 98 flow [2024-01-31 16:46:04,165 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2024-01-31 16:46:04,165 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-31 16:46:04,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-01-31 16:46:04,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 35 transitions, 98 flow [2024-01-31 16:46:04,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2024-01-31 16:46:04,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:46:04,200 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;@7d28b363, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:46:04,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-31 16:46:04,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:46:04,220 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2024-01-31 16:46:04,220 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-31 16:46:04,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:04,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:04,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:04,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1839673379, now seen corresponding path program 1 times [2024-01-31 16:46:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166721681] [2024-01-31 16:46:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:04,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166721681] [2024-01-31 16:46:04,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166721681] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:46:04,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:46:04,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:46:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711254961] [2024-01-31 16:46:04,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:46:04,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:46:04,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:04,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:46:04,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:46:04,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:04,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:04,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:04,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:04,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:05,247 INFO L124 PetriNetUnfolderBase]: 1537/1955 cut-off events. [2024-01-31 16:46:05,248 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-01-31 16:46:05,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 1955 events. 1537/1955 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6359 event pairs, 141 based on Foata normal form. 1/1131 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2024-01-31 16:46:05,273 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 41 selfloop transitions, 5 changer transitions 1/52 dead transitions. [2024-01-31 16:46:05,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 243 flow [2024-01-31 16:46:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:46:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:46:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-01-31 16:46:05,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-01-31 16:46:05,289 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 84 flow. Second operand 3 states and 75 transitions. [2024-01-31 16:46:05,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 243 flow [2024-01-31 16:46:05,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 52 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-31 16:46:05,297 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 101 flow [2024-01-31 16:46:05,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2024-01-31 16:46:05,304 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2024-01-31 16:46:05,304 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 101 flow [2024-01-31 16:46:05,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:05,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:05,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:05,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:46:05,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:05,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash 425209788, now seen corresponding path program 1 times [2024-01-31 16:46:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:05,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622915570] [2024-01-31 16:46:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:05,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:05,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622915570] [2024-01-31 16:46:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622915570] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:46:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:46:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:46:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626329518] [2024-01-31 16:46:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:46:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:46:05,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:05,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:46:05,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:46:05,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:05,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:05,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:05,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:05,840 INFO L124 PetriNetUnfolderBase]: 1837/2362 cut-off events. [2024-01-31 16:46:05,841 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2024-01-31 16:46:05,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5858 conditions, 2362 events. 1837/2362 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8335 event pairs, 138 based on Foata normal form. 34/2386 useless extension candidates. Maximal degree in co-relation 1437. Up to 964 conditions per place. [2024-01-31 16:46:05,859 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2024-01-31 16:46:05,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 87 transitions, 415 flow [2024-01-31 16:46:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:46:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:46:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-01-31 16:46:05,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2024-01-31 16:46:05,868 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 101 flow. Second operand 5 states and 121 transitions. [2024-01-31 16:46:05,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 87 transitions, 415 flow [2024-01-31 16:46:05,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 87 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:46:05,876 INFO L231 Difference]: Finished difference. Result has 39 places, 41 transitions, 161 flow [2024-01-31 16:46:05,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=39, PETRI_TRANSITIONS=41} [2024-01-31 16:46:05,877 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2024-01-31 16:46:05,878 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 161 flow [2024-01-31 16:46:05,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:05,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:05,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:05,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:46:05,879 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:05,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1628550713, now seen corresponding path program 1 times [2024-01-31 16:46:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676417229] [2024-01-31 16:46:05,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676417229] [2024-01-31 16:46:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676417229] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:46:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:46:06,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:46:06,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641808141] [2024-01-31 16:46:06,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:46:06,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:46:06,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:06,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:46:06,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:46:06,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:06,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:06,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:06,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:06,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:06,376 INFO L124 PetriNetUnfolderBase]: 1779/2304 cut-off events. [2024-01-31 16:46:06,377 INFO L125 PetriNetUnfolderBase]: For 2031/2031 co-relation queries the response was YES. [2024-01-31 16:46:06,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6819 conditions, 2304 events. 1779/2304 cut-off events. For 2031/2031 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8326 event pairs, 118 based on Foata normal form. 58/2352 useless extension candidates. Maximal degree in co-relation 3195. Up to 906 conditions per place. [2024-01-31 16:46:06,398 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2024-01-31 16:46:06,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 440 flow [2024-01-31 16:46:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:46:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:46:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-01-31 16:46:06,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-01-31 16:46:06,406 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 161 flow. Second operand 5 states and 120 transitions. [2024-01-31 16:46:06,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 440 flow [2024-01-31 16:46:06,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 85 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 16:46:06,415 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 175 flow [2024-01-31 16:46:06,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2024-01-31 16:46:06,417 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2024-01-31 16:46:06,417 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 175 flow [2024-01-31 16:46:06,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:06,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:06,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:06,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:46:06,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:06,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:06,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1343722216, now seen corresponding path program 2 times [2024-01-31 16:46:06,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:06,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618146457] [2024-01-31 16:46:06,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:06,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:06,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:06,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618146457] [2024-01-31 16:46:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618146457] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:46:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402137238] [2024-01-31 16:46:06,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:46:06,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:46:06,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:46:06,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:46:06,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-31 16:46:06,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 16:46:06,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:46:06,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-31 16:46:06,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:46:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:06,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:46:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:06,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402137238] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:46:06,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:46:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-01-31 16:46:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893503696] [2024-01-31 16:46:06,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:46:06,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:46:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:06,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:46:06,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:46:06,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:06,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:06,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:06,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:06,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:07,303 INFO L124 PetriNetUnfolderBase]: 1687/2222 cut-off events. [2024-01-31 16:46:07,303 INFO L125 PetriNetUnfolderBase]: For 2865/2865 co-relation queries the response was YES. [2024-01-31 16:46:07,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6939 conditions, 2222 events. 1687/2222 cut-off events. For 2865/2865 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8408 event pairs, 431 based on Foata normal form. 70/2258 useless extension candidates. Maximal degree in co-relation 2937. Up to 1155 conditions per place. [2024-01-31 16:46:07,320 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2024-01-31 16:46:07,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 85 transitions, 472 flow [2024-01-31 16:46:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:46:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:46:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-01-31 16:46:07,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2024-01-31 16:46:07,323 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 175 flow. Second operand 5 states and 121 transitions. [2024-01-31 16:46:07,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 85 transitions, 472 flow [2024-01-31 16:46:07,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:46:07,331 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 218 flow [2024-01-31 16:46:07,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-01-31 16:46:07,333 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2024-01-31 16:46:07,333 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 218 flow [2024-01-31 16:46:07,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:07,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:07,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:07,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-31 16:46:07,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:46:07,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:07,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1509948660, now seen corresponding path program 1 times [2024-01-31 16:46:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:07,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586805423] [2024-01-31 16:46:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:07,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:07,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586805423] [2024-01-31 16:46:07,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586805423] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:46:07,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307384598] [2024-01-31 16:46:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:07,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:46:07,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:46:07,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:46:07,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-31 16:46:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:07,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-31 16:46:07,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:46:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:07,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:46:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307384598] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:46:07,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:46:07,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-01-31 16:46:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618958431] [2024-01-31 16:46:07,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:46:07,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:46:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:46:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:46:07,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:07,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:07,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:07,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:07,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:08,268 INFO L124 PetriNetUnfolderBase]: 2045/2782 cut-off events. [2024-01-31 16:46:08,269 INFO L125 PetriNetUnfolderBase]: For 6812/6812 co-relation queries the response was YES. [2024-01-31 16:46:08,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9829 conditions, 2782 events. 2045/2782 cut-off events. For 6812/6812 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11712 event pairs, 323 based on Foata normal form. 80/2808 useless extension candidates. Maximal degree in co-relation 5943. Up to 1205 conditions per place. [2024-01-31 16:46:08,294 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 102 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2024-01-31 16:46:08,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 115 transitions, 847 flow [2024-01-31 16:46:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:46:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:46:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-01-31 16:46:08,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-01-31 16:46:08,296 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 218 flow. Second operand 5 states and 119 transitions. [2024-01-31 16:46:08,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 115 transitions, 847 flow [2024-01-31 16:46:08,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 115 transitions, 822 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-01-31 16:46:08,307 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 264 flow [2024-01-31 16:46:08,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-01-31 16:46:08,309 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2024-01-31 16:46:08,310 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 264 flow [2024-01-31 16:46:08,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:08,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:08,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:08,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-31 16:46:08,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:46:08,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:08,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:08,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1431904144, now seen corresponding path program 2 times [2024-01-31 16:46:08,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:08,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911712482] [2024-01-31 16:46:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:08,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:08,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911712482] [2024-01-31 16:46:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911712482] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:46:08,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:46:08,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:46:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906204407] [2024-01-31 16:46:08,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:46:08,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:46:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:08,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:46:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:46:08,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:08,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:08,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:08,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:08,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:08,911 INFO L124 PetriNetUnfolderBase]: 1843/2482 cut-off events. [2024-01-31 16:46:08,911 INFO L125 PetriNetUnfolderBase]: For 6653/6653 co-relation queries the response was YES. [2024-01-31 16:46:08,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10209 conditions, 2482 events. 1843/2482 cut-off events. For 6653/6653 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9653 event pairs, 99 based on Foata normal form. 38/2490 useless extension candidates. Maximal degree in co-relation 6291. Up to 1018 conditions per place. [2024-01-31 16:46:08,935 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 102 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2024-01-31 16:46:08,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 118 transitions, 896 flow [2024-01-31 16:46:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:46:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:46:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-01-31 16:46:08,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2024-01-31 16:46:08,937 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 264 flow. Second operand 5 states and 117 transitions. [2024-01-31 16:46:08,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 118 transitions, 896 flow [2024-01-31 16:46:08,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 896 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 16:46:08,945 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 325 flow [2024-01-31 16:46:08,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-01-31 16:46:08,948 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2024-01-31 16:46:08,949 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 325 flow [2024-01-31 16:46:08,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:08,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:08,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:08,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:46:08,950 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:08,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash -368550829, now seen corresponding path program 1 times [2024-01-31 16:46:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967723721] [2024-01-31 16:46:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967723721] [2024-01-31 16:46:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967723721] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:46:09,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:46:09,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:46:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929892050] [2024-01-31 16:46:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:46:09,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:46:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:46:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:46:09,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:09,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:09,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:09,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:09,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:09,372 INFO L124 PetriNetUnfolderBase]: 1801/2440 cut-off events. [2024-01-31 16:46:09,373 INFO L125 PetriNetUnfolderBase]: For 7675/7675 co-relation queries the response was YES. [2024-01-31 16:46:09,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10814 conditions, 2440 events. 1801/2440 cut-off events. For 7675/7675 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9662 event pairs, 75 based on Foata normal form. 42/2452 useless extension candidates. Maximal degree in co-relation 6678. Up to 1137 conditions per place. [2024-01-31 16:46:09,423 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 99 selfloop transitions, 8 changer transitions 4/116 dead transitions. [2024-01-31 16:46:09,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 909 flow [2024-01-31 16:46:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:46:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:46:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-01-31 16:46:09,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2024-01-31 16:46:09,425 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 325 flow. Second operand 5 states and 116 transitions. [2024-01-31 16:46:09,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 909 flow [2024-01-31 16:46:09,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 898 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-31 16:46:09,434 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 328 flow [2024-01-31 16:46:09,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-01-31 16:46:09,435 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2024-01-31 16:46:09,435 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 328 flow [2024-01-31 16:46:09,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:09,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:09,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:09,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:46:09,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:09,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 90604823, now seen corresponding path program 2 times [2024-01-31 16:46:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:09,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438600368] [2024-01-31 16:46:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:09,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:09,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438600368] [2024-01-31 16:46:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438600368] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:46:09,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:46:09,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:46:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534674784] [2024-01-31 16:46:09,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:46:09,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:46:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:46:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:46:09,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:09,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:09,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:09,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:09,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:09,807 INFO L124 PetriNetUnfolderBase]: 1725/2376 cut-off events. [2024-01-31 16:46:09,808 INFO L125 PetriNetUnfolderBase]: For 8064/8064 co-relation queries the response was YES. [2024-01-31 16:46:09,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10864 conditions, 2376 events. 1725/2376 cut-off events. For 8064/8064 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9876 event pairs, 293 based on Foata normal form. 76/2410 useless extension candidates. Maximal degree in co-relation 6709. Up to 1307 conditions per place. [2024-01-31 16:46:09,831 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 101 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-01-31 16:46:09,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 925 flow [2024-01-31 16:46:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:46:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:46:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-01-31 16:46:09,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2024-01-31 16:46:09,833 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 328 flow. Second operand 5 states and 113 transitions. [2024-01-31 16:46:09,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 925 flow [2024-01-31 16:46:09,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 114 transitions, 912 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-31 16:46:09,843 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 368 flow [2024-01-31 16:46:09,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-01-31 16:46:09,845 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2024-01-31 16:46:09,845 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 368 flow [2024-01-31 16:46:09,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:09,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:09,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:09,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:46:09,846 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:09,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1087643345, now seen corresponding path program 2 times [2024-01-31 16:46:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:09,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400306994] [2024-01-31 16:46:09,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:09,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400306994] [2024-01-31 16:46:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400306994] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:46:09,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:46:09,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:46:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843071661] [2024-01-31 16:46:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:46:09,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:46:09,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:46:09,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:46:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:46:09,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:46:09,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:09,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:46:09,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:46:09,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:46:10,258 INFO L124 PetriNetUnfolderBase]: 1657/2291 cut-off events. [2024-01-31 16:46:10,258 INFO L125 PetriNetUnfolderBase]: For 8253/8277 co-relation queries the response was YES. [2024-01-31 16:46:10,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11116 conditions, 2291 events. 1657/2291 cut-off events. For 8253/8277 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9648 event pairs, 481 based on Foata normal form. 72/2345 useless extension candidates. Maximal degree in co-relation 9772. Up to 1331 conditions per place. [2024-01-31 16:46:10,279 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 117 selfloop transitions, 8 changer transitions 0/130 dead transitions. [2024-01-31 16:46:10,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 1116 flow [2024-01-31 16:46:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:46:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:46:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-01-31 16:46:10,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2024-01-31 16:46:10,281 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 368 flow. Second operand 5 states and 117 transitions. [2024-01-31 16:46:10,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 1116 flow [2024-01-31 16:46:10,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 1058 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-01-31 16:46:10,294 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 405 flow [2024-01-31 16:46:10,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=405, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2024-01-31 16:46:10,298 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2024-01-31 16:46:10,298 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 405 flow [2024-01-31 16:46:10,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:46:10,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:46:10,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:46:10,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:46:10,299 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:46:10,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:46:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash -124621720, now seen corresponding path program 1 times [2024-01-31 16:46:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:46:10,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384113621] [2024-01-31 16:46:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:46:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:46:10,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:46:10,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384113621] [2024-01-31 16:46:10,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384113621] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:46:10,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366865961] [2024-01-31 16:46:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:46:10,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:46:10,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:46:10,713 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:46:10,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-31 16:46:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:46:11,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:46:11,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:47:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:47:02,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:47:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:47:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366865961] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:47:06,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:47:06,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-01-31 16:47:06,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662305706] [2024-01-31 16:47:06,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:47:06,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-31 16:47:06,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:47:06,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-31 16:47:06,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=168, Unknown=3, NotChecked=0, Total=240 [2024-01-31 16:47:06,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:47:06,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 405 flow. Second operand has 16 states, 16 states have (on average 12.8125) internal successors, (205), 16 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:47:06,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:47:06,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:47:06,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:47:12,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:16,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:18,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:19,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:23,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:27,768 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x3~0 4294967296)) (.cse0 (mod (div c_~x1~0 128) 4294967296)) (.cse1 (mod c_~n~0 4294967296))) (and (= .cse0 (mod c_~x2~0 4294967296)) (<= .cse1 (mod c_~x1~0 4294967296)) (= (mod c_~x1~0 128) 0) (= .cse2 (mod c_~x4~0 4294967296)) (<= 1 .cse2) (= (mod (* c_~x2~0 127) 128) 0) (= .cse0 (mod (* 4294967295 (div (* (- 1) c_~x2~0) 128)) 4294967296)) (<= (+ .cse0 1) .cse1))) is different from false [2024-01-31 16:47:29,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:32,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:37,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:39,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:43,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:47:46,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:00,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:04,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:08,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:09,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:14,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:15,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:19,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:24,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:28,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:32,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:36,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:48,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:49,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:54,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:48:58,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:01,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:03,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:09,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:14,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:18,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:22,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:26,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:30,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:34,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:38,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:42,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:46,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:50,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:55,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:49:57,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:01,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:03,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:07,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:11,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:13,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:16,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:21,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:22,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:24,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:25,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:30,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:31,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:50:31,667 INFO L124 PetriNetUnfolderBase]: 3875/5440 cut-off events. [2024-01-31 16:50:31,668 INFO L125 PetriNetUnfolderBase]: For 18401/18401 co-relation queries the response was YES. [2024-01-31 16:50:31,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27334 conditions, 5440 events. 3875/5440 cut-off events. For 18401/18401 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 27117 event pairs, 223 based on Foata normal form. 27/5453 useless extension candidates. Maximal degree in co-relation 25294. Up to 2687 conditions per place. [2024-01-31 16:50:31,771 INFO L140 encePairwiseOnDemand]: 17/35 looper letters, 269 selfloop transitions, 131 changer transitions 25/430 dead transitions. [2024-01-31 16:50:31,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 430 transitions, 3401 flow [2024-01-31 16:50:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-31 16:50:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-01-31 16:50:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 497 transitions. [2024-01-31 16:50:31,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.71 [2024-01-31 16:50:31,787 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 405 flow. Second operand 20 states and 497 transitions. [2024-01-31 16:50:31,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 430 transitions, 3401 flow [2024-01-31 16:50:31,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 430 transitions, 3380 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-01-31 16:50:31,962 INFO L231 Difference]: Finished difference. Result has 106 places, 187 transitions, 2016 flow [2024-01-31 16:50:31,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2016, PETRI_PLACES=106, PETRI_TRANSITIONS=187} [2024-01-31 16:50:31,963 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 67 predicate places. [2024-01-31 16:50:31,963 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 187 transitions, 2016 flow [2024-01-31 16:50:31,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.8125) internal successors, (205), 16 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:50:31,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:50:31,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:50:31,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-31 16:50:32,176 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-01-31 16:50:32,177 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:50:32,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:50:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1903849412, now seen corresponding path program 1 times [2024-01-31 16:50:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:50:32,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904948267] [2024-01-31 16:50:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:50:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:50:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:50:33,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-01-31 16:50:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:50:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904948267] [2024-01-31 16:50:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904948267] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:50:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789862730] [2024-01-31 16:50:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:50:33,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:50:33,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:50:33,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:50:33,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-31 16:50:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:50:33,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:50:33,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:51:54,973 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 16:52:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:52:23,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:52:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:52:31,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789862730] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:52:31,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:52:31,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2024-01-31 16:52:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769476813] [2024-01-31 16:52:31,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:52:31,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-31 16:52:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:52:31,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-31 16:52:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=188, Unknown=9, NotChecked=0, Total=272 [2024-01-31 16:52:31,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:52:31,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 187 transitions, 2016 flow. Second operand has 17 states, 17 states have (on average 12.823529411764707) internal successors, (218), 17 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:52:31,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:52:31,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:52:31,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:52:34,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:52:44,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:08,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:14,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:19,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:27,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:31,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:35,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:39,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:43,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:47,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:51,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:55,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:53:58,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:02,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:06,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:10,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:13,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:22,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:26,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:29,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:30,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:34,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:38,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:42,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:46,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:50,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:54,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:54:59,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:55:04,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:55:09,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:55:13,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:55:18,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:55:22,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-31 16:55:23,159 INFO L124 PetriNetUnfolderBase]: 5347/7499 cut-off events. [2024-01-31 16:55:23,160 INFO L125 PetriNetUnfolderBase]: For 46038/46056 co-relation queries the response was YES. [2024-01-31 16:55:23,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46254 conditions, 7499 events. 5347/7499 cut-off events. For 46038/46056 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 38906 event pairs, 521 based on Foata normal form. 31/7518 useless extension candidates. Maximal degree in co-relation 45670. Up to 5517 conditions per place. [2024-01-31 16:55:23,231 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 337 selfloop transitions, 103 changer transitions 39/484 dead transitions. [2024-01-31 16:55:23,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 484 transitions, 5191 flow [2024-01-31 16:55:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-31 16:55:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-01-31 16:55:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 404 transitions. [2024-01-31 16:55:23,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6789915966386555 [2024-01-31 16:55:23,234 INFO L175 Difference]: Start difference. First operand has 106 places, 187 transitions, 2016 flow. Second operand 17 states and 404 transitions. [2024-01-31 16:55:23,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 484 transitions, 5191 flow [2024-01-31 16:55:23,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 484 transitions, 4885 flow, removed 153 selfloop flow, removed 0 redundant places. [2024-01-31 16:55:23,448 INFO L231 Difference]: Finished difference. Result has 133 places, 288 transitions, 3147 flow [2024-01-31 16:55:23,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1710, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3147, PETRI_PLACES=133, PETRI_TRANSITIONS=288} [2024-01-31 16:55:23,449 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 94 predicate places. [2024-01-31 16:55:23,449 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 288 transitions, 3147 flow [2024-01-31 16:55:23,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.823529411764707) internal successors, (218), 17 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:55:23,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:55:23,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:55:23,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-31 16:55:23,664 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-01-31 16:55:23,664 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:55:23,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:55:23,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1450942180, now seen corresponding path program 2 times [2024-01-31 16:55:23,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:55:23,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701059979] [2024-01-31 16:55:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:55:23,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:55:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:55:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:55:24,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:55:24,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701059979] [2024-01-31 16:55:24,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701059979] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:55:24,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032073470] [2024-01-31 16:55:24,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:55:24,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:55:24,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:55:24,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:55:24,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-31 16:55:24,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 16:55:24,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:55:24,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:55:24,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:56:10,656 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 16:56:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:56:46,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:56:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:56:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032073470] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:56:51,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:56:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2024-01-31 16:56:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005693267] [2024-01-31 16:56:51,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:56:51,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-31 16:56:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:56:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-31 16:56:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=189, Unknown=10, NotChecked=0, Total=272 [2024-01-31 16:56:51,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-31 16:56:51,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 288 transitions, 3147 flow. Second operand has 17 states, 17 states have (on average 12.823529411764707) internal successors, (218), 17 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:56:51,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:56:51,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-31 16:56:51,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:57:00,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:57:03,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:57:08,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:57:10,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:57:13,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:57:17,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-31 16:57:21,172 INFO L124 PetriNetUnfolderBase]: 6457/9049 cut-off events. [2024-01-31 16:57:21,172 INFO L125 PetriNetUnfolderBase]: For 66782/66800 co-relation queries the response was YES. [2024-01-31 16:57:21,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58310 conditions, 9049 events. 6457/9049 cut-off events. For 66782/66800 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 48170 event pairs, 619 based on Foata normal form. 17/9054 useless extension candidates. Maximal degree in co-relation 57849. Up to 7282 conditions per place. [2024-01-31 16:57:21,252 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 418 selfloop transitions, 105 changer transitions 24/552 dead transitions. [2024-01-31 16:57:21,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 552 transitions, 6584 flow [2024-01-31 16:57:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-31 16:57:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-31 16:57:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 368 transitions. [2024-01-31 16:57:21,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2024-01-31 16:57:21,255 INFO L175 Difference]: Start difference. First operand has 133 places, 288 transitions, 3147 flow. Second operand 16 states and 368 transitions. [2024-01-31 16:57:21,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 552 transitions, 6584 flow [2024-01-31 16:57:21,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 552 transitions, 6233 flow, removed 173 selfloop flow, removed 1 redundant places. [2024-01-31 16:57:21,516 INFO L231 Difference]: Finished difference. Result has 157 places, 382 transitions, 4383 flow [2024-01-31 16:57:21,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4383, PETRI_PLACES=157, PETRI_TRANSITIONS=382} [2024-01-31 16:57:21,517 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 118 predicate places. [2024-01-31 16:57:21,517 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 382 transitions, 4383 flow [2024-01-31 16:57:21,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.823529411764707) internal successors, (218), 17 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 16:57:21,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:57:21,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:57:21,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-31 16:57:21,718 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-01-31 16:57:21,718 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-01-31 16:57:21,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:57:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash -154536156, now seen corresponding path program 2 times [2024-01-31 16:57:21,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:57:21,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387941469] [2024-01-31 16:57:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:57:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:57:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:57:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:57:22,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:57:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387941469] [2024-01-31 16:57:22,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387941469] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:57:22,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539920311] [2024-01-31 16:57:22,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 16:57:22,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:57:22,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:57:22,082 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:57:22,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-31 16:57:22,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 16:57:22,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:57:22,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 16:57:22,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:58:36,949 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:00:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:00:24,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15