./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f91e7b856fd6bf43c568f48d1703ed519fbb708e5c1360b96f8534e6fa4ed35d --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:09:00,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:09:00,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:09:00,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:09:00,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:09:00,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:09:00,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:09:00,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:09:00,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:09:00,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:09:00,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:09:00,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:09:00,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:09:00,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:09:00,476 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:09:00,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:09:00,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:09:00,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:09:00,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:09:00,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:09:00,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:09:00,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:09:00,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:09:00,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:09:00,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:09:00,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:09:00,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:09:00,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:09:00,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:09:00,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:09:00,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:09:00,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:09:00,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:09:00,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:09:00,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:09:00,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:09:00,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:09:00,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:09:00,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:09:00,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:09:00,485 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:09:00,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:09:00,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:09:00,486 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91e7b856fd6bf43c568f48d1703ed519fbb708e5c1360b96f8534e6fa4ed35d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:09:00,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:09:00,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:09:00,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:09:00,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:09:00,847 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:09:00,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-02-19 15:09:02,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:09:02,391 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:09:02,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-02-19 15:09:02,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9e0bf8c/727d43bbe2464940bef0892f4dd7482a/FLAG3b384a86c [2024-02-19 15:09:02,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9e0bf8c/727d43bbe2464940bef0892f4dd7482a [2024-02-19 15:09:02,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:09:02,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:09:02,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:09:02,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:09:02,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:09:02,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebbc897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02, skipping insertion in model container [2024-02-19 15:09:02,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,443 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:09:02,647 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/popl20-more-vector-add.wvr.c[2598,2611] [2024-02-19 15:09:02,661 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:09:02,672 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:09:02,713 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/popl20-more-vector-add.wvr.c[2598,2611] [2024-02-19 15:09:02,722 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:09:02,742 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:09:02,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02 WrapperNode [2024-02-19 15:09:02,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:09:02,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:09:02,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:09:02,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:09:02,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,810 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 203 [2024-02-19 15:09:02,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:09:02,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:09:02,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:09:02,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:09:02,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,858 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 15, 2, 2, 2]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 10 writes are split as follows [0, 7, 1, 1, 1]. [2024-02-19 15:09:02,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:09:02,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:09:02,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:09:02,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:09:02,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (1/1) ... [2024-02-19 15:09:02,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:09:02,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:02,950 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-02-19 15:09:02,973 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-02-19 15:09:03,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:09:03,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:09:03,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:09:03,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:09:03,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:09:03,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:09:03,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 15:09:03,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:09:03,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:09:03,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:09:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:09:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 15:09:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:09:03,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:09:03,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:09:03,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:09:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:09:03,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:09:03,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:09:03,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:09:03,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:09:03,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:09:03,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 15:09:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:09:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:09:03,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:09:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:09:03,021 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:09:03,159 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:09:03,161 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:09:03,494 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:09:03,495 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:09:03,811 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:09:03,811 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-02-19 15:09:03,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:09:03 BoogieIcfgContainer [2024-02-19 15:09:03,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:09:03,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:09:03,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:09:03,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:09:03,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:09:02" (1/3) ... [2024-02-19 15:09:03,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28768b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:09:03, skipping insertion in model container [2024-02-19 15:09:03,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:09:02" (2/3) ... [2024-02-19 15:09:03,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28768b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:09:03, skipping insertion in model container [2024-02-19 15:09:03,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:09:03" (3/3) ... [2024-02-19 15:09:03,823 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-02-19 15:09:03,840 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:09:03,841 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:09:03,841 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:09:03,890 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:09:03,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 91 flow [2024-02-19 15:09:03,967 INFO L124 PetriNetUnfolderBase]: 7/32 cut-off events. [2024-02-19 15:09:03,967 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:09:03,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 7/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-02-19 15:09:03,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 91 flow [2024-02-19 15:09:03,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 80 flow [2024-02-19 15:09:03,986 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:09:03,994 INFO L369 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@65689be6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:09:03,994 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:09:04,012 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:09:04,012 INFO L124 PetriNetUnfolderBase]: 7/30 cut-off events. [2024-02-19 15:09:04,012 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:09:04,013 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:04,013 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:04,014 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:04,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash -201230065, now seen corresponding path program 1 times [2024-02-19 15:09:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976088229] [2024-02-19 15:09:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:09:04,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:04,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976088229] [2024-02-19 15:09:04,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976088229] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:09:04,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:09:04,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:09:04,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715040172] [2024-02-19 15:09:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:04,559 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:09:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:04,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:09:04,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:09:04,593 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2024-02-19 15:09:04,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-02-19 15:09:04,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:04,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2024-02-19 15:09:04,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:04,910 INFO L124 PetriNetUnfolderBase]: 507/728 cut-off events. [2024-02-19 15:09:04,910 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-02-19 15:09:04,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 728 events. 507/728 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2496 event pairs, 223 based on Foata normal form. 1/444 useless extension candidates. Maximal degree in co-relation 558. Up to 349 conditions per place. [2024-02-19 15:09:04,921 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 23 selfloop transitions, 8 changer transitions 24/59 dead transitions. [2024-02-19 15:09:04,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 264 flow [2024-02-19 15:09:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:09:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:09:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-02-19 15:09:04,934 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-02-19 15:09:04,938 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2024-02-19 15:09:04,938 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 59 transitions, 264 flow [2024-02-19 15:09:04,938 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-02-19 15:09:04,939 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:04,939 INFO L234 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-02-19 15:09:04,939 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:09:04,939 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:04,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash -818147672, now seen corresponding path program 1 times [2024-02-19 15:09:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286773820] [2024-02-19 15:09:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:09:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286773820] [2024-02-19 15:09:05,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286773820] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:05,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807763934] [2024-02-19 15:09:05,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:05,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:05,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:05,197 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-02-19 15:09:05,216 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-02-19 15:09:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:05,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:09:05,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:09:05,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:09:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:09:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807763934] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:05,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:09:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-02-19 15:09:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356765471] [2024-02-19 15:09:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:05,506 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:09:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:05,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:09:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-02-19 15:09:05,508 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-02-19 15:09:05,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 59 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:05,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:05,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-02-19 15:09:05,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:05,813 INFO L124 PetriNetUnfolderBase]: 842/1221 cut-off events. [2024-02-19 15:09:05,813 INFO L125 PetriNetUnfolderBase]: For 205/225 co-relation queries the response was YES. [2024-02-19 15:09:05,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 1221 events. 842/1221 cut-off events. For 205/225 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4872 event pairs, 339 based on Foata normal form. 0/796 useless extension candidates. Maximal degree in co-relation 1038. Up to 702 conditions per place. [2024-02-19 15:09:05,820 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 38 selfloop transitions, 4 changer transitions 54/99 dead transitions. [2024-02-19 15:09:05,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 99 transitions, 644 flow [2024-02-19 15:09:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:09:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:09:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-02-19 15:09:05,823 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-02-19 15:09:05,824 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2024-02-19 15:09:05,824 INFO L507 AbstractCegarLoop]: Abstraction has has 42 places, 99 transitions, 644 flow [2024-02-19 15:09:05,824 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:09:05,824 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:05,824 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:05,845 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-02-19 15:09:06,039 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:06,040 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:06,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1395292594, now seen corresponding path program 1 times [2024-02-19 15:09:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:06,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346771590] [2024-02-19 15:09:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:09:06,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346771590] [2024-02-19 15:09:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346771590] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255545334] [2024-02-19 15:09:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:06,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:06,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:06,293 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-02-19 15:09:06,314 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-02-19 15:09:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:06,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:09:06,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:09:06,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:09:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:09:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255545334] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:09:06,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:09:06,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-02-19 15:09:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107560504] [2024-02-19 15:09:06,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:09:06,607 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:09:06,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:06,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:09:06,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:09:06,617 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:09:06,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 99 transitions, 644 flow. Second operand has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 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-02-19 15:09:06,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:06,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:09:06,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:07,137 INFO L124 PetriNetUnfolderBase]: 1208/1775 cut-off events. [2024-02-19 15:09:07,137 INFO L125 PetriNetUnfolderBase]: For 1273/1298 co-relation queries the response was YES. [2024-02-19 15:09:07,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6710 conditions, 1775 events. 1208/1775 cut-off events. For 1273/1298 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7125 event pairs, 407 based on Foata normal form. 25/1337 useless extension candidates. Maximal degree in co-relation 2246. Up to 1006 conditions per place. [2024-02-19 15:09:07,147 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 83 selfloop transitions, 11 changer transitions 104/200 dead transitions. [2024-02-19 15:09:07,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 200 transitions, 1688 flow [2024-02-19 15:09:07,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:09:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:09:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-02-19 15:09:07,152 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-02-19 15:09:07,153 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2024-02-19 15:09:07,153 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 200 transitions, 1688 flow [2024-02-19 15:09:07,153 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 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-02-19 15:09:07,153 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:07,153 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:07,172 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-02-19 15:09:07,369 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-02-19 15:09:07,369 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:07,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1180009938, now seen corresponding path program 2 times [2024-02-19 15:09:07,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:07,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577823230] [2024-02-19 15:09:07,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:07,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:07,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:07,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577823230] [2024-02-19 15:09:07,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577823230] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:07,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011717350] [2024-02-19 15:09:07,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:09:07,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:07,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:07,569 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-02-19 15:09:07,570 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-02-19 15:09:07,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 15:09:07,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:09:07,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 15:09:07,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:09:07,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:09:07,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011717350] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:09:07,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:09:07,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-02-19 15:09:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948152149] [2024-02-19 15:09:07,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:07,752 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:09:07,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:07,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:09:07,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-02-19 15:09:07,759 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:09:07,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 200 transitions, 1688 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-02-19 15:09:07,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:07,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:09:07,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:08,260 INFO L124 PetriNetUnfolderBase]: 1909/2815 cut-off events. [2024-02-19 15:09:08,260 INFO L125 PetriNetUnfolderBase]: For 2283/2317 co-relation queries the response was YES. [2024-02-19 15:09:08,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13401 conditions, 2815 events. 1909/2815 cut-off events. For 2283/2317 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12691 event pairs, 390 based on Foata normal form. 35/2054 useless extension candidates. Maximal degree in co-relation 4383. Up to 1661 conditions per place. [2024-02-19 15:09:08,275 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 167 selfloop transitions, 20 changer transitions 255/444 dead transitions. [2024-02-19 15:09:08,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 444 transitions, 4629 flow [2024-02-19 15:09:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:09:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:09:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-02-19 15:09:08,276 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-02-19 15:09:08,277 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2024-02-19 15:09:08,277 INFO L507 AbstractCegarLoop]: Abstraction has has 54 places, 444 transitions, 4629 flow [2024-02-19 15:09:08,277 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-02-19 15:09:08,277 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:08,277 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:08,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-19 15:09:08,496 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:08,496 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:08,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1152197304, now seen corresponding path program 3 times [2024-02-19 15:09:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:08,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972425637] [2024-02-19 15:09:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:08,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:08,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972425637] [2024-02-19 15:09:08,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972425637] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:08,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052597763] [2024-02-19 15:09:08,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:09:08,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:08,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:08,708 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-02-19 15:09:08,720 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-02-19 15:09:08,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-19 15:09:08,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:09:08,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 15:09:08,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:09:08,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:09:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052597763] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:09:08,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:09:08,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-02-19 15:09:08,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940714677] [2024-02-19 15:09:08,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:08,874 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:09:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:09:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-02-19 15:09:08,877 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:09:08,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 444 transitions, 4629 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-02-19 15:09:08,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:08,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:09:08,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:09,456 INFO L124 PetriNetUnfolderBase]: 2258/3308 cut-off events. [2024-02-19 15:09:09,457 INFO L125 PetriNetUnfolderBase]: For 2839/2871 co-relation queries the response was YES. [2024-02-19 15:09:09,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18980 conditions, 3308 events. 2258/3308 cut-off events. For 2839/2871 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15215 event pairs, 368 based on Foata normal form. 33/2365 useless extension candidates. Maximal degree in co-relation 5668. Up to 2357 conditions per place. [2024-02-19 15:09:09,478 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 185 selfloop transitions, 28 changer transitions 359/574 dead transitions. [2024-02-19 15:09:09,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 574 transitions, 7133 flow [2024-02-19 15:09:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:09:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:09:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-02-19 15:09:09,480 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-02-19 15:09:09,480 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2024-02-19 15:09:09,480 INFO L507 AbstractCegarLoop]: Abstraction has has 59 places, 574 transitions, 7133 flow [2024-02-19 15:09:09,481 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-02-19 15:09:09,481 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:09,481 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:09,500 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-02-19 15:09:09,696 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:09,697 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:09,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1238530446, now seen corresponding path program 4 times [2024-02-19 15:09:09,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:09,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620182810] [2024-02-19 15:09:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:09,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620182810] [2024-02-19 15:09:09,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620182810] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281392088] [2024-02-19 15:09:09,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:09:09,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:09,961 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-02-19 15:09:09,982 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-02-19 15:09:10,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:09:10,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:09:10,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:09:10,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:10,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:09:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281392088] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:09:10,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:09:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-02-19 15:09:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028221802] [2024-02-19 15:09:10,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:09:10,210 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:09:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:09:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:09:10,218 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:09:10,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 574 transitions, 7133 flow. Second operand has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 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-02-19 15:09:10,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:10,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:09:10,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:11,134 INFO L124 PetriNetUnfolderBase]: 2023/2955 cut-off events. [2024-02-19 15:09:11,134 INFO L125 PetriNetUnfolderBase]: For 4088/4088 co-relation queries the response was YES. [2024-02-19 15:09:11,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19856 conditions, 2955 events. 2023/2955 cut-off events. For 4088/4088 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13049 event pairs, 186 based on Foata normal form. 0/2054 useless extension candidates. Maximal degree in co-relation 8605. Up to 1987 conditions per place. [2024-02-19 15:09:11,160 INFO L140 encePairwiseOnDemand]: 17/35 looper letters, 212 selfloop transitions, 75 changer transitions 452/740 dead transitions. [2024-02-19 15:09:11,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 740 transitions, 10495 flow [2024-02-19 15:09:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-19 15:09:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-19 15:09:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 225 transitions. [2024-02-19 15:09:11,162 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-02-19 15:09:11,163 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2024-02-19 15:09:11,163 INFO L507 AbstractCegarLoop]: Abstraction has has 76 places, 740 transitions, 10495 flow [2024-02-19 15:09:11,163 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.2) internal successors, (108), 15 states have internal predecessors, (108), 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-02-19 15:09:11,163 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:11,163 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:11,181 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-02-19 15:09:11,378 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:11,379 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:11,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 258423024, now seen corresponding path program 5 times [2024-02-19 15:09:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552100814] [2024-02-19 15:09:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:11,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:11,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552100814] [2024-02-19 15:09:11,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552100814] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:11,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551390348] [2024-02-19 15:09:11,598 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:09:11,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:11,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:11,599 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-02-19 15:09:11,622 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-02-19 15:09:11,734 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:09:11,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:09:11,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:09:11,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:11,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:09:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551390348] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:09:11,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:09:11,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-02-19 15:09:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391831348] [2024-02-19 15:09:11,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:09:11,865 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:09:11,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:11,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:09:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:09:11,870 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:09:11,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 740 transitions, 10495 flow. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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-02-19 15:09:11,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:11,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:09:11,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:12,889 INFO L124 PetriNetUnfolderBase]: 2227/3273 cut-off events. [2024-02-19 15:09:12,889 INFO L125 PetriNetUnfolderBase]: For 3866/3866 co-relation queries the response was YES. [2024-02-19 15:09:12,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25355 conditions, 3273 events. 2227/3273 cut-off events. For 3866/3866 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14881 event pairs, 186 based on Foata normal form. 0/2270 useless extension candidates. Maximal degree in co-relation 12295. Up to 2194 conditions per place. [2024-02-19 15:09:12,911 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 210 selfloop transitions, 80 changer transitions 592/883 dead transitions. [2024-02-19 15:09:12,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 883 transitions, 14266 flow [2024-02-19 15:09:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-19 15:09:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-19 15:09:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 239 transitions. [2024-02-19 15:09:12,913 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3593984962406015 [2024-02-19 15:09:12,913 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 60 predicate places. [2024-02-19 15:09:12,913 INFO L507 AbstractCegarLoop]: Abstraction has has 94 places, 883 transitions, 14266 flow [2024-02-19 15:09:12,914 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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-02-19 15:09:12,914 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:12,914 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:12,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-19 15:09:13,128 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:13,128 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:13,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2021309138, now seen corresponding path program 6 times [2024-02-19 15:09:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584372294] [2024-02-19 15:09:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:09:13,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:13,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584372294] [2024-02-19 15:09:13,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584372294] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:13,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719368131] [2024-02-19 15:09:13,287 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:09:13,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:13,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:13,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:09:13,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-19 15:09:13,414 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-02-19 15:09:13,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:09:13,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 15:09:13,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:09:13,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:09:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719368131] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:09:13,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-19 15:09:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-02-19 15:09:13,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166282732] [2024-02-19 15:09:13,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:09:13,463 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 15:09:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:09:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 15:09:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-02-19 15:09:13,470 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:09:13,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 883 transitions, 14266 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-02-19 15:09:13,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:09:13,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:09:13,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:09:14,200 INFO L124 PetriNetUnfolderBase]: 2265/3343 cut-off events. [2024-02-19 15:09:14,201 INFO L125 PetriNetUnfolderBase]: For 5119/5119 co-relation queries the response was YES. [2024-02-19 15:09:14,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29115 conditions, 3343 events. 2265/3343 cut-off events. For 5119/5119 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15403 event pairs, 186 based on Foata normal form. 1/2319 useless extension candidates. Maximal degree in co-relation 14271. Up to 2379 conditions per place. [2024-02-19 15:09:14,223 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 220 selfloop transitions, 44 changer transitions 645/920 dead transitions. [2024-02-19 15:09:14,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 920 transitions, 16694 flow [2024-02-19 15:09:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:09:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:09:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-02-19 15:09:14,225 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-02-19 15:09:14,228 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2024-02-19 15:09:14,228 INFO L507 AbstractCegarLoop]: Abstraction has has 99 places, 920 transitions, 16694 flow [2024-02-19 15:09:14,228 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-02-19 15:09:14,229 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:09:14,229 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:09:14,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-02-19 15:09:14,440 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:14,441 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:09:14,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:09:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash 470285269, now seen corresponding path program 1 times [2024-02-19 15:09:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:09:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505812586] [2024-02-19 15:09:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:09:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:09:15,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:09:15,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505812586] [2024-02-19 15:09:15,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505812586] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:09:15,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841134908] [2024-02-19 15:09:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:09:15,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:09:15,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:09:15,977 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 15:09:15,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-19 15:09:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:09:16,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjunts are in the unsatisfiable core [2024-02-19 15:09:16,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:09:16,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-02-19 15:09:16,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:09:16,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:09:16,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:09:16,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:09:16,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:09:16,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-02-19 15:09:16,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:09:16,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:09:16,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:09:16,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:09:16,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:09:16,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:09:16,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:09:16,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:09:16,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:09:16,375 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-02-19 15:09:16,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-02-19 15:09:16,419 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-02-19 15:09:16,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-02-19 15:09:16,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2024-02-19 15:09:16,816 INFO L349 Elim1Store]: treesize reduction 54, result has 41.3 percent of original size [2024-02-19 15:09:16,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 52 [2024-02-19 15:09:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:09:17,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:09:40,560 INFO L349 Elim1Store]: treesize reduction 102, result has 71.5 percent of original size [2024-02-19 15:09:40,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 1678 treesize of output 973 [2024-02-19 15:09:40,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:09:40,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1058 treesize of output 1010 [2024-02-19 15:09:40,925 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:09:40,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-02-19 15:09:41,318 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:09:41,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2024-02-19 15:09:41,772 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:09:41,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2024-02-19 15:09:42,018 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-02-19 15:09:42,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 25 [2024-02-19 15:09:42,855 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2024-02-19 15:09:42,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 118 [2024-02-19 15:09:43,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 186 [2024-02-19 15:09:51,407 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2024-02-19 15:09:51,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 218 [2024-02-19 15:09:52,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 462 treesize of output 414 [2024-02-19 15:10:15,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:10:15,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:10:15,275 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-02-19 15:10:15,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 50 [2024-02-19 15:10:19,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:10:19,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1474 treesize of output 1362 [2024-02-19 15:13:34,159 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-02-19 15:13:34,161 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-19 15:13:34,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-02-19 15:13:34,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-19 15:13:34,372 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-02-19 15:13:34,373 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:527) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 76 more [2024-02-19 15:13:34,378 INFO L158 Benchmark]: Toolchain (without parser) took 271961.19ms. Allocated memory was 56.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 25.3MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-02-19 15:13:34,378 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 56.6MB. Free memory was 32.8MB in the beginning and 32.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 15:13:34,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.67ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 25.1MB in the beginning and 47.8MB in the end (delta: -22.8MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-02-19 15:13:34,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.49ms. Allocated memory is still 77.6MB. Free memory was 47.8MB in the beginning and 45.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-19 15:13:34,379 INFO L158 Benchmark]: Boogie Preprocessor took 100.70ms. Allocated memory is still 77.6MB. Free memory was 45.6MB in the beginning and 42.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:13:34,379 INFO L158 Benchmark]: RCFGBuilder took 899.14ms. Allocated memory is still 77.6MB. Free memory was 42.3MB in the beginning and 35.0MB in the end (delta: 7.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-02-19 15:13:34,380 INFO L158 Benchmark]: TraceAbstraction took 270562.69ms. Allocated memory was 77.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 34.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-02-19 15:13:34,381 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 56.6MB. Free memory was 32.8MB in the beginning and 32.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.67ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 25.1MB in the beginning and 47.8MB in the end (delta: -22.8MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.49ms. Allocated memory is still 77.6MB. Free memory was 47.8MB in the beginning and 45.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.70ms. Allocated memory is still 77.6MB. Free memory was 45.6MB in the beginning and 42.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 899.14ms. Allocated memory is still 77.6MB. Free memory was 42.3MB in the beginning and 35.0MB in the end (delta: 7.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 270562.69ms. Allocated memory was 77.6MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 34.5MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f91e7b856fd6bf43c568f48d1703ed519fbb708e5c1360b96f8534e6fa4ed35d --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 15:13:36,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:13:36,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 15:13:36,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:13:36,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:13:36,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:13:36,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:13:36,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:13:36,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:13:36,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:13:36,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:13:36,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:13:36,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:13:36,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:13:36,714 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:13:36,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:13:36,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:13:36,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:13:36,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:13:36,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:13:36,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:13:36,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:13:36,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:13:36,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 15:13:36,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 15:13:36,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:13:36,717 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 15:13:36,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:13:36,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:13:36,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:13:36,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:13:36,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:13:36,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:13:36,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:13:36,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:13:36,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:13:36,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:13:36,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:13:36,721 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 15:13:36,721 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 15:13:36,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:13:36,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:13:36,722 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:13:36,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:13:36,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:13:36,722 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 15:13:36,722 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91e7b856fd6bf43c568f48d1703ed519fbb708e5c1360b96f8534e6fa4ed35d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:13:37,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:13:37,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:13:37,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:13:37,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:13:37,081 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:13:37,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-02-19 15:13:38,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:13:38,615 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:13:38,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-02-19 15:13:38,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2292cc5e3/2526e91f6d2b4d33952d53eaaf5348dd/FLAGb5746b29a [2024-02-19 15:13:38,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2292cc5e3/2526e91f6d2b4d33952d53eaaf5348dd [2024-02-19 15:13:38,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:13:38,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:13:38,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:13:38,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:13:38,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:13:38,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:13:38" (1/1) ... [2024-02-19 15:13:38,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bbfd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:38, skipping insertion in model container [2024-02-19 15:13:38,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:13:38" (1/1) ... [2024-02-19 15:13:38,678 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:13:38,898 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/popl20-more-vector-add.wvr.c[2598,2611] [2024-02-19 15:13:38,918 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:13:38,933 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 15:13:38,938 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:13:38,967 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/popl20-more-vector-add.wvr.c[2598,2611] [2024-02-19 15:13:38,976 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:13:38,982 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:13:39,018 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/popl20-more-vector-add.wvr.c[2598,2611] [2024-02-19 15:13:39,020 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:13:39,036 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:13:39,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39 WrapperNode [2024-02-19 15:13:39,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:13:39,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:13:39,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:13:39,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:13:39,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,097 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 200 [2024-02-19 15:13:39,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:13:39,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:13:39,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:13:39,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:13:39,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,148 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 2, 2, 2, 15]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 1, 7]. [2024-02-19 15:13:39,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:13:39,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:13:39,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:13:39,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:13:39,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (1/1) ... [2024-02-19 15:13:39,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:13:39,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:13:39,210 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-02-19 15:13:39,219 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-02-19 15:13:39,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:13:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 15:13:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 15:13:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 15:13:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 15:13:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-02-19 15:13:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:13:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 15:13:39,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 15:13:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 15:13:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 15:13:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-02-19 15:13:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:13:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:13:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:13:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:13:39,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:13:39,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:13:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:13:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:13:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:13:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:13:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 15:13:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 15:13:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 15:13:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 15:13:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-02-19 15:13:39,257 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 15:13:39,383 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:13:39,385 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:13:39,931 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:13:39,932 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:13:40,296 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:13:40,297 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-02-19 15:13:40,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:13:40 BoogieIcfgContainer [2024-02-19 15:13:40,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:13:40,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:13:40,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:13:40,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:13:40,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:13:38" (1/3) ... [2024-02-19 15:13:40,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ede4dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:13:40, skipping insertion in model container [2024-02-19 15:13:40,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:13:39" (2/3) ... [2024-02-19 15:13:40,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ede4dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:13:40, skipping insertion in model container [2024-02-19 15:13:40,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:13:40" (3/3) ... [2024-02-19 15:13:40,307 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-02-19 15:13:40,325 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:13:40,326 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:13:40,326 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:13:40,382 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:13:40,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 91 flow [2024-02-19 15:13:40,455 INFO L124 PetriNetUnfolderBase]: 7/32 cut-off events. [2024-02-19 15:13:40,456 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:13:40,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 7/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-02-19 15:13:40,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 91 flow [2024-02-19 15:13:40,466 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 80 flow [2024-02-19 15:13:40,481 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:13:40,489 INFO L369 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@3959598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:13:40,490 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:13:40,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:13:40,511 INFO L124 PetriNetUnfolderBase]: 7/30 cut-off events. [2024-02-19 15:13:40,511 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:13:40,511 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:40,512 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:13:40,513 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:40,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:40,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1073205263, now seen corresponding path program 1 times [2024-02-19 15:13:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:13:40,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677704203] [2024-02-19 15:13:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:13:40,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:40,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:13:40,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:13:40,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-02-19 15:13:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:13:40,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:13:40,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:13:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:13:40,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:13:40,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:13:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677704203] [2024-02-19 15:13:40,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677704203] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:13:40,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:13:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:13:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508389895] [2024-02-19 15:13:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:13:40,855 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:13:40,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:13:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:13:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:13:40,898 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-02-19 15:13:40,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-02-19 15:13:40,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:40,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-02-19 15:13:40,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:13:41,451 INFO L124 PetriNetUnfolderBase]: 436/623 cut-off events. [2024-02-19 15:13:41,452 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-02-19 15:13:41,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 623 events. 436/623 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2267 event pairs, 113 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 927. Up to 336 conditions per place. [2024-02-19 15:13:41,461 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 3 changer transitions 15/56 dead transitions. [2024-02-19 15:13:41,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 257 flow [2024-02-19 15:13:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:13:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:13:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-02-19 15:13:41,475 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-02-19 15:13:41,479 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2024-02-19 15:13:41,480 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 56 transitions, 257 flow [2024-02-19 15:13:41,481 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-02-19 15:13:41,481 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:41,481 INFO L234 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] [2024-02-19 15:13:41,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-02-19 15:13:41,684 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:41,685 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:41,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1217278381, now seen corresponding path program 1 times [2024-02-19 15:13:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:13:41,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75450123] [2024-02-19 15:13:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:13:41,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:41,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:13:41,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:13:41,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-02-19 15:13:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:13:41,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:13:41,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:13:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:13:41,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:13:41,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:13:41,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75450123] [2024-02-19 15:13:41,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75450123] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:13:41,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:13:41,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:13:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696120867] [2024-02-19 15:13:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:13:41,993 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:13:41,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:13:41,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:13:41,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:13:41,995 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2024-02-19 15:13:41,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 56 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:13:41,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:41,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2024-02-19 15:13:41,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:13:42,561 INFO L124 PetriNetUnfolderBase]: 673/971 cut-off events. [2024-02-19 15:13:42,561 INFO L125 PetriNetUnfolderBase]: For 89/99 co-relation queries the response was YES. [2024-02-19 15:13:42,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 971 events. 673/971 cut-off events. For 89/99 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3681 event pairs, 129 based on Foata normal form. 4/634 useless extension candidates. Maximal degree in co-relation 1365. Up to 612 conditions per place. [2024-02-19 15:13:42,568 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 34 selfloop transitions, 8 changer transitions 57/102 dead transitions. [2024-02-19 15:13:42,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 102 transitions, 669 flow [2024-02-19 15:13:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 15:13:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 15:13:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-02-19 15:13:42,578 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-19 15:13:42,579 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2024-02-19 15:13:42,580 INFO L507 AbstractCegarLoop]: Abstraction has has 43 places, 102 transitions, 669 flow [2024-02-19 15:13:42,580 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:13:42,580 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:42,580 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:13:42,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-02-19 15:13:42,785 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:42,785 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:42,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1505172706, now seen corresponding path program 1 times [2024-02-19 15:13:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:13:42,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73740957] [2024-02-19 15:13:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:13:42,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:42,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:13:42,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:13:42,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-02-19 15:13:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:13:43,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:13:43,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:13:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:13:43,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:13:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:13:43,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:13:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73740957] [2024-02-19 15:13:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73740957] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:13:43,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:13:43,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-02-19 15:13:43,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412099678] [2024-02-19 15:13:43,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:13:43,452 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:13:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:13:43,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:13:43,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:13:43,457 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:13:43,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 102 transitions, 669 flow. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 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-02-19 15:13:43,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:43,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:13:43,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:13:45,885 INFO L124 PetriNetUnfolderBase]: 1552/2315 cut-off events. [2024-02-19 15:13:45,886 INFO L125 PetriNetUnfolderBase]: For 1353/1507 co-relation queries the response was YES. [2024-02-19 15:13:45,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8880 conditions, 2315 events. 1552/2315 cut-off events. For 1353/1507 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10030 event pairs, 314 based on Foata normal form. 22/1688 useless extension candidates. Maximal degree in co-relation 2841. Up to 1769 conditions per place. [2024-02-19 15:13:45,899 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 151 selfloop transitions, 38 changer transitions 127/318 dead transitions. [2024-02-19 15:13:45,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 318 transitions, 2710 flow [2024-02-19 15:13:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 15:13:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 15:13:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 243 transitions. [2024-02-19 15:13:45,907 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2024-02-19 15:13:45,908 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2024-02-19 15:13:45,908 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 318 transitions, 2710 flow [2024-02-19 15:13:45,909 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 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-02-19 15:13:45,909 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:45,909 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:13:45,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:13:46,114 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:46,115 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:46,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -43759606, now seen corresponding path program 2 times [2024-02-19 15:13:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:13:46,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341203701] [2024-02-19 15:13:46,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:13:46,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:46,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:13:46,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:13:46,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-02-19 15:13:46,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-19 15:13:46,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:13:46,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:13:46,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:13:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:13:46,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:13:46,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:13:46,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341203701] [2024-02-19 15:13:46,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341203701] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:13:46,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:13:46,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 15:13:46,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631975541] [2024-02-19 15:13:46,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:13:46,513 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:13:46,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:13:46,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:13:46,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:13:46,519 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:13:46,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 318 transitions, 2710 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-02-19 15:13:46,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:46,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:13:46,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:13:48,302 INFO L124 PetriNetUnfolderBase]: 2479/3705 cut-off events. [2024-02-19 15:13:48,302 INFO L125 PetriNetUnfolderBase]: For 2803/3031 co-relation queries the response was YES. [2024-02-19 15:13:48,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17929 conditions, 3705 events. 2479/3705 cut-off events. For 2803/3031 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17827 event pairs, 284 based on Foata normal form. 36/2622 useless extension candidates. Maximal degree in co-relation 5599. Up to 2903 conditions per place. [2024-02-19 15:13:48,322 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 331 selfloop transitions, 44 changer transitions 331/708 dead transitions. [2024-02-19 15:13:48,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 708 transitions, 7435 flow [2024-02-19 15:13:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:13:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:13:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-02-19 15:13:48,325 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3892857142857143 [2024-02-19 15:13:48,326 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2024-02-19 15:13:48,326 INFO L507 AbstractCegarLoop]: Abstraction has has 64 places, 708 transitions, 7435 flow [2024-02-19 15:13:48,326 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-02-19 15:13:48,326 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:48,326 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:13:48,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-02-19 15:13:48,530 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:48,530 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:48,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash -295467070, now seen corresponding path program 3 times [2024-02-19 15:13:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:13:48,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675856147] [2024-02-19 15:13:48,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:13:48,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:48,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:13:48,533 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:13:48,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-02-19 15:13:48,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-19 15:13:48,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:13:48,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:13:48,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:13:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:13:48,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:13:48,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:13:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675856147] [2024-02-19 15:13:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675856147] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:13:48,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:13:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 15:13:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796119561] [2024-02-19 15:13:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:13:48,851 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:13:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:13:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:13:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:13:48,865 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:13:48,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 708 transitions, 7435 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-02-19 15:13:48,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:48,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:13:48,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:13:50,523 INFO L124 PetriNetUnfolderBase]: 2898/4300 cut-off events. [2024-02-19 15:13:50,523 INFO L125 PetriNetUnfolderBase]: For 3660/3920 co-relation queries the response was YES. [2024-02-19 15:13:50,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25026 conditions, 4300 events. 2898/4300 cut-off events. For 3660/3920 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 20782 event pairs, 278 based on Foata normal form. 40/3011 useless extension candidates. Maximal degree in co-relation 7356. Up to 3229 conditions per place. [2024-02-19 15:13:50,574 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 367 selfloop transitions, 60 changer transitions 497/926 dead transitions. [2024-02-19 15:13:50,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 926 transitions, 11565 flow [2024-02-19 15:13:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:13:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:13:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-02-19 15:13:50,577 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2024-02-19 15:13:50,578 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 37 predicate places. [2024-02-19 15:13:50,578 INFO L507 AbstractCegarLoop]: Abstraction has has 71 places, 926 transitions, 11565 flow [2024-02-19 15:13:50,578 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-02-19 15:13:50,578 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:50,578 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:13:50,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-02-19 15:13:50,788 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:50,789 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:50,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2095260680, now seen corresponding path program 4 times [2024-02-19 15:13:50,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:13:50,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803451790] [2024-02-19 15:13:50,790 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:13:50,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:50,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:13:50,791 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:13:50,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-02-19 15:13:50,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:13:50,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:13:50,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:13:50,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:13:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:13:51,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:13:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:13:51,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:13:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803451790] [2024-02-19 15:13:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803451790] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:13:51,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:13:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-02-19 15:13:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113481832] [2024-02-19 15:13:51,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:13:51,441 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:13:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:13:51,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:13:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-02-19 15:13:51,446 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:13:51,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 926 transitions, 11565 flow. Second operand has 16 states, 16 states have (on average 8.125) internal successors, (130), 16 states have internal predecessors, (130), 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-02-19 15:13:51,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:51,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:13:51,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:13:54,388 INFO L124 PetriNetUnfolderBase]: 2952/4381 cut-off events. [2024-02-19 15:13:54,388 INFO L125 PetriNetUnfolderBase]: For 4404/4664 co-relation queries the response was YES. [2024-02-19 15:13:54,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29742 conditions, 4381 events. 2952/4381 cut-off events. For 4404/4664 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 21421 event pairs, 270 based on Foata normal form. 38/3075 useless extension candidates. Maximal degree in co-relation 8743. Up to 3295 conditions per place. [2024-02-19 15:13:54,452 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 365 selfloop transitions, 80 changer transitions 507/954 dead transitions. [2024-02-19 15:13:54,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 954 transitions, 13815 flow [2024-02-19 15:13:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-19 15:13:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-19 15:13:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 275 transitions. [2024-02-19 15:13:54,456 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2024-02-19 15:13:54,457 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2024-02-19 15:13:54,457 INFO L507 AbstractCegarLoop]: Abstraction has has 88 places, 954 transitions, 13815 flow [2024-02-19 15:13:54,457 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.125) internal successors, (130), 16 states have internal predecessors, (130), 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-02-19 15:13:54,457 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:13:54,457 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:13:54,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-02-19 15:13:54,662 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:54,663 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:13:54,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:13:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1465041854, now seen corresponding path program 5 times [2024-02-19 15:13:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:13:54,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491228938] [2024-02-19 15:13:54,664 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:13:54,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:13:54,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:13:54,665 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:13:54,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-02-19 15:13:54,855 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:13:54,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:13:54,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2024-02-19 15:13:54,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:13:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:13:55,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:13:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:13:55,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:13:55,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491228938] [2024-02-19 15:13:55,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491228938] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:13:55,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:13:55,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 20 [2024-02-19 15:13:55,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120149198] [2024-02-19 15:13:55,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:13:55,427 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-19 15:13:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:13:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-19 15:13:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-02-19 15:13:55,434 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-02-19 15:13:55,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 954 transitions, 13815 flow. Second operand has 20 states, 20 states have (on average 6.7) internal successors, (134), 20 states have internal predecessors, (134), 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-02-19 15:13:55,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:13:55,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-02-19 15:13:55,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:14:00,387 INFO L124 PetriNetUnfolderBase]: 2421/3689 cut-off events. [2024-02-19 15:14:00,387 INFO L125 PetriNetUnfolderBase]: For 5600/5600 co-relation queries the response was YES. [2024-02-19 15:14:00,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28256 conditions, 3689 events. 2421/3689 cut-off events. For 5600/5600 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 17606 event pairs, 259 based on Foata normal form. 0/2722 useless extension candidates. Maximal degree in co-relation 9456. Up to 2635 conditions per place. [2024-02-19 15:14:00,410 INFO L140 encePairwiseOnDemand]: 17/35 looper letters, 362 selfloop transitions, 141 changer transitions 381/885 dead transitions. [2024-02-19 15:14:00,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 885 transitions, 14373 flow [2024-02-19 15:14:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-02-19 15:14:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-02-19 15:14:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 424 transitions. [2024-02-19 15:14:00,415 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3461224489795918 [2024-02-19 15:14:00,415 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 88 predicate places. [2024-02-19 15:14:00,415 INFO L507 AbstractCegarLoop]: Abstraction has has 122 places, 885 transitions, 14373 flow [2024-02-19 15:14:00,416 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.7) internal successors, (134), 20 states have internal predecessors, (134), 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-02-19 15:14:00,416 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:14:00,416 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:14:00,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-02-19 15:14:00,621 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:14:00,622 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:14:00,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:14:00,622 INFO L85 PathProgramCache]: Analyzing trace with hash -789086288, now seen corresponding path program 6 times [2024-02-19 15:14:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:14:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329545774] [2024-02-19 15:14:00,623 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:14:00,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:14:00,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:14:00,624 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:14:00,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-02-19 15:14:00,769 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-02-19 15:14:00,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:14:00,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:14:00,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:14:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:14:00,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:14:00,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:14:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329545774] [2024-02-19 15:14:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329545774] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:14:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:14:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-19 15:14:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786620289] [2024-02-19 15:14:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:14:00,927 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:14:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:14:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:14:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:14:00,938 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2024-02-19 15:14:00,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 885 transitions, 14373 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-02-19 15:14:00,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:14:00,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2024-02-19 15:14:00,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:14:02,410 INFO L124 PetriNetUnfolderBase]: 2439/3722 cut-off events. [2024-02-19 15:14:02,411 INFO L125 PetriNetUnfolderBase]: For 7400/7400 co-relation queries the response was YES. [2024-02-19 15:14:02,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32023 conditions, 3722 events. 2439/3722 cut-off events. For 7400/7400 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 17881 event pairs, 259 based on Foata normal form. 2/2749 useless extension candidates. Maximal degree in co-relation 10620. Up to 2653 conditions per place. [2024-02-19 15:14:02,434 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 385 selfloop transitions, 80 changer transitions 428/904 dead transitions. [2024-02-19 15:14:02,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 904 transitions, 16471 flow [2024-02-19 15:14:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:14:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:14:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-02-19 15:14:02,438 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2024-02-19 15:14:02,440 INFO L308 CegarLoopForPetriNet]: 34 programPoint places, 95 predicate places. [2024-02-19 15:14:02,442 INFO L507 AbstractCegarLoop]: Abstraction has has 129 places, 904 transitions, 16471 flow [2024-02-19 15:14:02,443 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-02-19 15:14:02,443 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:14:02,443 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:14:02,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-02-19 15:14:02,646 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:14:02,647 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:14:02,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:14:02,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1259794310, now seen corresponding path program 1 times [2024-02-19 15:14:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:14:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471123538] [2024-02-19 15:14:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:14:02,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:14:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:14:02,649 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:14:02,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-02-19 15:14:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:14:03,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 43 conjunts are in the unsatisfiable core [2024-02-19 15:14:03,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:14:03,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-02-19 15:14:03,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:14:03,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:14:03,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:14:03,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:14:03,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:14:03,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:14:03,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:14:03,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:14:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-02-19 15:14:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:14:03,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-19 15:14:03,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-19 15:14:03,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:03,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-19 15:14:03,397 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-02-19 15:14:03,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-02-19 15:14:03,514 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-02-19 15:14:03,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-02-19 15:14:03,697 INFO L349 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2024-02-19 15:14:03,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 31 [2024-02-19 15:14:04,271 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-02-19 15:14:04,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 208 treesize of output 145 [2024-02-19 15:14:05,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:14:05,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:05,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:05,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:05,357 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:14:05,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:05,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:14:05,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:14:05,362 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:14:05,380 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-02-19 15:14:05,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 11 disjoint index pairs (out of 190 index pairs), introduced 12 new quantified variables, introduced 64 case distinctions, treesize of input 551 treesize of output 287 [2024-02-19 15:14:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:14:06,835 INFO L327 TraceCheckSpWp]: Computing backward predicates...