./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.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-prod-cons-eq.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 29fee1864b0d56497c32cb33e6aaa24ed5707e21c5b89ec418c6707c5ac52336 --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:15:51,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:15:51,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 15:15:51,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:15:51,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:15:51,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:15:51,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:15:51,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:15:51,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:15:51,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:15:51,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:15:51,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:15:51,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:15:51,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:15:51,111 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:15:51,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:15:51,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:15:51,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:15:51,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 15:15:51,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:15:51,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:15:51,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:15:51,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:15:51,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:15:51,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:15:51,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:15:51,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:15:51,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:15:51,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:15:51,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:15:51,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:15:51,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:15:51,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:15:51,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:15:51,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:15:51,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:15:51,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 15:15:51,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 15:15:51,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:15:51,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:15:51,118 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:15:51,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:15:51,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:15:51,118 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 -> 29fee1864b0d56497c32cb33e6aaa24ed5707e21c5b89ec418c6707c5ac52336 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:15:51,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:15:51,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:15:51,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:15:51,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:15:51,435 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:15:51,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-02-19 15:15:52,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:15:52,658 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:15:52,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-02-19 15:15:52,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbde13fc9/e421f44603b043f8abb01ff4ec9aa29d/FLAG85a5791e6 [2024-02-19 15:15:52,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbde13fc9/e421f44603b043f8abb01ff4ec9aa29d [2024-02-19 15:15:52,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:15:52,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:15:52,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:15:52,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:15:52,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:15:52,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:52,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2779e167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52, skipping insertion in model container [2024-02-19 15:15:52,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:52,698 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:15:52,863 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-prod-cons-eq.wvr.c[4380,4393] [2024-02-19 15:15:52,877 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:15:52,888 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:15:52,920 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-prod-cons-eq.wvr.c[4380,4393] [2024-02-19 15:15:52,928 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:15:52,949 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:15:52,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52 WrapperNode [2024-02-19 15:15:52,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:15:52,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:15:52,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:15:52,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:15:52,961 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:15:52" (1/1) ... [2024-02-19 15:15:52,985 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:15:52" (1/1) ... [2024-02-19 15:15:53,020 INFO L138 Inliner]: procedures = 28, calls = 80, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 411 [2024-02-19 15:15:53,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:15:53,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:15:53,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:15:53,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:15:53,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,068 INFO L175 MemorySlicer]: Split 30 memory accesses to 7 slices as follows [2, 2, 2, 3, 2, 3, 16]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 1, 1, 1, 1, 1, 4]. [2024-02-19 15:15:53,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:15:53,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:15:53,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:15:53,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:15:53,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (1/1) ... [2024-02-19 15:15:53,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:15:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:15:53,127 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:15:53,146 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:15:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:15:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-19 15:15:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-19 15:15:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-19 15:15:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-19 15:15:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-19 15:15:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-02-19 15:15:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-02-19 15:15:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:15:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 15:15:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 15:15:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 15:15:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 15:15:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 15:15:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-19 15:15:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-19 15:15:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 15:15:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 15:15:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 15:15:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 15:15:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 15:15:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-19 15:15:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-19 15:15:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-19 15:15:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-19 15:15:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-19 15:15:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-19 15:15:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-02-19 15:15:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-02-19 15:15:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-02-19 15:15:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:15:53,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:15:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:15:53,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:15:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:15:53,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:15:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 15:15:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 15:15:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 15:15:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 15:15:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 15:15:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-19 15:15:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-19 15:15:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:15:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:15:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:15:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:15:53,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:15:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:15:53,174 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:15:53,310 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:15:53,312 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:15:53,736 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:15:53,736 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:15:54,101 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:15:54,102 INFO L320 CfgBuilder]: Removed 9 assume(true) statements. [2024-02-19 15:15:54,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:15:54 BoogieIcfgContainer [2024-02-19 15:15:54,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:15:54,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:15:54,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:15:54,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:15:54,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:15:52" (1/3) ... [2024-02-19 15:15:54,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480646a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:15:54, skipping insertion in model container [2024-02-19 15:15:54,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:15:52" (2/3) ... [2024-02-19 15:15:54,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480646a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:15:54, skipping insertion in model container [2024-02-19 15:15:54,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:15:54" (3/3) ... [2024-02-19 15:15:54,111 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-02-19 15:15:54,139 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:15:54,139 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:15:54,139 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:15:54,179 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:15:54,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 105 flow [2024-02-19 15:15:54,239 INFO L124 PetriNetUnfolderBase]: 9/39 cut-off events. [2024-02-19 15:15:54,240 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:15:54,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 9/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-02-19 15:15:54,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 42 transitions, 105 flow [2024-02-19 15:15:54,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 38 transitions, 94 flow [2024-02-19 15:15:54,256 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:15:54,262 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;@50dd9e8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:15:54,262 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:15:54,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:15:54,276 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2024-02-19 15:15:54,277 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:15:54,277 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:54,277 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:15:54,278 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:54,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:54,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1465498536, now seen corresponding path program 1 times [2024-02-19 15:15:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696645109] [2024-02-19 15:15:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:54,627 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:15:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:54,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696645109] [2024-02-19 15:15:54,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696645109] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:54,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:54,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:15:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445782337] [2024-02-19 15:15:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:54,636 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:15:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:15:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:15:54,666 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:54,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:15:54,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:54,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:54,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:54,875 INFO L124 PetriNetUnfolderBase]: 347/569 cut-off events. [2024-02-19 15:15:54,875 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-02-19 15:15:54,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 569 events. 347/569 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2320 event pairs, 77 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 911. Up to 333 conditions per place. [2024-02-19 15:15:54,884 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 45 selfloop transitions, 3 changer transitions 1/54 dead transitions. [2024-02-19 15:15:54,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 236 flow [2024-02-19 15:15:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:15:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:15:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-19 15:15:54,894 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-02-19 15:15:54,897 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2024-02-19 15:15:54,897 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 54 transitions, 236 flow [2024-02-19 15:15:54,898 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:15:54,898 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:54,898 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:15:54,898 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 15:15:54,899 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:54,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1588723455, now seen corresponding path program 1 times [2024-02-19 15:15:54,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:54,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110201140] [2024-02-19 15:15:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:54,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:55,168 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:15:55,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:55,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110201140] [2024-02-19 15:15:55,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110201140] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:55,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:55,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:15:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513738392] [2024-02-19 15:15:55,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:55,172 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:15:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:15:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:15:55,175 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:55,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 54 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:55,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:55,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:55,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:55,388 INFO L124 PetriNetUnfolderBase]: 458/807 cut-off events. [2024-02-19 15:15:55,388 INFO L125 PetriNetUnfolderBase]: For 183/197 co-relation queries the response was YES. [2024-02-19 15:15:55,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 807 events. 458/807 cut-off events. For 183/197 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3779 event pairs, 114 based on Foata normal form. 26/758 useless extension candidates. Maximal degree in co-relation 1319. Up to 506 conditions per place. [2024-02-19 15:15:55,394 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 80 selfloop transitions, 10 changer transitions 5/100 dead transitions. [2024-02-19 15:15:55,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 100 transitions, 640 flow [2024-02-19 15:15:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:15:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:15:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-02-19 15:15:55,400 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-02-19 15:15:55,401 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2024-02-19 15:15:55,401 INFO L507 AbstractCegarLoop]: Abstraction has has 45 places, 100 transitions, 640 flow [2024-02-19 15:15:55,401 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:55,401 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:55,401 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:15:55,402 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 15:15:55,402 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:55,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash -844832375, now seen corresponding path program 1 times [2024-02-19 15:15:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:55,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510763140] [2024-02-19 15:15:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:15:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:55,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510763140] [2024-02-19 15:15:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510763140] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:55,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:55,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:15:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146423074] [2024-02-19 15:15:55,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:55,530 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:15:55,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:55,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:15:55,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:15:55,532 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:55,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 100 transitions, 640 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:55,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:55,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:55,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:55,793 INFO L124 PetriNetUnfolderBase]: 725/1363 cut-off events. [2024-02-19 15:15:55,794 INFO L125 PetriNetUnfolderBase]: For 722/770 co-relation queries the response was YES. [2024-02-19 15:15:55,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 1363 events. 725/1363 cut-off events. For 722/770 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7800 event pairs, 208 based on Foata normal form. 26/1296 useless extension candidates. Maximal degree in co-relation 1727. Up to 778 conditions per place. [2024-02-19 15:15:55,800 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 148 selfloop transitions, 16 changer transitions 15/184 dead transitions. [2024-02-19 15:15:55,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 184 transitions, 1562 flow [2024-02-19 15:15:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:15:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:15:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-02-19 15:15:55,803 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-02-19 15:15:55,804 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2024-02-19 15:15:55,804 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 184 transitions, 1562 flow [2024-02-19 15:15:55,804 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:55,804 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:55,805 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:15:55,805 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 15:15:55,805 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:55,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1312392148, now seen corresponding path program 1 times [2024-02-19 15:15:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:55,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900137476] [2024-02-19 15:15:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:15:55,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900137476] [2024-02-19 15:15:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900137476] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:15:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419176841] [2024-02-19 15:15:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:55,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:15:55,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:15:55,931 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:15:55,948 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:15:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:56,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-19 15:15:56,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:15:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 15:15:56,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:15:56,213 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:15:56,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419176841] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-19 15:15:56,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:15:56,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2024-02-19 15:15:56,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846710627] [2024-02-19 15:15:56,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:56,215 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:15:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:15:56,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:15:56,217 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:56,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 184 transitions, 1562 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:56,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:56,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:56,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:56,471 INFO L124 PetriNetUnfolderBase]: 725/1365 cut-off events. [2024-02-19 15:15:56,471 INFO L125 PetriNetUnfolderBase]: For 1307/1379 co-relation queries the response was YES. [2024-02-19 15:15:56,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 1365 events. 725/1365 cut-off events. For 1307/1379 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7776 event pairs, 208 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 2135. Up to 779 conditions per place. [2024-02-19 15:15:56,478 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 155 selfloop transitions, 11 changer transitions 15/186 dead transitions. [2024-02-19 15:15:56,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 186 transitions, 1940 flow [2024-02-19 15:15:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:15:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:15:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-02-19 15:15:56,479 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-02-19 15:15:56,480 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2024-02-19 15:15:56,480 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 186 transitions, 1940 flow [2024-02-19 15:15:56,480 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:56,480 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:56,480 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:15:56,494 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:15:56,695 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:15:56,695 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:56,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 288572287, now seen corresponding path program 1 times [2024-02-19 15:15:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:56,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963883981] [2024-02-19 15:15:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:56,764 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:15:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963883981] [2024-02-19 15:15:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963883981] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:56,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:56,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:15:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471384088] [2024-02-19 15:15:56,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:56,765 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:15:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:56,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:15:56,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:15:56,770 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:56,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 186 transitions, 1940 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:15:56,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:56,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:56,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:56,959 INFO L124 PetriNetUnfolderBase]: 627/1136 cut-off events. [2024-02-19 15:15:56,959 INFO L125 PetriNetUnfolderBase]: For 1215/1311 co-relation queries the response was YES. [2024-02-19 15:15:56,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6462 conditions, 1136 events. 627/1136 cut-off events. For 1215/1311 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5744 event pairs, 148 based on Foata normal form. 68/1094 useless extension candidates. Maximal degree in co-relation 3321. Up to 846 conditions per place. [2024-02-19 15:15:56,966 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 74 selfloop transitions, 3 changer transitions 102/184 dead transitions. [2024-02-19 15:15:56,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 184 transitions, 2275 flow [2024-02-19 15:15:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:15:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:15:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-19 15:15:56,967 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-02-19 15:15:56,969 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2024-02-19 15:15:56,969 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 184 transitions, 2275 flow [2024-02-19 15:15:56,969 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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:15:56,969 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:56,969 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:15:56,969 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 15:15:56,970 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:56,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -323046519, now seen corresponding path program 1 times [2024-02-19 15:15:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:56,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801690152] [2024-02-19 15:15:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:15:57,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:57,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801690152] [2024-02-19 15:15:57,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801690152] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:57,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:57,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:15:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508496536] [2024-02-19 15:15:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:57,061 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:15:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:15:57,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:15:57,062 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:57,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 184 transitions, 2275 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:57,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:57,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:57,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:57,325 INFO L124 PetriNetUnfolderBase]: 906/1711 cut-off events. [2024-02-19 15:15:57,325 INFO L125 PetriNetUnfolderBase]: For 1958/1998 co-relation queries the response was YES. [2024-02-19 15:15:57,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11437 conditions, 1711 events. 906/1711 cut-off events. For 1958/1998 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9988 event pairs, 296 based on Foata normal form. 34/1624 useless extension candidates. Maximal degree in co-relation 3855. Up to 1219 conditions per place. [2024-02-19 15:15:57,334 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 78 selfloop transitions, 2 changer transitions 202/287 dead transitions. [2024-02-19 15:15:57,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 287 transitions, 4168 flow [2024-02-19 15:15:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:15:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:15:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-02-19 15:15:57,335 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-02-19 15:15:57,336 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2024-02-19 15:15:57,336 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 287 transitions, 4168 flow [2024-02-19 15:15:57,336 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:57,336 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:57,336 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:15:57,336 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 15:15:57,337 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:57,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:57,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1879854238, now seen corresponding path program 1 times [2024-02-19 15:15:57,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298280563] [2024-02-19 15:15:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:57,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:15:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:57,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298280563] [2024-02-19 15:15:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298280563] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:57,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:15:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699471702] [2024-02-19 15:15:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:57,454 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:15:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:15:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:15:57,459 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:57,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 287 transitions, 4168 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:57,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:57,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:57,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:57,708 INFO L124 PetriNetUnfolderBase]: 808/1470 cut-off events. [2024-02-19 15:15:57,709 INFO L125 PetriNetUnfolderBase]: For 2913/2945 co-relation queries the response was YES. [2024-02-19 15:15:57,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10955 conditions, 1470 events. 808/1470 cut-off events. For 2913/2945 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7809 event pairs, 56 based on Foata normal form. 120/1469 useless extension candidates. Maximal degree in co-relation 5837. Up to 1199 conditions per place. [2024-02-19 15:15:57,718 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 85 selfloop transitions, 3 changer transitions 168/261 dead transitions. [2024-02-19 15:15:57,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 261 transitions, 4250 flow [2024-02-19 15:15:57,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:15:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:15:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-19 15:15:57,719 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-02-19 15:15:57,720 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2024-02-19 15:15:57,722 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 261 transitions, 4250 flow [2024-02-19 15:15:57,722 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:57,722 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:57,722 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:15:57,723 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 15:15:57,723 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:57,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1294819243, now seen corresponding path program 1 times [2024-02-19 15:15:57,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:57,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536292240] [2024-02-19 15:15:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:15:57,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:57,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536292240] [2024-02-19 15:15:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536292240] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:57,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:15:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615780108] [2024-02-19 15:15:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:57,912 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:15:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:57,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:15:57,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:15:57,912 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:57,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 261 transitions, 4250 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:15:57,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:57,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:57,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:58,190 INFO L124 PetriNetUnfolderBase]: 897/1742 cut-off events. [2024-02-19 15:15:58,190 INFO L125 PetriNetUnfolderBase]: For 4195/4239 co-relation queries the response was YES. [2024-02-19 15:15:58,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14601 conditions, 1742 events. 897/1742 cut-off events. For 4195/4239 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10134 event pairs, 112 based on Foata normal form. 64/1648 useless extension candidates. Maximal degree in co-relation 6547. Up to 1334 conditions per place. [2024-02-19 15:15:58,207 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 87 selfloop transitions, 2 changer transitions 296/390 dead transitions. [2024-02-19 15:15:58,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 390 transitions, 7156 flow [2024-02-19 15:15:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:15:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:15:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-02-19 15:15:58,208 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-02-19 15:15:58,210 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2024-02-19 15:15:58,210 INFO L507 AbstractCegarLoop]: Abstraction has has 64 places, 390 transitions, 7156 flow [2024-02-19 15:15:58,210 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:15:58,210 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:58,210 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:15:58,210 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 15:15:58,210 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:58,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1027092092, now seen corresponding path program 1 times [2024-02-19 15:15:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:58,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233578591] [2024-02-19 15:15:58,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-19 15:15:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:58,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233578591] [2024-02-19 15:15:58,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233578591] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:58,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:58,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:15:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322668552] [2024-02-19 15:15:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:58,403 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:15:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:15:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:15:58,409 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2024-02-19 15:15:58,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 390 transitions, 7156 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:58,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:58,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2024-02-19 15:15:58,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:15:59,177 INFO L124 PetriNetUnfolderBase]: 2525/4573 cut-off events. [2024-02-19 15:15:59,177 INFO L125 PetriNetUnfolderBase]: For 34388/34388 co-relation queries the response was YES. [2024-02-19 15:15:59,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37613 conditions, 4573 events. 2525/4573 cut-off events. For 34388/34388 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29152 event pairs, 200 based on Foata normal form. 122/4379 useless extension candidates. Maximal degree in co-relation 16666. Up to 3026 conditions per place. [2024-02-19 15:15:59,204 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 190 selfloop transitions, 40 changer transitions 520/752 dead transitions. [2024-02-19 15:15:59,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 752 transitions, 15328 flow [2024-02-19 15:15:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:15:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:15:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-02-19 15:15:59,206 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-02-19 15:15:59,206 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2024-02-19 15:15:59,206 INFO L507 AbstractCegarLoop]: Abstraction has has 68 places, 752 transitions, 15328 flow [2024-02-19 15:15:59,207 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:15:59,207 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:15:59,207 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:15:59,207 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 15:15:59,207 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:15:59,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:15:59,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1423845264, now seen corresponding path program 2 times [2024-02-19 15:15:59,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:15:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433168422] [2024-02-19 15:15:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:15:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:15:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:15:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:15:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:15:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433168422] [2024-02-19 15:15:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433168422] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:15:59,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:15:59,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:15:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569001780] [2024-02-19 15:15:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:15:59,408 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:15:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:15:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:15:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:15:59,409 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:15:59,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 752 transitions, 15328 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:15:59,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:15:59,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:15:59,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:16:00,427 INFO L124 PetriNetUnfolderBase]: 3291/6139 cut-off events. [2024-02-19 15:16:00,428 INFO L125 PetriNetUnfolderBase]: For 61399/61399 co-relation queries the response was YES. [2024-02-19 15:16:00,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54673 conditions, 6139 events. 3291/6139 cut-off events. For 61399/61399 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 43188 event pairs, 288 based on Foata normal form. 104/5917 useless extension candidates. Maximal degree in co-relation 18270. Up to 3944 conditions per place. [2024-02-19 15:16:00,463 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 222 selfloop transitions, 4 changer transitions 776/1010 dead transitions. [2024-02-19 15:16:00,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 1010 transitions, 22678 flow [2024-02-19 15:16:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:16:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:16:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2024-02-19 15:16:00,465 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-02-19 15:16:00,466 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2024-02-19 15:16:00,466 INFO L507 AbstractCegarLoop]: Abstraction has has 72 places, 1010 transitions, 22678 flow [2024-02-19 15:16:00,466 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:16:00,466 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:16:00,466 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:16:00,466 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 15:16:00,466 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:16:00,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:16:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1042114793, now seen corresponding path program 1 times [2024-02-19 15:16:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:16:00,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827398805] [2024-02-19 15:16:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:16:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:16:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:16:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 15:16:00,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:16:00,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827398805] [2024-02-19 15:16:00,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827398805] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:16:00,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679999986] [2024-02-19 15:16:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:16:00,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:16:00,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:16:00,693 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:16:00,695 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:16:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:16:00,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 15:16:00,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:16:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 15:16:00,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:16:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 15:16:01,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679999986] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:16:01,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:16:01,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-02-19 15:16:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281250922] [2024-02-19 15:16:01,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:16:01,010 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 15:16:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:16:01,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 15:16:01,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-02-19 15:16:01,013 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2024-02-19 15:16:01,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 1010 transitions, 22678 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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:16:01,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:16:01,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2024-02-19 15:16:01,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:16:02,747 INFO L124 PetriNetUnfolderBase]: 4415/7136 cut-off events. [2024-02-19 15:16:02,748 INFO L125 PetriNetUnfolderBase]: For 118844/118844 co-relation queries the response was YES. [2024-02-19 15:16:02,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66031 conditions, 7136 events. 4415/7136 cut-off events. For 118844/118844 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 40779 event pairs, 288 based on Foata normal form. 706/7368 useless extension candidates. Maximal degree in co-relation 32448. Up to 4362 conditions per place. [2024-02-19 15:16:02,796 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 380 selfloop transitions, 52 changer transitions 616/1049 dead transitions. [2024-02-19 15:16:02,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 1049 transitions, 25211 flow [2024-02-19 15:16:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 15:16:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 15:16:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 207 transitions. [2024-02-19 15:16:02,798 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3791208791208791 [2024-02-19 15:16:02,798 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2024-02-19 15:16:02,798 INFO L507 AbstractCegarLoop]: Abstraction has has 84 places, 1049 transitions, 25211 flow [2024-02-19 15:16:02,799 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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:16:02,799 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:16:02,799 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:16:02,811 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:16:03,010 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,SelfDestructingSolverStorable10 [2024-02-19 15:16:03,011 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:16:03,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:16:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 361281269, now seen corresponding path program 1 times [2024-02-19 15:16:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:16:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219932997] [2024-02-19 15:16:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:16:03,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:16:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:16:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-19 15:16:03,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:16:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219932997] [2024-02-19 15:16:03,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219932997] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:16:03,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:16:03,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:16:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654611931] [2024-02-19 15:16:03,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:16:03,121 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:16:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:16:03,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:16:03,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:16:03,122 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:16:03,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 1049 transitions, 25211 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:16:03,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:16:03,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:16:03,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:16:04,181 INFO L124 PetriNetUnfolderBase]: 3884/6273 cut-off events. [2024-02-19 15:16:04,181 INFO L125 PetriNetUnfolderBase]: For 119518/119518 co-relation queries the response was YES. [2024-02-19 15:16:04,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63677 conditions, 6273 events. 3884/6273 cut-off events. For 119518/119518 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 34136 event pairs, 218 based on Foata normal form. 464/6367 useless extension candidates. Maximal degree in co-relation 40364. Up to 4093 conditions per place. [2024-02-19 15:16:04,232 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 512 selfloop transitions, 42 changer transitions 538/1123 dead transitions. [2024-02-19 15:16:04,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 1123 transitions, 29207 flow [2024-02-19 15:16:04,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:16:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:16:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-19 15:16:04,233 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-02-19 15:16:04,234 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2024-02-19 15:16:04,234 INFO L507 AbstractCegarLoop]: Abstraction has has 86 places, 1123 transitions, 29207 flow [2024-02-19 15:16:04,234 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:16:04,234 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:16:04,234 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:16:04,234 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-19 15:16:04,235 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:16:04,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:16:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 734656702, now seen corresponding path program 1 times [2024-02-19 15:16:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:16:04,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546950248] [2024-02-19 15:16:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:16:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:16:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:16:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:16:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:16:05,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546950248] [2024-02-19 15:16:05,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546950248] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:16:05,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034007060] [2024-02-19 15:16:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:16:05,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:16:05,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:16:05,177 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:16:05,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:16:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:16:05,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 35 conjunts are in the unsatisfiable core [2024-02-19 15:16:05,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:16:05,450 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 15 treesize of output 1 [2024-02-19 15:16:05,476 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:16:05,479 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:16:05,762 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 31 treesize of output 23 [2024-02-19 15:16:05,765 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 23 treesize of output 15 [2024-02-19 15:16:05,790 INFO L349 Elim1Store]: treesize reduction 20, result has 62.3 percent of original size [2024-02-19 15:16:05,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2024-02-19 15:16:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:16:05,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:16:09,630 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 95 treesize of output 91 [2024-02-19 15:16:09,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:16:09,644 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 314 treesize of output 298 [2024-02-19 15:16:09,651 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 290 treesize of output 274 [2024-02-19 15:16:09,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:16:09,667 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 806 treesize of output 718 [2024-02-19 15:16:13,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-19 15:16:13,354 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 1968 treesize of output 1892 [2024-02-19 15:16:14,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 786 treesize of output 690 [2024-02-19 15:22:19,596 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:22:19,597 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:22:19,597 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-19 15:22:19,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-19 15:22:19,798 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:22:19,799 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.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$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) ... 84 more [2024-02-19 15:22:19,803 INFO L158 Benchmark]: Toolchain (without parser) took 387126.48ms. Allocated memory was 65.0MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 42.2MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-02-19 15:22:19,803 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.6MB in the end (delta: 50.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-19 15:22:19,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.83ms. Allocated memory is still 65.0MB. Free memory was 41.9MB in the beginning and 28.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-02-19 15:22:19,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.89ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 28.1MB in the beginning and 65.8MB in the end (delta: -37.7MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-02-19 15:22:19,804 INFO L158 Benchmark]: Boogie Preprocessor took 70.04ms. Allocated memory is still 88.1MB. Free memory was 65.8MB in the beginning and 61.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-19 15:22:19,804 INFO L158 Benchmark]: RCFGBuilder took 1010.64ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 61.2MB in the beginning and 45.7MB in the end (delta: 15.5MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-02-19 15:22:19,804 INFO L158 Benchmark]: TraceAbstraction took 385698.36ms. Allocated memory was 111.1MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 45.0MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-02-19 15:22:19,805 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.17ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.6MB in the end (delta: 50.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.83ms. Allocated memory is still 65.0MB. Free memory was 41.9MB in the beginning and 28.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.89ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 28.1MB in the beginning and 65.8MB in the end (delta: -37.7MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.04ms. Allocated memory is still 88.1MB. Free memory was 65.8MB in the beginning and 61.2MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1010.64ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 61.2MB in the beginning and 45.7MB in the end (delta: 15.5MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 385698.36ms. Allocated memory was 111.1MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 45.0MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. 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-prod-cons-eq.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 29fee1864b0d56497c32cb33e6aaa24ed5707e21c5b89ec418c6707c5ac52336 --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:22:21,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 15:22:21,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-19 15:22:21,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 15:22:21,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 15:22:21,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 15:22:21,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 15:22:21,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 15:22:21,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 15:22:21,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 15:22:21,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 15:22:21,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 15:22:21,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 15:22:21,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 15:22:21,670 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 15:22:21,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 15:22:21,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 15:22:21,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 15:22:21,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 15:22:21,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 15:22:21,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 15:22:21,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 15:22:21,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 15:22:21,672 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-19 15:22:21,672 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-19 15:22:21,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 15:22:21,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-19 15:22:21,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 15:22:21,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 15:22:21,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 15:22:21,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 15:22:21,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 15:22:21,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 15:22:21,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 15:22:21,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:22:21,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 15:22:21,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 15:22:21,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 15:22:21,676 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-19 15:22:21,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-19 15:22:21,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 15:22:21,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 15:22:21,677 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 15:22:21,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 15:22:21,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 15:22:21,677 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-19 15:22:21,677 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 -> 29fee1864b0d56497c32cb33e6aaa24ed5707e21c5b89ec418c6707c5ac52336 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 15:22:21,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 15:22:21,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 15:22:21,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 15:22:21,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 15:22:21,949 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 15:22:21,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-02-19 15:22:23,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 15:22:23,316 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 15:22:23,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-02-19 15:22:23,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d7609b1/87b492af1ab94581b9cb01578558c24b/FLAG09de13cbc [2024-02-19 15:22:23,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d7609b1/87b492af1ab94581b9cb01578558c24b [2024-02-19 15:22:23,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 15:22:23,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 15:22:23,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 15:22:23,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 15:22:23,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 15:22:23,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1849ea7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23, skipping insertion in model container [2024-02-19 15:22:23,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,379 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:22:23,530 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-prod-cons-eq.wvr.c[4380,4393] [2024-02-19 15:22:23,537 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:22:23,546 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-19 15:22:23,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 15:22:23,562 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-prod-cons-eq.wvr.c[4380,4393] [2024-02-19 15:22:23,577 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:22:23,584 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 15:22:23,602 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-prod-cons-eq.wvr.c[4380,4393] [2024-02-19 15:22:23,609 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 15:22:23,625 INFO L206 MainTranslator]: Completed translation [2024-02-19 15:22:23,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23 WrapperNode [2024-02-19 15:22:23,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 15:22:23,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 15:22:23,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 15:22:23,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 15:22:23,631 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:22:23" (1/1) ... [2024-02-19 15:22:23,639 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:22:23" (1/1) ... [2024-02-19 15:22:23,658 INFO L138 Inliner]: procedures = 30, calls = 80, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 399 [2024-02-19 15:22:23,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 15:22:23,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 15:22:23,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 15:22:23,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 15:22:23,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,701 INFO L175 MemorySlicer]: Split 30 memory accesses to 7 slices as follows [2, 2, 2, 2, 16, 3, 3]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 1, 1, 1, 4, 1, 1]. [2024-02-19 15:22:23,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 15:22:23,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 15:22:23,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 15:22:23,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 15:22:23,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (1/1) ... [2024-02-19 15:22:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 15:22:23,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:22:23,790 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:22:23,807 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:22:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 15:22:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-02-19 15:22:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-02-19 15:22:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-02-19 15:22:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-02-19 15:22:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-02-19 15:22:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-02-19 15:22:23,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-19 15:22:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-19 15:22:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-19 15:22:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-19 15:22:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-19 15:22:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-02-19 15:22:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-02-19 15:22:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 15:22:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-19 15:22:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-19 15:22:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-02-19 15:22:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 15:22:23,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 15:22:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 15:22:23,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 15:22:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 15:22:23,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 15:22:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 15:22:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 15:22:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-19 15:22:23,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 15:22:23,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 15:22:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-02-19 15:22:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-02-19 15:22:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-02-19 15:22:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-02-19 15:22:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-02-19 15:22:23,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-02-19 15:22:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-02-19 15:22:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 15:22:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-19 15:22:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-19 15:22:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-19 15:22:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-19 15:22:23,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-02-19 15:22:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-02-19 15:22:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-02-19 15:22:23,850 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:22:24,000 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 15:22:24,001 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 15:22:24,557 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 15:22:24,557 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 15:22:24,990 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 15:22:24,990 INFO L320 CfgBuilder]: Removed 9 assume(true) statements. [2024-02-19 15:22:24,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:22:24 BoogieIcfgContainer [2024-02-19 15:22:24,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 15:22:24,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 15:22:24,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 15:22:24,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 15:22:24,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 03:22:23" (1/3) ... [2024-02-19 15:22:24,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484f0784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:22:24, skipping insertion in model container [2024-02-19 15:22:24,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 03:22:23" (2/3) ... [2024-02-19 15:22:24,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484f0784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:22:24, skipping insertion in model container [2024-02-19 15:22:24,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:22:24" (3/3) ... [2024-02-19 15:22:24,998 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-02-19 15:22:25,012 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 15:22:25,013 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 15:22:25,013 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 15:22:25,054 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-19 15:22:25,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 105 flow [2024-02-19 15:22:25,111 INFO L124 PetriNetUnfolderBase]: 9/39 cut-off events. [2024-02-19 15:22:25,111 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:22:25,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 9/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-02-19 15:22:25,117 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 42 transitions, 105 flow [2024-02-19 15:22:25,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 38 transitions, 94 flow [2024-02-19 15:22:25,130 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 15:22:25,135 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;@db01156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 15:22:25,135 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 15:22:25,153 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 15:22:25,153 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2024-02-19 15:22:25,153 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-19 15:22:25,154 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:25,154 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:22:25,154 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:25,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -120437692, now seen corresponding path program 1 times [2024-02-19 15:22:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532977350] [2024-02-19 15:22:25,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:25,169 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:22:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:25,177 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:22: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 (2)] Waiting until timeout for monitored process [2024-02-19 15:22:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:25,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-19 15:22:25,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:25,382 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:22:25,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:22:25,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:25,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532977350] [2024-02-19 15:22:25,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532977350] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:22:25,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:22:25,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:22:25,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127154676] [2024-02-19 15:22:25,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:22:25,390 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:22:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:25,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:22:25,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:22:25,411 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:22:25,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:22:25,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:25,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:22:25,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:25,652 INFO L124 PetriNetUnfolderBase]: 250/395 cut-off events. [2024-02-19 15:22:25,652 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-19 15:22:25,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 395 events. 250/395 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1593 event pairs, 67 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 658. Up to 227 conditions per place. [2024-02-19 15:22:25,657 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 43 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-02-19 15:22:25,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 214 flow [2024-02-19 15:22:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:22:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:22:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-19 15:22:25,665 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-02-19 15:22:25,668 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2024-02-19 15:22:25,668 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 50 transitions, 214 flow [2024-02-19 15:22:25,668 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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:22:25,668 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:25,668 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:22:25,677 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 (2)] Forceful destruction successful, exit code 0 [2024-02-19 15:22:25,872 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:22:25,873 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:25,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2010327227, now seen corresponding path program 1 times [2024-02-19 15:22:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:25,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027300380] [2024-02-19 15:22:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:25,874 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:22:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:25,875 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:22:25,902 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:22:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:26,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-19 15:22:26,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:26,061 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:22:26,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:22:26,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:26,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027300380] [2024-02-19 15:22:26,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027300380] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:22:26,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:22:26,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 15:22:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032749422] [2024-02-19 15:22:26,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:22:26,063 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 15:22:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 15:22:26,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 15:22:26,068 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-02-19 15:22:26,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 50 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:22:26,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:26,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-02-19 15:22:26,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:26,285 INFO L124 PetriNetUnfolderBase]: 352/548 cut-off events. [2024-02-19 15:22:26,285 INFO L125 PetriNetUnfolderBase]: For 53/79 co-relation queries the response was YES. [2024-02-19 15:22:26,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 548 events. 352/548 cut-off events. For 53/79 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2241 event pairs, 75 based on Foata normal form. 26/518 useless extension candidates. Maximal degree in co-relation 1391. Up to 322 conditions per place. [2024-02-19 15:22:26,290 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 56 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2024-02-19 15:22:26,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 394 flow [2024-02-19 15:22:26,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 15:22:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 15:22:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2024-02-19 15:22:26,293 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-02-19 15:22:26,294 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-02-19 15:22:26,294 INFO L507 AbstractCegarLoop]: Abstraction has has 43 places, 64 transitions, 394 flow [2024-02-19 15:22:26,294 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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:22:26,294 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:26,294 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:26,300 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:22:26,500 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:22:26,501 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:26,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash -833038884, now seen corresponding path program 1 times [2024-02-19 15:22:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436656278] [2024-02-19 15:22:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:26,502 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:22:26,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:26,503 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:22:26,505 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:22:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:26,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 15:22:26,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:22:26,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:22:26,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436656278] [2024-02-19 15:22:26,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436656278] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:22:26,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:22:26,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:22:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295309386] [2024-02-19 15:22:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:22:26,730 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:22:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:26,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:22:26,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:22:26,737 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2024-02-19 15:22:26,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 64 transitions, 394 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:22:26,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:26,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2024-02-19 15:22:26,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:27,138 INFO L124 PetriNetUnfolderBase]: 724/1092 cut-off events. [2024-02-19 15:22:27,138 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2024-02-19 15:22:27,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 1092 events. 724/1092 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4309 event pairs, 76 based on Foata normal form. 54/1060 useless extension candidates. Maximal degree in co-relation 3430. Up to 509 conditions per place. [2024-02-19 15:22:27,144 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 88 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2024-02-19 15:22:27,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 100 transitions, 798 flow [2024-02-19 15:22:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:22:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:22:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-02-19 15:22:27,146 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-02-19 15:22:27,146 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2024-02-19 15:22:27,146 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 100 transitions, 798 flow [2024-02-19 15:22:27,146 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:22:27,146 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:27,146 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:27,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-02-19 15:22:27,350 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:22:27,351 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:27,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1616066780, now seen corresponding path program 2 times [2024-02-19 15:22:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023787410] [2024-02-19 15:22:27,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 15:22:27,352 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:22:27,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:27,354 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:22:27,355 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:22:27,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 15:22:27,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:22:27,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 15:22:27,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:22:27,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:22:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 15:22:27,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023787410] [2024-02-19 15:22:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023787410] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:22:27,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:22:27,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-02-19 15:22:27,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686097079] [2024-02-19 15:22:27,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:22:27,669 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-19 15:22:27,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:27,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-19 15:22:27,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-02-19 15:22:27,676 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2024-02-19 15:22:27,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 100 transitions, 798 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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:22:27,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:27,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2024-02-19 15:22:27,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:29,899 INFO L124 PetriNetUnfolderBase]: 7582/10973 cut-off events. [2024-02-19 15:22:29,899 INFO L125 PetriNetUnfolderBase]: For 9193/9195 co-relation queries the response was YES. [2024-02-19 15:22:29,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49806 conditions, 10973 events. 7582/10973 cut-off events. For 9193/9195 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 55725 event pairs, 61 based on Foata normal form. 254/10345 useless extension candidates. Maximal degree in co-relation 48553. Up to 5359 conditions per place. [2024-02-19 15:22:29,974 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 976 selfloop transitions, 173 changer transitions 6/1160 dead transitions. [2024-02-19 15:22:29,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 1160 transitions, 11804 flow [2024-02-19 15:22:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-19 15:22:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-19 15:22:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 388 transitions. [2024-02-19 15:22:29,981 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48621553884711777 [2024-02-19 15:22:29,981 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2024-02-19 15:22:29,981 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 1160 transitions, 11804 flow [2024-02-19 15:22:29,982 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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:22:29,982 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:29,982 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:29,996 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:22:30,190 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:22:30,191 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:30,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:30,191 INFO L85 PathProgramCache]: Analyzing trace with hash 670601807, now seen corresponding path program 1 times [2024-02-19 15:22:30,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:30,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762237929] [2024-02-19 15:22:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:30,192 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:22:30,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:30,193 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:22:30,193 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:22:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:30,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:22:30,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:30,429 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:22:30,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:22:30,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762237929] [2024-02-19 15:22:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762237929] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:22:30,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:22:30,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 15:22:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972979855] [2024-02-19 15:22:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:22:30,430 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:22:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:30,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:22:30,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:22:30,430 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:22:30,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 1160 transitions, 11804 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:22:30,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:30,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:22:30,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:32,465 INFO L124 PetriNetUnfolderBase]: 7608/11034 cut-off events. [2024-02-19 15:22:32,465 INFO L125 PetriNetUnfolderBase]: For 16046/16046 co-relation queries the response was YES. [2024-02-19 15:22:32,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58435 conditions, 11034 events. 7608/11034 cut-off events. For 16046/16046 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 56048 event pairs, 66 based on Foata normal form. 26/10172 useless extension candidates. Maximal degree in co-relation 56674. Up to 8331 conditions per place. [2024-02-19 15:22:32,530 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 1081 selfloop transitions, 2 changer transitions 29/1184 dead transitions. [2024-02-19 15:22:32,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 1184 transitions, 14283 flow [2024-02-19 15:22:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:22:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:22:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-02-19 15:22:32,531 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2024-02-19 15:22:32,532 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2024-02-19 15:22:32,532 INFO L507 AbstractCegarLoop]: Abstraction has has 68 places, 1184 transitions, 14283 flow [2024-02-19 15:22:32,532 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:22:32,532 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:32,532 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:32,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-02-19 15:22:32,737 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:22:32,737 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:32,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash 580850241, now seen corresponding path program 1 times [2024-02-19 15:22:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:32,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732878562] [2024-02-19 15:22:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:32,739 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:22:32,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:32,740 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:22:32,761 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:22:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:33,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 15:22:33,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:22:33,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:22:33,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732878562] [2024-02-19 15:22:33,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732878562] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:22:33,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:22:33,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 15:22:33,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639036060] [2024-02-19 15:22:33,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:22:33,158 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 15:22:33,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 15:22:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 15:22:33,159 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:22:33,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 1184 transitions, 14283 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:22:33,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:33,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:22:33,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:35,515 INFO L124 PetriNetUnfolderBase]: 7695/11227 cut-off events. [2024-02-19 15:22:35,515 INFO L125 PetriNetUnfolderBase]: For 24191/24191 co-relation queries the response was YES. [2024-02-19 15:22:35,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67884 conditions, 11227 events. 7695/11227 cut-off events. For 24191/24191 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 57081 event pairs, 76 based on Foata normal form. 68/10397 useless extension candidates. Maximal degree in co-relation 64803. Up to 8415 conditions per place. [2024-02-19 15:22:35,580 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 1082 selfloop transitions, 2 changer transitions 100/1256 dead transitions. [2024-02-19 15:22:35,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 1256 transitions, 17569 flow [2024-02-19 15:22:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:22:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:22:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-02-19 15:22:35,582 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-02-19 15:22:35,582 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2024-02-19 15:22:35,582 INFO L507 AbstractCegarLoop]: Abstraction has has 72 places, 1256 transitions, 17569 flow [2024-02-19 15:22:35,583 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:22:35,583 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:35,583 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:35,590 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:22:35,790 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:22:35,793 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:35,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1921808852, now seen corresponding path program 1 times [2024-02-19 15:22:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:35,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95354677] [2024-02-19 15:22:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:35,794 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:22:35,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:35,795 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:22:35,795 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:22:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:36,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-19 15:22:36,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:22:36,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:22:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:22:36,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95354677] [2024-02-19 15:22:36,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95354677] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:22:36,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-19 15:22:36,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-02-19 15:22:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113796747] [2024-02-19 15:22:36,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-19 15:22:36,209 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-19 15:22:36,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-19 15:22:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-02-19 15:22:36,209 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:22:36,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 1256 transitions, 17569 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:22:36,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:36,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:22:36,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:40,941 INFO L124 PetriNetUnfolderBase]: 15294/22256 cut-off events. [2024-02-19 15:22:40,941 INFO L125 PetriNetUnfolderBase]: For 63846/63862 co-relation queries the response was YES. [2024-02-19 15:22:40,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151407 conditions, 22256 events. 15294/22256 cut-off events. For 63846/63862 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 126437 event pairs, 142 based on Foata normal form. 0/20438 useless extension candidates. Maximal degree in co-relation 72866. Up to 16724 conditions per place. [2024-02-19 15:22:41,106 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 2157 selfloop transitions, 8 changer transitions 130/2367 dead transitions. [2024-02-19 15:22:41,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 2367 transitions, 38244 flow [2024-02-19 15:22:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-19 15:22:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-19 15:22:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-02-19 15:22:41,107 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-02-19 15:22:41,108 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2024-02-19 15:22:41,108 INFO L507 AbstractCegarLoop]: Abstraction has has 79 places, 2367 transitions, 38244 flow [2024-02-19 15:22:41,108 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:22:41,108 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:41,108 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:41,116 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:22:41,316 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:22:41,316 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:41,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash -754234129, now seen corresponding path program 1 times [2024-02-19 15:22:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026542186] [2024-02-19 15:22:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:41,317 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:22:41,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:41,318 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:22:41,319 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:22:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:41,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-19 15:22:41,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-19 15:22:41,692 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:22:41,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026542186] [2024-02-19 15:22:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026542186] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:22:41,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:22:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:22:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110226038] [2024-02-19 15:22:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:22:41,694 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:22:41,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:41,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:22:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:22:41,694 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:22:41,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 2367 transitions, 38244 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:22:41,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:41,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:22:41,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:47,704 INFO L124 PetriNetUnfolderBase]: 15534/22746 cut-off events. [2024-02-19 15:22:47,704 INFO L125 PetriNetUnfolderBase]: For 92064/92080 co-relation queries the response was YES. [2024-02-19 15:22:47,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171464 conditions, 22746 events. 15534/22746 cut-off events. For 92064/92080 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 129939 event pairs, 180 based on Foata normal form. 66/20946 useless extension candidates. Maximal degree in co-relation 80977. Up to 16934 conditions per place. [2024-02-19 15:22:47,899 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 2163 selfloop transitions, 4 changer transitions 276/2515 dead transitions. [2024-02-19 15:22:47,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 2515 transitions, 45588 flow [2024-02-19 15:22:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:22:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:22:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-02-19 15:22:47,900 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-02-19 15:22:47,900 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2024-02-19 15:22:47,901 INFO L507 AbstractCegarLoop]: Abstraction has has 82 places, 2515 transitions, 45588 flow [2024-02-19 15:22:47,901 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:22:47,901 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:47,901 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:47,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-02-19 15:22:48,106 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:22:48,110 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:48,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1074290214, now seen corresponding path program 1 times [2024-02-19 15:22:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254113192] [2024-02-19 15:22:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:48,111 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:22:48,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:48,112 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:22:48,114 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:22:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:48,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-19 15:22:48,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:22:48,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:22:48,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:48,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254113192] [2024-02-19 15:22:48,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254113192] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:22:48,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:22:48,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:22:48,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359720735] [2024-02-19 15:22:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:22:48,568 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:22:48,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:22:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:22:48,569 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:22:48,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 2515 transitions, 45588 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:22:48,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:48,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:22:48,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:22:56,525 INFO L124 PetriNetUnfolderBase]: 17533/26551 cut-off events. [2024-02-19 15:22:56,525 INFO L125 PetriNetUnfolderBase]: For 159570/159594 co-relation queries the response was YES. [2024-02-19 15:22:56,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218711 conditions, 26551 events. 17533/26551 cut-off events. For 159570/159594 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 164194 event pairs, 284 based on Foata normal form. 1360/26003 useless extension candidates. Maximal degree in co-relation 89208. Up to 19408 conditions per place. [2024-02-19 15:22:56,736 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 2169 selfloop transitions, 4 changer transitions 1025/3270 dead transitions. [2024-02-19 15:22:56,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 3270 transitions, 66201 flow [2024-02-19 15:22:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 15:22:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 15:22:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-02-19 15:22:56,737 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-02-19 15:22:56,738 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2024-02-19 15:22:56,738 INFO L507 AbstractCegarLoop]: Abstraction has has 85 places, 3270 transitions, 66201 flow [2024-02-19 15:22:56,738 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:22:56,738 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:22:56,738 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:22:56,743 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 (10)] Forceful destruction successful, exit code 0 [2024-02-19 15:22:56,939 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:22:56,939 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:22:56,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:22:56,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1744420335, now seen corresponding path program 1 times [2024-02-19 15:22:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:22:56,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760887523] [2024-02-19 15:22:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:22:56,940 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:22:56,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:22:56,941 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:22:56,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-02-19 15:22:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:22:57,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 15:22:57,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:22:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-19 15:22:57,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-19 15:22:57,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-19 15:22:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760887523] [2024-02-19 15:22:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760887523] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 15:22:57,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 15:22:57,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 15:22:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48136781] [2024-02-19 15:22:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 15:22:57,518 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 15:22:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-19 15:22:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 15:22:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 15:22:57,519 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-19 15:22:57,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 3270 transitions, 66201 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:22:57,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:22:57,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-19 15:22:57,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:23:10,415 INFO L124 PetriNetUnfolderBase]: 19532/30380 cut-off events. [2024-02-19 15:23:10,415 INFO L125 PetriNetUnfolderBase]: For 233511/233535 co-relation queries the response was YES. [2024-02-19 15:23:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271312 conditions, 30380 events. 19532/30380 cut-off events. For 233511/233535 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 200513 event pairs, 388 based on Foata normal form. 1360/29782 useless extension candidates. Maximal degree in co-relation 97333. Up to 21878 conditions per place. [2024-02-19 15:23:10,655 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 2169 selfloop transitions, 8 changer transitions 1812/4061 dead transitions. [2024-02-19 15:23:10,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 4061 transitions, 90626 flow [2024-02-19 15:23:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 15:23:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 15:23:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-02-19 15:23:10,657 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-02-19 15:23:10,657 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2024-02-19 15:23:10,657 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 4061 transitions, 90626 flow [2024-02-19 15:23:10,657 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 15:23:10,657 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:23:10,658 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:23:10,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-02-19 15:23:10,862 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-19 15:23:10,863 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-19 15:23:10,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:23:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1685961188, now seen corresponding path program 1 times [2024-02-19 15:23:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-19 15:23:10,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136806568] [2024-02-19 15:23:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:23:10,864 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:23:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-19 15:23:10,864 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-19 15:23:10,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-02-19 15:23:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:23:11,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 47 conjunts are in the unsatisfiable core [2024-02-19 15:23:11,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:23:11,981 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 11 treesize of output 7 [2024-02-19 15:23:13,788 INFO L349 Elim1Store]: treesize reduction 1514, result has 22.2 percent of original size [2024-02-19 15:23:13,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 24 new quantified variables, introduced 120 case distinctions, treesize of input 661 treesize of output 642 [2024-02-19 15:23:13,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-19 15:23:13,870 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 628 treesize of output 528 [2024-02-19 15:23:13,889 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 555 treesize of output 435 [2024-02-19 15:23:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-19 15:23:24,446 INFO L327 TraceCheckSpWp]: Computing backward predicates...