./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.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-inc-subseq.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 cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a --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:01:46,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:01:46,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:01:47,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:01:47,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:01:47,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:01:47,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:01:47,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:01:47,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:01:47,034 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:01:47,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:01:47,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:01:47,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:01:47,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:01:47,036 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:01:47,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:01:47,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:01:47,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:01:47,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:01:47,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:01:47,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:01:47,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:01:47,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:01:47,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:01:47,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:01:47,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:01:47,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:01:47,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:01:47,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:01:47,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:01:47,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:01:47,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:01:47,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:01:47,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:01:47,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:01:47,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:01:47,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:01:47,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:01:47,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:01:47,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:01:47,042 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:01:47,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:01:47,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:01:47,043 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 -> cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:01:47,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:01:47,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:01:47,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:01:47,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:01:47,301 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:01:47,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-19 15:01:48,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:01:48,606 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:01:48,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-19 15:01:48,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c79aa124/18b3f71983984b7c853f046212d8ecda/FLAG9fada9536 [2024-02-19 15:01:48,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c79aa124/18b3f71983984b7c853f046212d8ecda [2024-02-19 15:01:48,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:01:48,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:01:48,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:01:48,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:01:48,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:01:48,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:48,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dab2d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48, skipping insertion in model container [2024-02-19 15:01:48,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:48,662 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:01:48,819 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-inc-subseq.wvr.c[2924,2937] [2024-02-19 15:01:48,833 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:01:48,844 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:01:48,877 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-inc-subseq.wvr.c[2924,2937] [2024-02-19 15:01:48,883 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:01:48,898 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:01:48,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48 WrapperNode [2024-02-19 15:01:48,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:01:48,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:01:48,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:01:48,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:01:48,906 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:01:48" (1/1) ... [2024-02-19 15:01:48,929 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:01:48" (1/1) ... [2024-02-19 15:01:48,950 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 197 [2024-02-19 15:01:48,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:01:48,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:01:48,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:01:48,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:01:48,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:48,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:48,961 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:48,986 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 2, 8]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-02-19 15:01:48,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:48,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:49,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:49,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:49,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:49,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:49,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:01:49,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:01:49,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:01:49,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:01:49,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (1/1) ... [2024-02-19 15:01:49,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:01:49,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:01:49,056 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:01:49,076 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:01:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:01:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:01:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:01:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:01:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:01:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:01:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:01:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:01:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:01:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:01:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:01:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:01:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:01:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:01:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:01:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:01:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:01:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:01:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:01:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:01:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:01:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:01:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:01:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:01:49,108 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:01:49,186 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:01:49,187 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:01:49,530 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:01:49,531 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:01:49,762 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:01:49,762 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 15:01:49,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:01:49 BoogieIcfgContainer [2024-02-19 15:01:49,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:01:49,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:01:49,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:01:49,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:01:49,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:01:48" (1/3) ... [2024-02-19 15:01:49,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a2a6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:01:49, skipping insertion in model container [2024-02-19 15:01:49,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:01:48" (2/3) ... [2024-02-19 15:01:49,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a2a6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:01:49, skipping insertion in model container [2024-02-19 15:01:49,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:01:49" (3/3) ... [2024-02-19 15:01:49,770 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-02-19 15:01:49,783 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:01:49,784 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:01:49,784 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:01:49,831 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:01:49,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2024-02-19 15:01:49,894 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-02-19 15:01:49,895 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:01:49,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 5/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-02-19 15:01:49,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2024-02-19 15:01:49,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 27 transitions, 66 flow [2024-02-19 15:01:49,914 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:01:49,921 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;@1a143e63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:01:49,922 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:01:49,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:01:49,933 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2024-02-19 15:01:49,933 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:01:49,933 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:49,934 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:49,934 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:01:49,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash 623822489, now seen corresponding path program 1 times [2024-02-19 15:01:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:49,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647564260] [2024-02-19 15:01:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:01:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:50,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647564260] [2024-02-19 15:01:50,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647564260] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:50,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:50,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:01:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112466191] [2024-02-19 15:01:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:50,330 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:01:50,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:50,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:01:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:01:50,407 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:50,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:01:50,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:50,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:50,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:50,526 INFO L124 PetriNetUnfolderBase]: 193/337 cut-off events. [2024-02-19 15:01:50,526 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-19 15:01:50,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 337 events. 193/337 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1328 event pairs, 51 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 618. Up to 185 conditions per place. [2024-02-19 15:01:50,530 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-02-19 15:01:50,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-02-19 15:01:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:01:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:01:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-02-19 15:01:50,539 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-19 15:01:50,541 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-02-19 15:01:50,541 INFO L507 AbstractCegarLoop]: Abstraction has has 32 places, 39 transitions, 163 flow [2024-02-19 15:01:50,541 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:01:50,542 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:50,542 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:50,542 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:01:50,542 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:01:50,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1096153256, now seen corresponding path program 1 times [2024-02-19 15:01:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950604258] [2024-02-19 15:01:50,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950604258] [2024-02-19 15:01:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950604258] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:50,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:01:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633530169] [2024-02-19 15:01:50,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:50,644 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:01:50,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:50,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:01:50,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:01:50,649 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:50,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 39 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:01:50,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:50,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:50,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:50,714 INFO L124 PetriNetUnfolderBase]: 193/338 cut-off events. [2024-02-19 15:01:50,714 INFO L125 PetriNetUnfolderBase]: For 54/130 co-relation queries the response was YES. [2024-02-19 15:01:50,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 338 events. 193/338 cut-off events. For 54/130 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1323 event pairs, 51 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 904. Up to 313 conditions per place. [2024-02-19 15:01:50,717 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 34 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-02-19 15:01:50,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 239 flow [2024-02-19 15:01:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:01:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:01:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2024-02-19 15:01:50,718 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-02-19 15:01:50,719 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-02-19 15:01:50,719 INFO L507 AbstractCegarLoop]: Abstraction has has 34 places, 40 transitions, 239 flow [2024-02-19 15:01:50,719 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:01:50,719 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:50,719 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:01:50,720 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:01:50,720 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:01:50,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1576562806, now seen corresponding path program 1 times [2024-02-19 15:01:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:50,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294342545] [2024-02-19 15:01:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:50,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294342545] [2024-02-19 15:01:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294342545] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:50,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:50,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:01:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271038216] [2024-02-19 15:01:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:50,798 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:01:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:50,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:01:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:01:50,799 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:50,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 40 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:01:50,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:50,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:50,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:50,864 INFO L124 PetriNetUnfolderBase]: 263/493 cut-off events. [2024-02-19 15:01:50,864 INFO L125 PetriNetUnfolderBase]: For 248/408 co-relation queries the response was YES. [2024-02-19 15:01:50,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 493 events. 263/493 cut-off events. For 248/408 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2096 event pairs, 38 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 1682. Up to 436 conditions per place. [2024-02-19 15:01:50,867 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 54 selfloop transitions, 3 changer transitions 3/64 dead transitions. [2024-02-19 15:01:50,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 509 flow [2024-02-19 15:01:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:01:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:01:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-19 15:01:50,868 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-02-19 15:01:50,869 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2024-02-19 15:01:50,869 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 64 transitions, 509 flow [2024-02-19 15:01:50,869 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:01:50,869 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:50,870 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] [2024-02-19 15:01:50,870 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:01:50,870 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:01:50,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash 787309211, now seen corresponding path program 1 times [2024-02-19 15:01:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960058307] [2024-02-19 15:01:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:50,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:50,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960058307] [2024-02-19 15:01:50,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960058307] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:50,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:50,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:01:50,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464846467] [2024-02-19 15:01:50,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:50,948 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:01:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:50,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:01:50,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:01:50,954 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:50,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 64 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:01:50,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:50,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:50,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:51,034 INFO L124 PetriNetUnfolderBase]: 257/492 cut-off events. [2024-02-19 15:01:51,034 INFO L125 PetriNetUnfolderBase]: For 425/707 co-relation queries the response was YES. [2024-02-19 15:01:51,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 492 events. 257/492 cut-off events. For 425/707 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2096 event pairs, 21 based on Foata normal form. 13/451 useless extension candidates. Maximal degree in co-relation 2104. Up to 447 conditions per place. [2024-02-19 15:01:51,037 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 62 selfloop transitions, 3 changer transitions 9/78 dead transitions. [2024-02-19 15:01:51,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 78 transitions, 781 flow [2024-02-19 15:01:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:01:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:01:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-02-19 15:01:51,039 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-02-19 15:01:51,041 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-02-19 15:01:51,041 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 78 transitions, 781 flow [2024-02-19 15:01:51,041 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:01:51,041 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:51,041 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:01:51,041 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 15:01:51,042 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:01:51,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1843767890, now seen corresponding path program 1 times [2024-02-19 15:01:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:51,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719791830] [2024-02-19 15:01:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:01:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719791830] [2024-02-19 15:01:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719791830] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:01:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:01:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:01:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031861168] [2024-02-19 15:01:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:01:51,155 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:01:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:01:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:01:51,156 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:01:51,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 78 transitions, 781 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:01:51,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:51,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:01:51,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:51,253 INFO L124 PetriNetUnfolderBase]: 315/621 cut-off events. [2024-02-19 15:01:51,253 INFO L125 PetriNetUnfolderBase]: For 560/634 co-relation queries the response was YES. [2024-02-19 15:01:51,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 621 events. 315/621 cut-off events. For 560/634 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2874 event pairs, 40 based on Foata normal form. 12/561 useless extension candidates. Maximal degree in co-relation 2510. Up to 567 conditions per place. [2024-02-19 15:01:51,257 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 64 selfloop transitions, 2 changer transitions 34/104 dead transitions. [2024-02-19 15:01:51,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 104 transitions, 1256 flow [2024-02-19 15:01:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:01:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:01:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-19 15:01:51,258 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-19 15:01:51,268 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2024-02-19 15:01:51,268 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 104 transitions, 1256 flow [2024-02-19 15:01:51,268 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:01:51,268 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:01:51,268 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] [2024-02-19 15:01:51,268 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 15:01:51,268 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:01:51,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:01:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 426916302, now seen corresponding path program 1 times [2024-02-19 15:01:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:01:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58897572] [2024-02-19 15:01:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:01:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:01:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58897572] [2024-02-19 15:01:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58897572] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:01:51,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807271271] [2024-02-19 15:01:51,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:01:51,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:01:51,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:01:51,981 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:01:52,000 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:01:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:01:52,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2024-02-19 15:01:52,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:01:52,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-02-19 15:01:52,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:52,158 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:01:52,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:52,170 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:01:52,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:52,177 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:01:52,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:52,185 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:01:52,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:01:52,192 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:01:52,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-02-19 15:01:52,268 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-19 15:01:52,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-19 15:01:52,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-19 15:01:52,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-02-19 15:01:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:01:52,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:01:53,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:53,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2024-02-19 15:01:53,293 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-02-19 15:01:53,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2024-02-19 15:01:53,319 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2024-02-19 15:01:53,320 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 70 treesize of output 66 [2024-02-19 15:01:53,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:53,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-02-19 15:01:53,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2024-02-19 15:01:53,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:01:53,358 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 36 treesize of output 35 [2024-02-19 15:01:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:01:53,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807271271] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:01:53,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:01:53,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2024-02-19 15:01:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781082453] [2024-02-19 15:01:53,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:01:53,411 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-02-19 15:01:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:01:53,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-02-19 15:01:53,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=885, Unknown=4, NotChecked=0, Total=1056 [2024-02-19 15:01:53,514 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:01:53,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 104 transitions, 1256 flow. Second operand has 33 states, 33 states have (on average 5.2727272727272725) internal successors, (174), 33 states have internal predecessors, (174), 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:01:53,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:01:53,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:01:53,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:59,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-02-19 15:02:00,254 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int#3| c_~queue~0.base)) (.cse6 (= c_~start~0 0))) (let ((.cse0 (<= c_~start~0 0)) (.cse1 (not (= c_~end~0 0))) (.cse3 (<= 1 c_~ok~0)) (.cse4 (<= (div c_~ok~0 256) 0)) (.cse2 (not .cse6)) (.cse5 (* c_~i~0 4)) (.cse11 (not (= (mod c_~ok~0 256) 0))) (.cse7 (< c_~end~0 0)) (.cse12 (< c_~n~0 (+ c_~end~0 1))) (.cse15 (select .cse13 c_~queue~0.offset))) (and .cse0 (or .cse1 (and .cse0 (or .cse2 (and .cse3 .cse4 (<= c_~v_old~0 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset .cse5))))))) .cse3 .cse6 (= |c_thread2Thread1of1ForFork0_~cond~0#1| 1) (or .cse1 (< c_~start~0 1)) (or .cse7 (let ((.cse10 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse8 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse8 (+ (select .cse9 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= (select .cse9 .cse10) .cse8))))) (or .cse11 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse10) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))))))) .cse12) (= c_~ok~0 1) .cse4 (= c_~n~0 1) (= c_~queue~0.offset 0) (<= (+ c_~i~0 1) c_~N~0) (or (and .cse3 (<= c_~v_old~0 (select .cse13 0)) .cse4) .cse2) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse14 (select (select |c_#memory_int#3| ~A~0.base) (+ ~A~0.offset .cse5)))) (and (= .cse14 .cse15) (not (= c_~queue~0.base ~A~0.base)) (<= c_~v_old~0 .cse14)))) (or (let ((.cse16 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse16) (or .cse11 .cse16))) .cse7 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse17 (select (select |c_#memory_int#3| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= c_~v_old~0 .cse17) (not (= c_~queue~0.base ~A~0.base)) (= .cse15 .cse17))))))) is different from false [2024-02-19 15:02:00,644 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_~start~0 0))) (let ((.cse0 (<= c_~start~0 0)) (.cse1 (not (= c_~end~0 0))) (.cse3 (<= 1 c_~ok~0)) (.cse4 (<= (div c_~ok~0 256) 0)) (.cse2 (not .cse5)) (.cse10 (not (= (mod c_~ok~0 256) 0))) (.cse6 (< c_~end~0 0)) (.cse11 (< c_~n~0 (+ c_~end~0 1))) (.cse12 (select |c_#memory_int#3| c_~queue~0.base))) (and .cse0 (or .cse1 (and .cse0 (or .cse2 (and .cse3 .cse4 (<= c_~v_old~0 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))))) .cse3 .cse5 (or .cse1 (< c_~start~0 1)) (or .cse6 (let ((.cse9 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse7 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse7 (+ (select .cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= (select .cse8 .cse9) .cse7))))) (or .cse10 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse9) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))))))) .cse11) (= c_~ok~0 1) .cse4 (= c_~n~0 1) (= c_~queue~0.offset 0) (or (and .cse3 (<= c_~v_old~0 (select .cse12 0)) .cse4) .cse2) (or (let ((.cse13 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse13) (or .cse10 .cse13))) .cse6 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse11) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse14 (select (select |c_#memory_int#3| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= c_~v_old~0 .cse14) (not (= c_~queue~0.base ~A~0.base)) (= (select .cse12 c_~queue~0.offset) .cse14))))))) is different from false [2024-02-19 15:02:00,703 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse14 (not (= (mod c_~ok~0 256) 0))) (.cse16 (select |c_#memory_int#3| c_~queue~0.base)) (.cse13 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse6 (select |c_#memory_int#3| c_~A~0.base))) (let ((.cse3 (select .cse6 (+ c_~A~0.offset (* c_~i~0 4)))) (.cse5 (select .cse16 .cse13)) (.cse9 (and (<= c_~v_old~0 (select .cse16 .cse12)) .cse14)) (.cse1 (<= 1 c_~ok~0)) (.cse0 (not (= c_~end~0 0))) (.cse2 (<= (div c_~ok~0 256) 0)) (.cse7 (< c_~end~0 0)) (.cse8 (< c_~n~0 (+ c_~end~0 1)))) (and (or .cse0 (and (<= c_~start~0 0) (or (not (= c_~start~0 0)) (and .cse1 .cse2 (<= c_~v_old~0 .cse3))))) (or (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse4 (select .cse6 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse4 c_~last~0) (not (= .cse4 .cse5))))) .cse7 .cse8 .cse9) (<= c_~v_old~0 c_~new~0) (or (not (= .cse3 .cse5)) .cse7 .cse8 .cse9) .cse1 (or .cse0 (< c_~start~0 1)) (or .cse7 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse10 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse10 (+ (select .cse11 .cse12) 1)) (not (= (select .cse11 .cse13) .cse10))))) (or .cse14 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse13) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset))))))) .cse8) (= c_~ok~0 1) .cse2 (= c_~n~0 1) (= c_~queue~0.offset 0) (or (let ((.cse15 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse15) (or .cse14 .cse15))) .cse7 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8)))) is different from false [2024-02-19 15:02:00,723 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))) (.cse1 (<= 1 c_~ok~0)) (.cse0 (not (= c_~end~0 0))) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (<= (div c_~ok~0 256) 0)) (.cse9 (not (= (mod c_~ok~0 256) 0))) (.cse6 (< c_~end~0 0)) (.cse7 (< c_~n~0 (+ c_~end~0 1)))) (and (or .cse0 (and (<= c_~start~0 0) (or (not (= c_~start~0 0)) (and .cse1 .cse2 (<= c_~v_old~0 .cse3))))) (<= c_~v_old~0 c_~new~0) (let ((.cse4 (select |c_#memory_int#3| c_~queue~0.base))) (or (not (= .cse3 (select .cse4 .cse5))) .cse6 .cse7 (and (<= c_~v_old~0 (select .cse4 .cse8)) .cse9))) .cse1 (or .cse0 (< c_~start~0 1)) (or .cse6 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse10 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse10 (+ (select .cse11 .cse8) 1)) (not (= (select .cse11 .cse5) .cse10))))) (or .cse9 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse5) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset))))))) .cse7) (= c_~ok~0 1) .cse2 (= c_~n~0 1) (= c_~queue~0.offset 0) (or (let ((.cse12 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse12) (or .cse9 .cse12))) .cse6 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7))) is different from false [2024-02-19 15:02:01,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse11 (not (= (mod c_~ok~0 256) 0))) (.cse13 (select |c_#memory_int#3| c_~queue~0.base)) (.cse10 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse3 (select |c_#memory_int#3| c_~A~0.base))) (let ((.cse0 (select .cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (.cse2 (select .cse13 .cse10)) (.cse6 (and (<= c_~v_old~0 (select .cse13 .cse9)) .cse11)) (.cse4 (< c_~end~0 0)) (.cse5 (< c_~n~0 (+ c_~end~0 1)))) (and (or (not (= c_~end~0 0)) (and (<= c_~start~0 0) (or (not (= c_~start~0 0)) (and (<= 1 c_~ok~0) (<= (div c_~ok~0 256) 0) (<= c_~v_old~0 .cse0))))) (or (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse1 (select .cse3 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse1 c_~last~0) (not (= .cse1 .cse2))))) .cse4 .cse5 .cse6) (or (not (= .cse0 .cse2)) .cse4 .cse5 .cse6) (or .cse4 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse7 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse7 (+ (select .cse8 .cse9) 1)) (not (= (select .cse8 .cse10) .cse7))))) (or .cse11 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse10) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset))))))) .cse5) (= c_~n~0 1) (= c_~queue~0.offset 0) (or (let ((.cse12 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse12) (or .cse11 .cse12))) .cse4 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5)))) is different from false [2024-02-19 15:02:01,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))) (.cse1 (<= 1 c_~ok~0)) (.cse0 (not (= c_~end~0 0))) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse5 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (<= (div c_~ok~0 256) 0)) (.cse9 (not (= (mod c_~ok~0 256) 0))) (.cse6 (< c_~end~0 0)) (.cse7 (< c_~n~0 (+ c_~end~0 1)))) (and (or .cse0 (and (<= c_~start~0 0) (or (not (= c_~start~0 0)) (and .cse1 .cse2 (<= c_~v_old~0 .cse3))))) (let ((.cse4 (select |c_#memory_int#3| c_~queue~0.base))) (or (not (= .cse3 (select .cse4 .cse5))) .cse6 .cse7 (and (<= c_~v_old~0 (select .cse4 .cse8)) .cse9))) .cse1 (or .cse0 (< c_~start~0 1)) (or .cse6 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse10 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse10 (+ (select .cse11 .cse8) 1)) (not (= (select .cse11 .cse5) .cse10))))) (or .cse9 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse5) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset))))))) .cse7) (= c_~ok~0 1) .cse2 (= c_~n~0 1) (= c_~queue~0.offset 0) (or (let ((.cse12 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse12) (or .cse9 .cse12))) .cse6 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7))) is different from false [2024-02-19 15:02:01,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse14 (not (= (mod c_~ok~0 256) 0))) (.cse16 (select |c_#memory_int#3| c_~queue~0.base)) (.cse13 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse6 (select |c_#memory_int#3| c_~A~0.base))) (let ((.cse3 (select .cse6 (+ c_~A~0.offset (* c_~i~0 4)))) (.cse5 (select .cse16 .cse13)) (.cse9 (and (<= c_~v_old~0 (select .cse16 .cse12)) .cse14)) (.cse1 (<= 1 c_~ok~0)) (.cse0 (not (= c_~end~0 0))) (.cse2 (<= (div c_~ok~0 256) 0)) (.cse7 (< c_~end~0 0)) (.cse8 (< c_~n~0 (+ c_~end~0 1)))) (and (or .cse0 (and (<= c_~start~0 0) (or (not (= c_~start~0 0)) (and .cse1 .cse2 (<= c_~v_old~0 .cse3))))) (or (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse4 (select .cse6 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse4 c_~last~0) (not (= .cse4 .cse5))))) .cse7 .cse8 .cse9) (<= c_~v_old~0 c_~new~0) (or (not (= .cse3 .cse5)) .cse7 .cse8 .cse9) .cse1 (or .cse0 (< c_~start~0 1)) (or .cse7 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse10 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse10 (+ (select .cse11 .cse12) 1)) (not (= (select .cse11 .cse13) .cse10))))) (or .cse14 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse13) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset))))))) .cse8) .cse2 (= c_~n~0 1) (= c_~queue~0.offset 0) (or (let ((.cse15 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse15) (or .cse14 .cse15))) .cse7 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8)))) is different from false [2024-02-19 15:02:07,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#3| c_~queue~0.base)) (.cse12 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse13 (not (= (mod c_~ok~0 256) 0)))) (let ((.cse0 (<= c_~start~0 0)) (.cse4 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))) (.cse9 (and (<= c_~v_old~0 (select .cse5 .cse12)) .cse13)) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse2 (<= 1 c_~ok~0)) (.cse3 (<= (div c_~ok~0 256) 0)) (.cse1 (not (= c_~start~0 0))) (.cse7 (< c_~end~0 0)) (.cse8 (< c_~n~0 (+ c_~end~0 1)))) (and .cse0 (or (not (= c_~end~0 0)) (and .cse0 (or .cse1 (and .cse2 .cse3 (<= c_~v_old~0 .cse4))))) (or (not (= .cse4 (select .cse5 .cse6))) .cse7 .cse8 .cse9) (or (= (mod |c_thread2Thread1of1ForFork0_~cond~0#1| 256) 0) .cse9) (or .cse7 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse10 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse10 (+ (select .cse11 .cse12) 1)) (not (= (select .cse11 .cse6) .cse10))))) (or .cse13 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse6) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset))))))) .cse8) (= c_~n~0 1) (= c_~queue~0.offset 0) (or (and .cse2 (<= c_~v_old~0 (select .cse5 0)) .cse3) .cse1) (or (let ((.cse14 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse14) (or .cse13 .cse14))) .cse7 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8)))) is different from false [2024-02-19 15:02:08,517 INFO L124 PetriNetUnfolderBase]: 2354/4017 cut-off events. [2024-02-19 15:02:08,517 INFO L125 PetriNetUnfolderBase]: For 6858/6858 co-relation queries the response was YES. [2024-02-19 15:02:08,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25517 conditions, 4017 events. 2354/4017 cut-off events. For 6858/6858 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 22510 event pairs, 245 based on Foata normal form. 9/3613 useless extension candidates. Maximal degree in co-relation 15801. Up to 3437 conditions per place. [2024-02-19 15:02:08,542 INFO L140 encePairwiseOnDemand]: 6/30 looper letters, 376 selfloop transitions, 187 changer transitions 279/843 dead transitions. [2024-02-19 15:02:08,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 843 transitions, 11495 flow [2024-02-19 15:02:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-02-19 15:02:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2024-02-19 15:02:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 787 transitions. [2024-02-19 15:02:08,547 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3545045045045045 [2024-02-19 15:02:08,548 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 85 predicate places. [2024-02-19 15:02:08,548 INFO L507 AbstractCegarLoop]: Abstraction has has 114 places, 843 transitions, 11495 flow [2024-02-19 15:02:08,548 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.2727272727272725) internal successors, (174), 33 states have internal predecessors, (174), 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:02:08,548 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:08,548 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] [2024-02-19 15:02:08,566 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:02:08,761 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-19 15:02:08,762 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:02:08,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 966319208, now seen corresponding path program 2 times [2024-02-19 15:02:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:08,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613971701] [2024-02-19 15:02:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:08,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613971701] [2024-02-19 15:02:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613971701] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:09,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286417031] [2024-02-19 15:02:09,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:02:09,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:09,424 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:02:09,424 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:02:09,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:02:09,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:09,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjunts are in the unsatisfiable core [2024-02-19 15:02:09,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:09,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-02-19 15:02:09,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:02:09,538 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:02:09,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:02:09,541 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:02:09,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:02:09,545 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:02:09,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:02:09,552 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:02:09,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:02:09,559 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:02:09,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-02-19 15:02:09,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-19 15:02:09,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-19 15:02:09,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-19 15:02:09,965 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-02-19 15:02:09,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-02-19 15:02:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:10,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:10,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:10,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 60 [2024-02-19 15:02:10,672 INFO L349 Elim1Store]: treesize reduction 4, result has 95.1 percent of original size [2024-02-19 15:02:10,672 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 184 treesize of output 208 [2024-02-19 15:02:10,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:10,709 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 124 treesize of output 156 [2024-02-19 15:02:11,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:11,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2024-02-19 15:02:11,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:11,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2024-02-19 15:02:11,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:11,903 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 66 treesize of output 61 [2024-02-19 15:02:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:02:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286417031] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:11,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-02-19 15:02:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942000818] [2024-02-19 15:02:11,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:11,974 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-19 15:02:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:11,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-19 15:02:11,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=680, Unknown=3, NotChecked=0, Total=870 [2024-02-19 15:02:12,006 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:02:12,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 843 transitions, 11495 flow. Second operand has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 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:02:12,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:12,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:02:12,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:15,712 INFO L124 PetriNetUnfolderBase]: 4777/8272 cut-off events. [2024-02-19 15:02:15,713 INFO L125 PetriNetUnfolderBase]: For 15473/15473 co-relation queries the response was YES. [2024-02-19 15:02:15,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61210 conditions, 8272 events. 4777/8272 cut-off events. For 15473/15473 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 53674 event pairs, 207 based on Foata normal form. 3/7405 useless extension candidates. Maximal degree in co-relation 40479. Up to 7173 conditions per place. [2024-02-19 15:02:15,766 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 1018 selfloop transitions, 200 changer transitions 716/1935 dead transitions. [2024-02-19 15:02:15,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 1935 transitions, 30175 flow [2024-02-19 15:02:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-02-19 15:02:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-02-19 15:02:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 400 transitions. [2024-02-19 15:02:15,769 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-02-19 15:02:15,770 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 118 predicate places. [2024-02-19 15:02:15,770 INFO L507 AbstractCegarLoop]: Abstraction has has 147 places, 1935 transitions, 30175 flow [2024-02-19 15:02:15,770 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 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:02:15,770 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:15,770 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:15,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-19 15:02:15,983 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,SelfDestructingSolverStorable6 [2024-02-19 15:02:15,984 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:02:15,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1864483730, now seen corresponding path program 3 times [2024-02-19 15:02:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:15,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059424267] [2024-02-19 15:02:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:02:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059424267] [2024-02-19 15:02:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059424267] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563069665] [2024-02-19 15:02:17,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:02:17,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:17,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:17,195 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:02:17,196 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:02:17,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 15:02:17,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:17,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 24 conjunts are in the unsatisfiable core [2024-02-19 15:02:17,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:17,542 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-02-19 15:02:17,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-02-19 15:02:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-02-19 15:02:17,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:21,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:02:21,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 176 [2024-02-19 15:02:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-02-19 15:02:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563069665] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:22,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:22,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 29 [2024-02-19 15:02:22,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724803761] [2024-02-19 15:02:22,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:22,489 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-19 15:02:22,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-19 15:02:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=723, Unknown=1, NotChecked=0, Total=870 [2024-02-19 15:02:26,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:02:30,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:02:34,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:02:34,630 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:02:34,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 1935 transitions, 30175 flow. Second operand has 30 states, 30 states have (on average 5.466666666666667) internal successors, (164), 30 states have internal predecessors, (164), 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:02:34,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:34,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:02:34,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:39,743 INFO L124 PetriNetUnfolderBase]: 5585/9938 cut-off events. [2024-02-19 15:02:39,743 INFO L125 PetriNetUnfolderBase]: For 20007/20007 co-relation queries the response was YES. [2024-02-19 15:02:39,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83652 conditions, 9938 events. 5585/9938 cut-off events. For 20007/20007 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 69895 event pairs, 205 based on Foata normal form. 156/8989 useless extension candidates. Maximal degree in co-relation 54524. Up to 8649 conditions per place. [2024-02-19 15:02:39,803 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 1352 selfloop transitions, 196 changer transitions 1171/2720 dead transitions. [2024-02-19 15:02:39,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 2720 transitions, 48087 flow [2024-02-19 15:02:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-02-19 15:02:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-02-19 15:02:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 361 transitions. [2024-02-19 15:02:39,806 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.353921568627451 [2024-02-19 15:02:39,808 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 150 predicate places. [2024-02-19 15:02:39,808 INFO L507 AbstractCegarLoop]: Abstraction has has 179 places, 2720 transitions, 48087 flow [2024-02-19 15:02:39,809 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.466666666666667) internal successors, (164), 30 states have internal predecessors, (164), 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:02:39,809 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:39,809 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:39,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:02:40,020 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:40,021 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:02:40,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash -335800909, now seen corresponding path program 4 times [2024-02-19 15:02:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425059026] [2024-02-19 15:02:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:02:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425059026] [2024-02-19 15:02:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425059026] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137451130] [2024-02-19 15:02:40,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:02:40,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:40,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:40,089 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:02:40,091 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:02:40,196 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:02:40,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:40,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:02:40,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:02:40,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:02:40,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137451130] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:40,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:40,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-02-19 15:02:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111195837] [2024-02-19 15:02:40,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:40,300 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 15:02:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 15:02:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-02-19 15:02:40,309 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:02:40,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 2720 transitions, 48087 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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:02:40,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:40,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:02:40,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:44,841 INFO L124 PetriNetUnfolderBase]: 8054/14427 cut-off events. [2024-02-19 15:02:44,841 INFO L125 PetriNetUnfolderBase]: For 33793/33793 co-relation queries the response was YES. [2024-02-19 15:02:44,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133898 conditions, 14427 events. 8054/14427 cut-off events. For 33793/33793 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 107097 event pairs, 485 based on Foata normal form. 165/12879 useless extension candidates. Maximal degree in co-relation 80966. Up to 12546 conditions per place. [2024-02-19 15:02:44,926 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 1671 selfloop transitions, 123 changer transitions 1817/3783 dead transitions. [2024-02-19 15:02:44,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 3783 transitions, 74904 flow [2024-02-19 15:02:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:02:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:02:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-02-19 15:02:44,927 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-02-19 15:02:44,927 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 146 predicate places. [2024-02-19 15:02:44,928 INFO L507 AbstractCegarLoop]: Abstraction has has 175 places, 3783 transitions, 74904 flow [2024-02-19 15:02:44,928 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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:02:44,928 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:44,928 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:44,950 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:02:45,150 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:45,151 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:02:45,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1602555281, now seen corresponding path program 5 times [2024-02-19 15:02:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:45,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314741651] [2024-02-19 15:02:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:45,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:02:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314741651] [2024-02-19 15:02:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314741651] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59247592] [2024-02-19 15:02:45,256 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:02:45,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:45,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:45,257 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:02:45,282 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:02:45,341 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 15:02:45,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:45,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:02:45,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:02:45,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:02:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59247592] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:45,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:45,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-02-19 15:02:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948669886] [2024-02-19 15:02:45,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:45,462 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 15:02:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 15:02:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-02-19 15:02:45,481 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:02:45,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 3783 transitions, 74904 flow. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 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:02:45,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:45,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:02:45,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:50,086 INFO L124 PetriNetUnfolderBase]: 4935/8997 cut-off events. [2024-02-19 15:02:50,086 INFO L125 PetriNetUnfolderBase]: For 32343/32343 co-relation queries the response was YES. [2024-02-19 15:02:50,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90474 conditions, 8997 events. 4935/8997 cut-off events. For 32343/32343 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 62199 event pairs, 403 based on Foata normal form. 166/8018 useless extension candidates. Maximal degree in co-relation 24935. Up to 7693 conditions per place. [2024-02-19 15:02:50,134 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 742 selfloop transitions, 3 changer transitions 1474/2273 dead transitions. [2024-02-19 15:02:50,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 2273 transitions, 49263 flow [2024-02-19 15:02:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:02:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:02:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2024-02-19 15:02:50,135 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2024-02-19 15:02:50,135 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 135 predicate places. [2024-02-19 15:02:50,135 INFO L507 AbstractCegarLoop]: Abstraction has has 164 places, 2273 transitions, 49263 flow [2024-02-19 15:02:50,136 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 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:02:50,136 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:50,136 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:50,147 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:02:50,347 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-19 15:02:50,348 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:02:50,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2030855933, now seen corresponding path program 6 times [2024-02-19 15:02:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:50,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625983784] [2024-02-19 15:02:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-19 15:02:50,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:50,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625983784] [2024-02-19 15:02:50,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625983784] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:50,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898847806] [2024-02-19 15:02:50,441 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:02:50,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:50,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:50,443 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:02:50,444 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:02:50,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-19 15:02:50,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:02:50,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:02:50,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-19 15:02:50,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-19 15:02:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898847806] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:02:50,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:02:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-02-19 15:02:50,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457939250] [2024-02-19 15:02:50,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:02:50,656 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:02:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:02:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:02:50,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:02:50,687 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:02:50,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 2273 transitions, 49263 flow. Second operand has 15 states, 15 states have (on average 9.6) internal successors, (144), 15 states have internal predecessors, (144), 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:02:50,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:02:50,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:02:50,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:02:53,482 INFO L124 PetriNetUnfolderBase]: 4925/9266 cut-off events. [2024-02-19 15:02:53,483 INFO L125 PetriNetUnfolderBase]: For 48655/48655 co-relation queries the response was YES. [2024-02-19 15:02:53,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100322 conditions, 9266 events. 4925/9266 cut-off events. For 48655/48655 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 66502 event pairs, 418 based on Foata normal form. 0/8251 useless extension candidates. Maximal degree in co-relation 27047. Up to 7813 conditions per place. [2024-02-19 15:02:53,535 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 583 selfloop transitions, 54 changer transitions 2042/2720 dead transitions. [2024-02-19 15:02:53,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 2720 transitions, 64541 flow [2024-02-19 15:02:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:02:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:02:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-02-19 15:02:53,536 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-02-19 15:02:53,537 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 143 predicate places. [2024-02-19 15:02:53,537 INFO L507 AbstractCegarLoop]: Abstraction has has 172 places, 2720 transitions, 64541 flow [2024-02-19 15:02:53,537 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.6) internal successors, (144), 15 states have internal predecessors, (144), 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:02:53,537 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:02:53,537 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:02:53,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-19 15:02:53,748 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:53,749 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:02:53,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:02:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash -265266641, now seen corresponding path program 7 times [2024-02-19 15:02:53,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:02:53,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596004048] [2024-02-19 15:02:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:02:53,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:02:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:02:55,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:02:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596004048] [2024-02-19 15:02:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596004048] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:02:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839136352] [2024-02-19 15:02:55,102 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 15:02:55,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:02:55,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:02:55,103 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:02:55,105 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:02:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:02:55,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 49 conjunts are in the unsatisfiable core [2024-02-19 15:02:55,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:02:56,078 INFO L349 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2024-02-19 15:02:56,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 52 [2024-02-19 15:02:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:02:56,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:02:58,711 INFO L349 Elim1Store]: treesize reduction 144, result has 87.7 percent of original size [2024-02-19 15:02:58,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 233 treesize of output 1086 [2024-02-19 15:05:40,819 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:05:40,825 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:05:40,825 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-19 15:05:40,838 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:05:41,026 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:05:41,028 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:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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) ... 69 more [2024-02-19 15:05:41,042 INFO L158 Benchmark]: Toolchain (without parser) took 232407.72ms. Allocated memory was 60.8MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 34.2MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-02-19 15:05:41,042 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 15:05:41,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.64ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 54.4MB in the end (delta: -20.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-02-19 15:05:41,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.78ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 52.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:05:41,043 INFO L158 Benchmark]: Boogie Preprocessor took 56.88ms. Allocated memory is still 77.6MB. Free memory was 52.0MB in the beginning and 49.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-19 15:05:41,045 INFO L158 Benchmark]: RCFGBuilder took 754.46ms. Allocated memory is still 77.6MB. Free memory was 49.2MB in the beginning and 33.3MB in the end (delta: 15.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-02-19 15:05:41,045 INFO L158 Benchmark]: TraceAbstraction took 231276.37ms. Allocated memory was 77.6MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 32.5MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-02-19 15:05:41,047 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.16ms. Allocated memory is still 60.8MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.64ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 33.9MB in the beginning and 54.4MB in the end (delta: -20.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.78ms. Allocated memory is still 77.6MB. Free memory was 54.4MB in the beginning and 52.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.88ms. Allocated memory is still 77.6MB. Free memory was 52.0MB in the beginning and 49.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 754.46ms. Allocated memory is still 77.6MB. Free memory was 49.2MB in the beginning and 33.3MB in the end (delta: 15.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 231276.37ms. Allocated memory was 77.6MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 32.5MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 2.3GB. 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-inc-subseq.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 cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a --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:05:42,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:05:42,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 15:05:42,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:05:42,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:05:42,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:05:42,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:05:42,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:05:42,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:05:42,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:05:42,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:05:42,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:05:42,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:05:42,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:05:42,920 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:05:42,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:05:42,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:05:42,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:05:42,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:05:42,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:05:42,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:05:42,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:05:42,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:05:42,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 15:05:42,923 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 15:05:42,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:05:42,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 15:05:42,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:05:42,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:05:42,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:05:42,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:05:42,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:05:42,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:05:42,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:05:42,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:05:42,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:05:42,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:05:42,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:05:42,927 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 15:05:42,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 15:05:42,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:05:42,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:05:42,927 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:05:42,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:05:42,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:05:42,928 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 15:05:42,928 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 -> cd94157895dc71e9f24fce5dbc4a71d4e4b55c4da9be28372139a3001decae0a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:05:43,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:05:43,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:05:43,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:05:43,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:05:43,208 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:05:43,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-19 15:05:44,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:05:44,475 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:05:44,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-02-19 15:05:44,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8dd24934/0638086e99104b14a602b82a5dd775cd/FLAG2d5867c79 [2024-02-19 15:05:44,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8dd24934/0638086e99104b14a602b82a5dd775cd [2024-02-19 15:05:44,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:05:44,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:05:44,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:05:44,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:05:44,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:05:44,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437a6fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44, skipping insertion in model container [2024-02-19 15:05:44,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,518 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:05:44,682 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-inc-subseq.wvr.c[2924,2937] [2024-02-19 15:05:44,696 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:05:44,717 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 15:05:44,722 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:05:44,731 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-inc-subseq.wvr.c[2924,2937] [2024-02-19 15:05:44,738 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:05:44,744 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:05:44,779 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-inc-subseq.wvr.c[2924,2937] [2024-02-19 15:05:44,781 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:05:44,800 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:05:44,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44 WrapperNode [2024-02-19 15:05:44,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:05:44,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:05:44,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:05:44,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:05:44,815 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:05:44" (1/1) ... [2024-02-19 15:05:44,833 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:05:44" (1/1) ... [2024-02-19 15:05:44,860 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 192 [2024-02-19 15:05:44,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:05:44,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:05:44,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:05:44,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:05:44,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,908 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 8, 2, 2]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 2, 1, 1]. [2024-02-19 15:05:44,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:05:44,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:05:44,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:05:44,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:05:44,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (1/1) ... [2024-02-19 15:05:44,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:05:44,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:05:44,966 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:05:44,984 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:05:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:05:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 15:05:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 15:05:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 15:05:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 15:05:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:05:45,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 15:05:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 15:05:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 15:05:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 15:05:45,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:05:45,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:05:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:05:45,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:05:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:05:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:05:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:05:45,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:05:45,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:05:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:05:45,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 15:05:45,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 15:05:45,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 15:05:45,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 15:05:45,019 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:05:45,143 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:05:45,145 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:05:45,463 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:05:45,464 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:05:45,741 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:05:45,742 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 15:05:45,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:05:45 BoogieIcfgContainer [2024-02-19 15:05:45,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:05:45,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:05:45,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:05:45,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:05:45,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:05:44" (1/3) ... [2024-02-19 15:05:45,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d12454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:05:45, skipping insertion in model container [2024-02-19 15:05:45,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:05:44" (2/3) ... [2024-02-19 15:05:45,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d12454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:05:45, skipping insertion in model container [2024-02-19 15:05:45,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:05:45" (3/3) ... [2024-02-19 15:05:45,752 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-02-19 15:05:45,766 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:05:45,767 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:05:45,767 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:05:45,817 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 15:05:45,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2024-02-19 15:05:45,875 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-02-19 15:05:45,875 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:05:45,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 5/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-02-19 15:05:45,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2024-02-19 15:05:45,883 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 27 transitions, 66 flow [2024-02-19 15:05:45,895 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:05:45,901 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;@3bb0f12a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:05:45,901 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 15:05:45,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:05:45,913 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2024-02-19 15:05:45,913 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 15:05:45,913 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:45,914 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:45,915 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:05:45,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1288847665, now seen corresponding path program 1 times [2024-02-19 15:05:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801098340] [2024-02-19 15:05:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:45,934 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:05:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:45,950 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:05:45,968 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:05:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:46,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-19 15:05:46,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:46,142 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:05:46,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:05:46,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:46,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801098340] [2024-02-19 15:05:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801098340] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:46,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:46,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:05:46,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966178273] [2024-02-19 15:05:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:46,152 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:05:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:46,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:05:46,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:05:46,180 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:05:46,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:05:46,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:46,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:05:46,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:46,369 INFO L124 PetriNetUnfolderBase]: 149/290 cut-off events. [2024-02-19 15:05:46,370 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-02-19 15:05:46,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 290 events. 149/290 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1072 event pairs, 51 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 482. Up to 127 conditions per place. [2024-02-19 15:05:46,375 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-02-19 15:05:46,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 174 flow [2024-02-19 15:05:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:05:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:05:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-19 15:05:46,385 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-02-19 15:05:46,389 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-02-19 15:05:46,389 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 41 transitions, 174 flow [2024-02-19 15:05:46,389 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:05:46,390 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:46,390 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:05:46,395 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:05:46,592 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:05:46,593 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:05:46,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2006503072, now seen corresponding path program 1 times [2024-02-19 15:05:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532444251] [2024-02-19 15:05:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:46,595 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:05:46,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:46,596 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:05:46,597 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:05:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:46,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:05:46,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:46,745 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:05:46,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:05:46,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:46,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532444251] [2024-02-19 15:05:46,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532444251] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:46,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:46,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:05:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097149802] [2024-02-19 15:05:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:46,748 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:05:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:46,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:05:46,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:05:46,759 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-19 15:05:46,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 41 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:05:46,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:46,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-19 15:05:46,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:46,995 INFO L124 PetriNetUnfolderBase]: 316/538 cut-off events. [2024-02-19 15:05:46,995 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-02-19 15:05:46,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 538 events. 316/538 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1820 event pairs, 41 based on Foata normal form. 16/488 useless extension candidates. Maximal degree in co-relation 1361. Up to 323 conditions per place. [2024-02-19 15:05:46,999 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 55 selfloop transitions, 3 changer transitions 34/93 dead transitions. [2024-02-19 15:05:46,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 93 transitions, 579 flow [2024-02-19 15:05:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-19 15:05:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-19 15:05:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-02-19 15:05:47,002 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-02-19 15:05:47,002 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2024-02-19 15:05:47,003 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 93 transitions, 579 flow [2024-02-19 15:05:47,003 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:05:47,003 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:47,003 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:05:47,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-02-19 15:05:47,206 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:05:47,207 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:05:47,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash 892026424, now seen corresponding path program 1 times [2024-02-19 15:05:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:47,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162703851] [2024-02-19 15:05:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:47,208 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:05:47,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:47,209 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:05:47,213 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:05:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:47,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:05:47,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:05:47,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:05:47,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162703851] [2024-02-19 15:05:47,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162703851] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:47,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:47,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:05:47,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393462164] [2024-02-19 15:05:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:47,394 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:05:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:05:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:05:47,396 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:05:47,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 93 transitions, 579 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:47,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:47,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:05:47,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:47,586 INFO L124 PetriNetUnfolderBase]: 387/675 cut-off events. [2024-02-19 15:05:47,587 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2024-02-19 15:05:47,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 675 events. 387/675 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2538 event pairs, 70 based on Foata normal form. 10/597 useless extension candidates. Maximal degree in co-relation 1762. Up to 458 conditions per place. [2024-02-19 15:05:47,591 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 52 selfloop transitions, 2 changer transitions 64/124 dead transitions. [2024-02-19 15:05:47,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 124 transitions, 1015 flow [2024-02-19 15:05:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:05:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:05:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-19 15:05:47,594 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-19 15:05:47,595 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2024-02-19 15:05:47,595 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 124 transitions, 1015 flow [2024-02-19 15:05:47,596 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:05:47,596 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:47,596 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:05:47,601 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 (4)] Ended with exit code 0 [2024-02-19 15:05:47,799 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:05:47,799 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:05:47,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 831084334, now seen corresponding path program 1 times [2024-02-19 15:05:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817546092] [2024-02-19 15:05:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:47,800 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:05:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:47,802 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:05:47,803 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:05:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:47,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:05:47,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:05:47,952 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:05:47,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:05:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817546092] [2024-02-19 15:05:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817546092] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:05:47,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:05:47,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:05:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930138402] [2024-02-19 15:05:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:05:47,953 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:05:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:05:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:05:47,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:05:47,959 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:05:47,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 124 transitions, 1015 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:05:47,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:05:47,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:05:47,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:05:48,168 INFO L124 PetriNetUnfolderBase]: 599/1059 cut-off events. [2024-02-19 15:05:48,168 INFO L125 PetriNetUnfolderBase]: For 924/924 co-relation queries the response was YES. [2024-02-19 15:05:48,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1059 events. 599/1059 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4724 event pairs, 94 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 3224. Up to 676 conditions per place. [2024-02-19 15:05:48,173 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 72 selfloop transitions, 7 changer transitions 115/200 dead transitions. [2024-02-19 15:05:48,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 200 transitions, 2040 flow [2024-02-19 15:05:48,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:05:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:05:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-19 15:05:48,174 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-19 15:05:48,175 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2024-02-19 15:05:48,175 INFO L507 AbstractCegarLoop]: Abstraction has has 43 places, 200 transitions, 2040 flow [2024-02-19 15:05:48,175 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:05:48,175 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:05:48,175 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] [2024-02-19 15:05:48,186 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:05:48,378 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:05:48,379 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:05:48,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:05:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1104953238, now seen corresponding path program 1 times [2024-02-19 15:05:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:05:48,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262041903] [2024-02-19 15:05:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:05:48,380 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:05:48,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:05:48,381 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:05:48,383 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:05:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:05:48,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:05:48,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:05:49,198 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-02-19 15:05:49,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 286 [2024-02-19 15:05:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:05:49,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:05,527 WARN L293 SmtUtils]: Spent 11.01s on a formula simplification. DAG size of input: 394 DAG size of output: 346 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-19 15:06:05,532 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-02-19 15:06:05,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 269 treesize of output 1571 [2024-02-19 15:06:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:06:11,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:06:11,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262041903] [2024-02-19 15:06:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262041903] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:11,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:06:11,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-02-19 15:06:11,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383496772] [2024-02-19 15:06:11,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:11,315 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 15:06:11,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:06:11,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 15:06:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2024-02-19 15:06:15,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:06:20,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-19 15:06:20,682 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2024-02-19 15:06:20,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 200 transitions, 2040 flow. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 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:06:20,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:20,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2024-02-19 15:06:20,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:24,947 INFO L124 PetriNetUnfolderBase]: 739/1290 cut-off events. [2024-02-19 15:06:24,947 INFO L125 PetriNetUnfolderBase]: For 1755/1755 co-relation queries the response was YES. [2024-02-19 15:06:24,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 1290 events. 739/1290 cut-off events. For 1755/1755 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5672 event pairs, 54 based on Foata normal form. 1/1143 useless extension candidates. Maximal degree in co-relation 5020. Up to 864 conditions per place. [2024-02-19 15:06:24,956 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 124 selfloop transitions, 16 changer transitions 159/302 dead transitions. [2024-02-19 15:06:24,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 302 transitions, 3677 flow [2024-02-19 15:06:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 15:06:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 15:06:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-02-19 15:06:24,962 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-02-19 15:06:24,964 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-02-19 15:06:24,964 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 302 transitions, 3677 flow [2024-02-19 15:06:24,964 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 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:06:24,964 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:24,965 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:24,974 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 (6)] Ended with exit code 0 [2024-02-19 15:06:25,174 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:06:25,175 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:06:25,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1026207875, now seen corresponding path program 2 times [2024-02-19 15:06:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:06:25,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797387357] [2024-02-19 15:06:25,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:06:25,176 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:06:25,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:06:25,178 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:06:25,178 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:06:25,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:06:25,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:25,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 15:06:25,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:06:26,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:06:27,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:06:27,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797387357] [2024-02-19 15:06:27,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797387357] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:27,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:06:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-02-19 15:06:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200722954] [2024-02-19 15:06:27,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:27,157 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 15:06:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:06:27,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 15:06:27,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-02-19 15:06:27,297 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:06:27,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 302 transitions, 3677 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:06:27,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:27,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:06:27,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:28,867 INFO L124 PetriNetUnfolderBase]: 1141/2002 cut-off events. [2024-02-19 15:06:28,867 INFO L125 PetriNetUnfolderBase]: For 4022/4022 co-relation queries the response was YES. [2024-02-19 15:06:28,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12722 conditions, 2002 events. 1141/2002 cut-off events. For 4022/4022 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9978 event pairs, 81 based on Foata normal form. 28/1800 useless extension candidates. Maximal degree in co-relation 5794. Up to 1456 conditions per place. [2024-02-19 15:06:28,877 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 130 selfloop transitions, 5 changer transitions 316/460 dead transitions. [2024-02-19 15:06:28,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 460 transitions, 6543 flow [2024-02-19 15:06:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:06:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:06:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-02-19 15:06:28,879 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2024-02-19 15:06:28,880 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2024-02-19 15:06:28,880 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 460 transitions, 6543 flow [2024-02-19 15:06:28,880 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:06:28,880 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:28,881 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:28,886 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:06:29,084 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:06:29,086 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:06:29,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash -587233457, now seen corresponding path program 3 times [2024-02-19 15:06:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:06:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252185093] [2024-02-19 15:06:29,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 15:06:29,087 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:06:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:06:29,089 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:06:29,091 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:06:29,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 15:06:29,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:29,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:06:29,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:30,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:06:32,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:06:32,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252185093] [2024-02-19 15:06:32,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252185093] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:32,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:06:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-02-19 15:06:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724776389] [2024-02-19 15:06:32,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:32,443 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-19 15:06:32,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:06:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-19 15:06:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-02-19 15:06:32,920 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:06:32,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 460 transitions, 6543 flow. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 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:06:32,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:32,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:06:32,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:35,761 INFO L124 PetriNetUnfolderBase]: 2619/4536 cut-off events. [2024-02-19 15:06:35,761 INFO L125 PetriNetUnfolderBase]: For 10894/10894 co-relation queries the response was YES. [2024-02-19 15:06:35,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32635 conditions, 4536 events. 2619/4536 cut-off events. For 10894/10894 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 24328 event pairs, 220 based on Foata normal form. 64/4072 useless extension candidates. Maximal degree in co-relation 12124. Up to 3594 conditions per place. [2024-02-19 15:06:35,826 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 365 selfloop transitions, 39 changer transitions 517/930 dead transitions. [2024-02-19 15:06:35,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 930 transitions, 15153 flow [2024-02-19 15:06:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:06:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:06:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-02-19 15:06:35,828 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-02-19 15:06:35,829 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-02-19 15:06:35,829 INFO L507 AbstractCegarLoop]: Abstraction has has 68 places, 930 transitions, 15153 flow [2024-02-19 15:06:35,829 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 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:06:35,829 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:35,830 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:35,834 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:06:36,033 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:06:36,034 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:06:36,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash -926767955, now seen corresponding path program 4 times [2024-02-19 15:06:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:06:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901405020] [2024-02-19 15:06:36,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 15:06:36,035 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:06:36,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:06:36,036 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:06:36,038 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:06:36,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 15:06:36,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:36,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-19 15:06:36,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 15:06:36,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:06:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:06:37,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:06:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901405020] [2024-02-19 15:06:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901405020] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:06:37,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:06:37,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2024-02-19 15:06:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889049641] [2024-02-19 15:06:37,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:06:37,960 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 15:06:37,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:06:37,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 15:06:37,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-02-19 15:06:38,438 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-19 15:06:38,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 930 transitions, 15153 flow. Second operand has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 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:06:38,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:06:38,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-19 15:06:38,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:06:41,545 INFO L124 PetriNetUnfolderBase]: 4102/7171 cut-off events. [2024-02-19 15:06:41,545 INFO L125 PetriNetUnfolderBase]: For 21860/21860 co-relation queries the response was YES. [2024-02-19 15:06:41,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57377 conditions, 7171 events. 4102/7171 cut-off events. For 21860/21860 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 43293 event pairs, 360 based on Foata normal form. 0/6539 useless extension candidates. Maximal degree in co-relation 18216. Up to 5618 conditions per place. [2024-02-19 15:06:41,582 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 546 selfloop transitions, 121 changer transitions 1073/1749 dead transitions. [2024-02-19 15:06:41,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 1749 transitions, 31967 flow [2024-02-19 15:06:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 15:06:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 15:06:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2024-02-19 15:06:41,584 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-02-19 15:06:41,585 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2024-02-19 15:06:41,585 INFO L507 AbstractCegarLoop]: Abstraction has has 78 places, 1749 transitions, 31967 flow [2024-02-19 15:06:41,585 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 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:06:41,585 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:06:41,585 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:06:41,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-02-19 15:06:41,808 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:06:41,809 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:06:41,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:06:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2069386453, now seen corresponding path program 5 times [2024-02-19 15:06:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:06:41,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486397752] [2024-02-19 15:06:41,809 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 15:06:41,810 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:06:41,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:06:41,810 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:06:41,811 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:06:42,040 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-02-19 15:06:42,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:06:42,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 37 conjunts are in the unsatisfiable core [2024-02-19 15:06:42,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:06:47,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,678 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:06:47,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:06:47,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:06:47,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:47,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:06:47,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-19 15:06:48,324 INFO L349 Elim1Store]: treesize reduction 732, result has 5.3 percent of original size [2024-02-19 15:06:48,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 28 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 280 treesize of output 104 [2024-02-19 15:06:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:06:53,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:07:11,628 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 326 DAG size of output: 252 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-19 15:07:11,629 INFO L349 Elim1Store]: treesize reduction 324, result has 78.2 percent of original size [2024-02-19 15:07:11,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 260 treesize of output 1213 [2024-02-19 15:08:28,195 WARN L293 SmtUtils]: Spent 29.68s on a formula simplification. DAG size of input: 843 DAG size of output: 584 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-19 15:08:28,196 INFO L349 Elim1Store]: treesize reduction 973, result has 73.5 percent of original size [2024-02-19 15:08:28,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 332 treesize of output 2767 Killed by 15