./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 448d4d75 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-448d4d7-m [2024-02-20 12:35:26,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:35:26,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 12:35:26,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:35:26,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:35:26,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:35:26,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:35:26,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:35:26,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:35:26,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:35:26,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:35:26,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:35:26,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:35:26,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:35:26,152 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:35:26,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:35:26,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:35:26,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:35:26,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 12:35:26,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:35:26,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:35:26,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:35:26,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:35:26,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:35:26,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:35:26,155 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:35:26,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:35:26,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:35:26,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:35:26,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:35:26,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:35:26,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:35:26,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:35:26,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:35:26,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:35:26,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:35:26,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 12:35:26,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 12:35:26,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:35:26,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:35:26,160 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:35:26,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:35:26,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:35:26,161 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-20 12:35:26,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:35:26,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:35:26,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:35:26,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:35:26,427 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:35:26,428 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-20 12:35:27,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:35:27,681 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:35:27,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-02-20 12:35:27,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d0374ee/f97cf335db314d55816bf31702da25a0/FLAG4683495b0 [2024-02-20 12:35:27,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d0374ee/f97cf335db314d55816bf31702da25a0 [2024-02-20 12:35:27,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:35:27,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:35:27,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:35:27,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:35:27,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:35:27,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:27,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b5b65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27, skipping insertion in model container [2024-02-20 12:35:27,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:27,736 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:35:27,893 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-20 12:35:27,902 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:35:27,911 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:35:27,936 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-20 12:35:27,941 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:35:27,962 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:35:27,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27 WrapperNode [2024-02-20 12:35:27,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:35:27,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:35:27,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:35:27,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:35:27,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:27,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,043 INFO L138 Inliner]: procedures = 28, calls = 80, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 411 [2024-02-20 12:35:28,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:35:28,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:35:28,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:35:28,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:35:28,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,097 INFO L175 MemorySlicer]: Split 30 memory accesses to 7 slices as follows [2, 2, 2, 3, 3, 2, 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-20 12:35:28,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:35:28,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:35:28,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:35:28,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:35:28,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (1/1) ... [2024-02-20 12:35:28,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:35:28,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:35:28,195 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-20 12:35:28,215 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-20 12:35:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-20 12:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-20 12:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-20 12:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-20 12:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-20 12:35:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-02-20 12:35:28,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-02-20 12:35:28,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:35:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 12:35:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 12:35:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 12:35:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 12:35:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 12:35:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-20 12:35:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-20 12:35:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 12:35:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 12:35:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 12:35:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 12:35:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 12:35:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-20 12:35:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-20 12:35:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-20 12:35:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-20 12:35:28,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-20 12:35:28,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-20 12:35:28,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-02-20 12:35:28,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-02-20 12:35:28,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-02-20 12:35:28,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:35:28,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:35:28,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:35:28,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:35:28,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 12:35:28,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 12:35:28,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 12:35:28,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 12:35:28,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 12:35:28,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 12:35:28,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 12:35:28,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-20 12:35:28,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-20 12:35:28,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:35:28,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:35:28,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:35:28,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:35:28,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:35:28,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:35:28,249 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:35:28,374 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:35:28,376 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:35:28,895 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:35:28,895 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:35:29,388 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:35:29,388 INFO L320 CfgBuilder]: Removed 9 assume(true) statements. [2024-02-20 12:35:29,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:35:29 BoogieIcfgContainer [2024-02-20 12:35:29,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:35:29,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:35:29,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:35:29,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:35:29,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:35:27" (1/3) ... [2024-02-20 12:35:29,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402f9072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:35:29, skipping insertion in model container [2024-02-20 12:35:29,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:35:27" (2/3) ... [2024-02-20 12:35:29,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402f9072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:35:29, skipping insertion in model container [2024-02-20 12:35:29,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:35:29" (3/3) ... [2024-02-20 12:35:29,398 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-02-20 12:35:29,416 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:35:29,416 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:35:29,416 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:35:29,472 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 12:35:29,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 105 flow [2024-02-20 12:35:29,548 INFO L124 PetriNetUnfolderBase]: 9/39 cut-off events. [2024-02-20 12:35:29,549 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:35:29,552 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-20 12:35:29,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 42 transitions, 105 flow [2024-02-20 12:35:29,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 38 transitions, 94 flow [2024-02-20 12:35:29,569 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:35:29,578 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;@6a2165d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:35:29,578 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 12:35:29,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:35:29,597 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2024-02-20 12:35:29,597 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:35:29,597 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:29,598 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-20 12:35:29,599 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-20 12:35:29,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1465498536, now seen corresponding path program 1 times [2024-02-20 12:35:29,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:29,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514598745] [2024-02-20 12:35:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:30,089 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-20 12:35:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514598745] [2024-02-20 12:35:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514598745] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:30,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:30,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:35:30,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144846328] [2024-02-20 12:35:30,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:30,101 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:35:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:35:30,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:35:30,129 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:30,130 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-20 12:35:30,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:30,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:30,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:30,346 INFO L124 PetriNetUnfolderBase]: 347/569 cut-off events. [2024-02-20 12:35:30,347 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-02-20 12:35:30,352 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-20 12:35:30,357 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 45 selfloop transitions, 3 changer transitions 1/54 dead transitions. [2024-02-20 12:35:30,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 236 flow [2024-02-20 12:35:30,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:35:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:35:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-20 12:35:30,368 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-02-20 12:35:30,373 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2024-02-20 12:35:30,373 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 54 transitions, 236 flow [2024-02-20 12:35:30,373 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-20 12:35:30,374 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:30,374 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-20 12:35:30,374 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 12:35:30,374 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-20 12:35:30,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:30,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1588723455, now seen corresponding path program 1 times [2024-02-20 12:35:30,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:30,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551750071] [2024-02-20 12:35:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:30,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:30,729 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-20 12:35:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:30,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551750071] [2024-02-20 12:35:30,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551750071] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:30,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:30,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:35:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461953571] [2024-02-20 12:35:30,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:30,733 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:35:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:30,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:35:30,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:35:30,773 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:30,773 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-20 12:35:30,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:30,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:30,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:31,027 INFO L124 PetriNetUnfolderBase]: 458/807 cut-off events. [2024-02-20 12:35:31,027 INFO L125 PetriNetUnfolderBase]: For 183/197 co-relation queries the response was YES. [2024-02-20 12:35:31,029 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-20 12:35:31,035 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 80 selfloop transitions, 10 changer transitions 5/100 dead transitions. [2024-02-20 12:35:31,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 100 transitions, 640 flow [2024-02-20 12:35:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:35:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:35:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2024-02-20 12:35:31,043 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5190476190476191 [2024-02-20 12:35:31,044 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2024-02-20 12:35:31,044 INFO L507 AbstractCegarLoop]: Abstraction has has 45 places, 100 transitions, 640 flow [2024-02-20 12:35:31,044 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-20 12:35:31,044 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:31,044 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-20 12:35:31,044 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 12:35:31,045 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-20 12:35:31,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:31,045 INFO L85 PathProgramCache]: Analyzing trace with hash -844832375, now seen corresponding path program 1 times [2024-02-20 12:35:31,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:31,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95098329] [2024-02-20 12:35:31,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:31,205 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-20 12:35:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:31,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95098329] [2024-02-20 12:35:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95098329] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:31,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:31,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:35:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945647890] [2024-02-20 12:35:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:31,208 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:35:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:31,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:35:31,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:35:31,209 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:31,210 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-20 12:35:31,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:31,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:31,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:31,549 INFO L124 PetriNetUnfolderBase]: 725/1363 cut-off events. [2024-02-20 12:35:31,549 INFO L125 PetriNetUnfolderBase]: For 722/770 co-relation queries the response was YES. [2024-02-20 12:35:31,552 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-20 12:35:31,560 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 148 selfloop transitions, 16 changer transitions 15/184 dead transitions. [2024-02-20 12:35:31,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 184 transitions, 1562 flow [2024-02-20 12:35:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:35:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:35:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-02-20 12:35:31,562 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2024-02-20 12:35:31,562 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2024-02-20 12:35:31,563 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 184 transitions, 1562 flow [2024-02-20 12:35:31,563 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-20 12:35:31,563 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:31,563 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-20 12:35:31,563 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 12:35:31,563 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-20 12:35:31,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1312392148, now seen corresponding path program 1 times [2024-02-20 12:35:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485262120] [2024-02-20 12:35:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:31,722 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-20 12:35:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:31,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485262120] [2024-02-20 12:35:31,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485262120] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:35:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411364355] [2024-02-20 12:35:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:31,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:35:31,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:35:31,728 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-20 12:35:31,749 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-20 12:35:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:31,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 12:35:31,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:35:31,941 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-20 12:35:31,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:35:31,975 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-20 12:35:31,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411364355] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:35:31,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:35:31,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2024-02-20 12:35:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076164178] [2024-02-20 12:35:31,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:31,976 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:35:31,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:31,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:35:31,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-02-20 12:35:31,977 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:31,977 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-20 12:35:31,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:31,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:31,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:32,295 INFO L124 PetriNetUnfolderBase]: 725/1365 cut-off events. [2024-02-20 12:35:32,295 INFO L125 PetriNetUnfolderBase]: For 1307/1379 co-relation queries the response was YES. [2024-02-20 12:35:32,297 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-20 12:35:32,303 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 155 selfloop transitions, 11 changer transitions 15/186 dead transitions. [2024-02-20 12:35:32,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 186 transitions, 1940 flow [2024-02-20 12:35:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:35:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:35:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-02-20 12:35:32,313 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-02-20 12:35:32,314 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2024-02-20 12:35:32,314 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 186 transitions, 1940 flow [2024-02-20 12:35:32,314 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-20 12:35:32,314 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:32,314 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-20 12:35:32,342 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-20 12:35:32,515 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-20 12:35:32,515 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-20 12:35:32,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash 288572287, now seen corresponding path program 1 times [2024-02-20 12:35:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:32,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119229960] [2024-02-20 12:35:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:32,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:32,621 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-20 12:35:32,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:32,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119229960] [2024-02-20 12:35:32,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119229960] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:32,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:32,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:35:32,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436753846] [2024-02-20 12:35:32,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:32,623 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:35:32,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:32,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:35:32,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:35:32,639 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:32,640 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-20 12:35:32,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:32,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:32,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:32,853 INFO L124 PetriNetUnfolderBase]: 627/1136 cut-off events. [2024-02-20 12:35:32,854 INFO L125 PetriNetUnfolderBase]: For 1215/1311 co-relation queries the response was YES. [2024-02-20 12:35:32,856 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-20 12:35:32,862 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 74 selfloop transitions, 3 changer transitions 102/184 dead transitions. [2024-02-20 12:35:32,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 184 transitions, 2275 flow [2024-02-20 12:35:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:35:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:35:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-20 12:35:32,864 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-02-20 12:35:32,866 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2024-02-20 12:35:32,866 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 184 transitions, 2275 flow [2024-02-20 12:35:32,866 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-20 12:35:32,866 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:32,866 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-20 12:35:32,867 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 12:35:32,867 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-20 12:35:32,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash -323046519, now seen corresponding path program 1 times [2024-02-20 12:35:32,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:32,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104599970] [2024-02-20 12:35:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:33,050 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-20 12:35:33,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:33,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104599970] [2024-02-20 12:35:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104599970] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:33,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:35:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130902182] [2024-02-20 12:35:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:33,052 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:35:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:33,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:35:33,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:35:33,053 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:33,053 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-20 12:35:33,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:33,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:33,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:33,455 INFO L124 PetriNetUnfolderBase]: 906/1711 cut-off events. [2024-02-20 12:35:33,455 INFO L125 PetriNetUnfolderBase]: For 1958/1998 co-relation queries the response was YES. [2024-02-20 12:35:33,458 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-20 12:35:33,467 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 78 selfloop transitions, 2 changer transitions 202/287 dead transitions. [2024-02-20 12:35:33,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 287 transitions, 4168 flow [2024-02-20 12:35:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:35:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:35:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-02-20 12:35:33,469 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-02-20 12:35:33,469 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2024-02-20 12:35:33,469 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 287 transitions, 4168 flow [2024-02-20 12:35:33,470 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-20 12:35:33,470 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:33,470 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-20 12:35:33,470 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 12:35:33,470 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-20 12:35:33,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1879854238, now seen corresponding path program 1 times [2024-02-20 12:35:33,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:33,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729051959] [2024-02-20 12:35:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:33,622 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-20 12:35:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729051959] [2024-02-20 12:35:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729051959] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:33,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:35:33,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025303376] [2024-02-20 12:35:33,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:33,623 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:35:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:33,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:35:33,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:35:33,628 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:33,628 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-20 12:35:33,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:33,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:33,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:33,867 INFO L124 PetriNetUnfolderBase]: 808/1470 cut-off events. [2024-02-20 12:35:33,867 INFO L125 PetriNetUnfolderBase]: For 2913/2945 co-relation queries the response was YES. [2024-02-20 12:35:33,870 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-20 12:35:33,879 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 85 selfloop transitions, 3 changer transitions 168/261 dead transitions. [2024-02-20 12:35:33,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 261 transitions, 4250 flow [2024-02-20 12:35:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:35:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:35:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-20 12:35:33,881 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-02-20 12:35:33,882 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2024-02-20 12:35:33,882 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 261 transitions, 4250 flow [2024-02-20 12:35:33,882 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-20 12:35:33,882 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:33,883 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-20 12:35:33,883 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 12:35:33,883 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-20 12:35:33,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1294819243, now seen corresponding path program 1 times [2024-02-20 12:35:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668326596] [2024-02-20 12:35:33,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:34,103 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-20 12:35:34,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:34,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668326596] [2024-02-20 12:35:34,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668326596] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:34,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:34,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:35:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697856152] [2024-02-20 12:35:34,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:34,104 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:35:34,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:34,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:35:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:35:34,105 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:34,106 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-20 12:35:34,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:34,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:34,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:34,392 INFO L124 PetriNetUnfolderBase]: 897/1742 cut-off events. [2024-02-20 12:35:34,392 INFO L125 PetriNetUnfolderBase]: For 4195/4239 co-relation queries the response was YES. [2024-02-20 12:35:34,395 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-20 12:35:34,414 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 87 selfloop transitions, 2 changer transitions 296/390 dead transitions. [2024-02-20 12:35:34,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 390 transitions, 7156 flow [2024-02-20 12:35:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:35:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:35:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-02-20 12:35:34,415 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-02-20 12:35:34,417 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2024-02-20 12:35:34,417 INFO L507 AbstractCegarLoop]: Abstraction has has 64 places, 390 transitions, 7156 flow [2024-02-20 12:35:34,417 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-20 12:35:34,417 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:34,417 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-20 12:35:34,417 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 12:35:34,418 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-20 12:35:34,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1027092092, now seen corresponding path program 1 times [2024-02-20 12:35:34,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:34,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353005342] [2024-02-20 12:35:34,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:34,692 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-20 12:35:34,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:34,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353005342] [2024-02-20 12:35:34,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353005342] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:34,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:34,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:35:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502829875] [2024-02-20 12:35:34,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:34,694 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:35:34,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:35:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:35:34,701 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2024-02-20 12:35:34,702 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-20 12:35:34,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:34,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2024-02-20 12:35:34,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:35,648 INFO L124 PetriNetUnfolderBase]: 2441/4439 cut-off events. [2024-02-20 12:35:35,648 INFO L125 PetriNetUnfolderBase]: For 37364/37364 co-relation queries the response was YES. [2024-02-20 12:35:35,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35979 conditions, 4439 events. 2441/4439 cut-off events. For 37364/37364 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 28416 event pairs, 170 based on Foata normal form. 122/4261 useless extension candidates. Maximal degree in co-relation 15634. Up to 2862 conditions per place. [2024-02-20 12:35:35,688 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 168 selfloop transitions, 28 changer transitions 498/696 dead transitions. [2024-02-20 12:35:35,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 696 transitions, 14222 flow [2024-02-20 12:35:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:35:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:35:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-02-20 12:35:35,690 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-02-20 12:35:35,691 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2024-02-20 12:35:35,691 INFO L507 AbstractCegarLoop]: Abstraction has has 67 places, 696 transitions, 14222 flow [2024-02-20 12:35:35,691 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-20 12:35:35,691 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:35,692 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-20 12:35:35,692 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 12:35:35,692 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-20 12:35:35,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:35,693 INFO L85 PathProgramCache]: Analyzing trace with hash -978365108, now seen corresponding path program 2 times [2024-02-20 12:35:35,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:35,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056171946] [2024-02-20 12:35:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:35,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:36,024 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-20 12:35:36,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:36,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056171946] [2024-02-20 12:35:36,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056171946] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:36,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:36,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:35:36,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485998718] [2024-02-20 12:35:36,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:36,027 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:35:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:36,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:35:36,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:35:36,030 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:36,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 696 transitions, 14222 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-20 12:35:36,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:36,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:36,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:37,193 INFO L124 PetriNetUnfolderBase]: 3183/5961 cut-off events. [2024-02-20 12:35:37,194 INFO L125 PetriNetUnfolderBase]: For 66528/66528 co-relation queries the response was YES. [2024-02-20 12:35:37,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52281 conditions, 5961 events. 3183/5961 cut-off events. For 66528/66528 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 42074 event pairs, 242 based on Foata normal form. 104/5755 useless extension candidates. Maximal degree in co-relation 17134. Up to 3726 conditions per place. [2024-02-20 12:35:37,246 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 190 selfloop transitions, 4 changer transitions 736/936 dead transitions. [2024-02-20 12:35:37,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 936 transitions, 21059 flow [2024-02-20 12:35:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:35:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:35:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2024-02-20 12:35:37,248 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-02-20 12:35:37,249 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2024-02-20 12:35:37,249 INFO L507 AbstractCegarLoop]: Abstraction has has 71 places, 936 transitions, 21059 flow [2024-02-20 12:35:37,249 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-20 12:35:37,250 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:37,250 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-20 12:35:37,250 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 12:35:37,250 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-20 12:35:37,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1922179185, now seen corresponding path program 1 times [2024-02-20 12:35:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462473685] [2024-02-20 12:35:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:37,543 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-20 12:35:37,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:37,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462473685] [2024-02-20 12:35:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462473685] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:35:37,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024946256] [2024-02-20 12:35:37,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:37,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:35:37,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:35:37,545 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-20 12:35:37,566 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-20 12:35:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:37,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 12:35:37,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:35:37,782 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-20 12:35:37,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:35:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024946256] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:37,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 12:35:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-02-20 12:35:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273344351] [2024-02-20 12:35:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:37,784 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:35:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:37,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:35:37,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-02-20 12:35:37,788 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2024-02-20 12:35:37,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 936 transitions, 21059 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-20 12:35:37,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:37,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2024-02-20 12:35:37,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:39,529 INFO L124 PetriNetUnfolderBase]: 3579/6577 cut-off events. [2024-02-20 12:35:39,529 INFO L125 PetriNetUnfolderBase]: For 80890/80890 co-relation queries the response was YES. [2024-02-20 12:35:39,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62568 conditions, 6577 events. 3579/6577 cut-off events. For 80890/80890 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 45444 event pairs, 252 based on Foata normal form. 334/6521 useless extension candidates. Maximal degree in co-relation 26236. Up to 4119 conditions per place. [2024-02-20 12:35:39,574 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 238 selfloop transitions, 24 changer transitions 700/966 dead transitions. [2024-02-20 12:35:39,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 966 transitions, 23571 flow [2024-02-20 12:35:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:35:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:35:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-02-20 12:35:39,575 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2024-02-20 12:35:39,575 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 37 predicate places. [2024-02-20 12:35:39,576 INFO L507 AbstractCegarLoop]: Abstraction has has 76 places, 966 transitions, 23571 flow [2024-02-20 12:35:39,576 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 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-20 12:35:39,576 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:39,576 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-20 12:35:39,591 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-20 12:35:39,790 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-20 12:35:39,791 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-20 12:35:39,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash -340596751, now seen corresponding path program 2 times [2024-02-20 12:35:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:39,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632073239] [2024-02-20 12:35:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:39,962 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-20 12:35:39,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:39,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632073239] [2024-02-20 12:35:39,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632073239] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:39,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:39,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:35:39,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381696856] [2024-02-20 12:35:39,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:39,964 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:35:39,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:39,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:35:39,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:35:39,969 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2024-02-20 12:35:39,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 966 transitions, 23571 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-20 12:35:39,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:39,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2024-02-20 12:35:39,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:41,492 INFO L124 PetriNetUnfolderBase]: 3865/6872 cut-off events. [2024-02-20 12:35:41,492 INFO L125 PetriNetUnfolderBase]: For 90119/90119 co-relation queries the response was YES. [2024-02-20 12:35:41,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69819 conditions, 6872 events. 3865/6872 cut-off events. For 90119/90119 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 44559 event pairs, 224 based on Foata normal form. 508/6894 useless extension candidates. Maximal degree in co-relation 40364. Up to 4422 conditions per place. [2024-02-20 12:35:41,555 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 437 selfloop transitions, 48 changer transitions 682/1169 dead transitions. [2024-02-20 12:35:41,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 1169 transitions, 30579 flow [2024-02-20 12:35:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:35:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:35:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-02-20 12:35:41,556 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2024-02-20 12:35:41,557 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 41 predicate places. [2024-02-20 12:35:41,557 INFO L507 AbstractCegarLoop]: Abstraction has has 80 places, 1169 transitions, 30579 flow [2024-02-20 12:35:41,557 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-20 12:35:41,557 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:41,557 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-20 12:35:41,557 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-20 12:35:41,558 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-20 12:35:41,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1198424151, now seen corresponding path program 1 times [2024-02-20 12:35:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249362622] [2024-02-20 12:35:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:41,719 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-20 12:35:41,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:41,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249362622] [2024-02-20 12:35:41,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249362622] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:35:41,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:35:41,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:35:41,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831635445] [2024-02-20 12:35:41,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:35:41,722 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:35:41,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:35:41,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:35:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:35:41,727 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:35:41,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 1169 transitions, 30579 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-20 12:35:41,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:35:41,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:35:41,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:35:43,497 INFO L124 PetriNetUnfolderBase]: 3761/6486 cut-off events. [2024-02-20 12:35:43,498 INFO L125 PetriNetUnfolderBase]: For 95650/95650 co-relation queries the response was YES. [2024-02-20 12:35:43,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72061 conditions, 6486 events. 3761/6486 cut-off events. For 95650/95650 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 39517 event pairs, 156 based on Foata normal form. 352/6442 useless extension candidates. Maximal degree in co-relation 51203. Up to 4414 conditions per place. [2024-02-20 12:35:43,570 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 581 selfloop transitions, 46 changer transitions 594/1247 dead transitions. [2024-02-20 12:35:43,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 1247 transitions, 35091 flow [2024-02-20 12:35:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:35:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:35:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-20 12:35:43,571 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-02-20 12:35:43,572 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2024-02-20 12:35:43,572 INFO L507 AbstractCegarLoop]: Abstraction has has 82 places, 1247 transitions, 35091 flow [2024-02-20 12:35:43,572 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-20 12:35:43,572 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:35:43,573 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-20 12:35:43,573 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-20 12:35:43,573 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 12:35:43,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:35:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2070081952, now seen corresponding path program 1 times [2024-02-20 12:35:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:35:43,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191463867] [2024-02-20 12:35:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:35:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:44,715 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-20 12:35:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:35:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191463867] [2024-02-20 12:35:44,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191463867] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:35:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903720058] [2024-02-20 12:35:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:35:44,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:35:44,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:35:44,718 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-20 12:35:44,720 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-20 12:35:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:35:44,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 34 conjunts are in the unsatisfiable core [2024-02-20 12:35:44,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:35:45,006 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-20 12:35:45,049 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-20 12:35:45,052 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-20 12:35:45,393 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-20 12:35:45,398 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-20 12:35:45,421 INFO L349 Elim1Store]: treesize reduction 20, result has 62.3 percent of original size [2024-02-20 12:35:45,422 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-20 12:35:45,435 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-20 12:35:45,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:35:46,073 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-20 12:35:46,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:35:46,093 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-20 12:35:46,101 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-20 12:35:46,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:35:46,116 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-20 12:35:50,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:35:50,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 690 treesize of output 686 [2024-02-20 12:35:56,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:35:56,030 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 63 treesize of output 59 [2024-02-20 12:35:56,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:35:56,067 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 63 treesize of output 59 [2024-02-20 12:35:56,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:35:56,114 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 71 treesize of output 55 [2024-02-20 12:35:56,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:35:56,157 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 85 treesize of output 69 [2024-02-20 12:35:56,195 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 22 treesize of output 16 [2024-02-20 12:35:56,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:35:56,215 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 113 treesize of output 91 [2024-02-20 12:35:57,253 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 57 treesize of output 45 [2024-02-20 12:35:57,295 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 57 treesize of output 45 [2024-02-20 12:35:57,309 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-02-20 12:35:57,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 760 treesize of output 1 [2024-02-20 12:35:57,472 INFO L349 Elim1Store]: treesize reduction 30, result has 86.9 percent of original size [2024-02-20 12:35:57,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 1030 treesize of output 964 [2024-02-20 12:36:42,098 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:36:42,099 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 1593 treesize of output 1 [2024-02-20 12:36:42,110 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:36:42,111 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 1379 treesize of output 1 [2024-02-20 12:36:42,128 INFO L349 Elim1Store]: treesize reduction 231, result has 0.4 percent of original size [2024-02-20 12:36:42,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 923 treesize of output 1 [2024-02-20 12:36:42,141 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-02-20 12:36:42,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 992 treesize of output 1 [2024-02-20 12:36:42,153 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-02-20 12:36:42,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 922 treesize of output 1 [2024-02-20 12:36:42,167 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:36:42,167 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 1611 treesize of output 1 [2024-02-20 12:36:42,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:36:42,217 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 1416 treesize of output 1386 [2024-02-20 12:36:42,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:36:42,668 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 394 treesize of output 336 [2024-02-20 12:37:24,618 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 21 treesize of output 9 [2024-02-20 12:37:24,645 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 28 treesize of output 16 [2024-02-20 12:37:24,736 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 34 treesize of output 22 [2024-02-20 12:37:24,848 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 63 treesize of output 39 [2024-02-20 12:37:25,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:37:25,017 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 49 treesize of output 45 [2024-02-20 12:37:25,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:37:25,038 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 63 treesize of output 59 [2024-02-20 12:37:25,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:37:25,208 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 49 treesize of output 45 [2024-02-20 12:37:25,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:37:25,238 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 63 treesize of output 59 [2024-02-20 12:37:25,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:37:25,296 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 113 treesize of output 91 [2024-02-20 12:37:25,323 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 57 treesize of output 45 [2024-02-20 12:37:25,404 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 57 treesize of output 45 [2024-02-20 12:37:25,432 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:37:25,433 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 2032 treesize of output 1 [2024-02-20 12:37:25,445 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:37:25,446 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 1539 treesize of output 1 [2024-02-20 12:37:25,457 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-02-20 12:37:25,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 690 treesize of output 1 [2024-02-20 12:37:25,471 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:37:25,472 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 1872 treesize of output 1 [2024-02-20 12:37:25,487 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:37:25,488 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 2264 treesize of output 1 [2024-02-20 12:37:25,517 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:37:25,517 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 1648 treesize of output 1 [2024-02-20 12:37:25,536 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:37:25,536 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 1771 treesize of output 1 [2024-02-20 12:37:25,553 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:37:25,554 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 1825 treesize of output 1 [2024-02-20 12:37:25,569 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-02-20 12:37:25,570 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 2104 treesize of output 1 [2024-02-20 12:37:25,583 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-02-20 12:37:25,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 922 treesize of output 1 [2024-02-20 12:37:25,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:37:25,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2033 treesize of output 1941 [2024-02-20 12:37:26,454 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 843 treesize of output 753 [2024-02-20 12:41:58,848 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-20 12:41:58,848 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-20 12:41:58,850 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-20 12:41:58,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-20 12:41:59,050 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:41:59,051 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-20 12:41:59,056 INFO L158 Benchmark]: Toolchain (without parser) took 391351.19ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 144.3MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-02-20 12:41:59,056 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-20 12:41:59,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.12ms. Allocated memory is still 178.3MB. Free memory was 144.3MB in the beginning and 130.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-02-20 12:41:59,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.63ms. Allocated memory is still 178.3MB. Free memory was 130.7MB in the beginning and 127.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-20 12:41:59,057 INFO L158 Benchmark]: Boogie Preprocessor took 107.15ms. Allocated memory is still 178.3MB. Free memory was 127.6MB in the beginning and 122.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-02-20 12:41:59,057 INFO L158 Benchmark]: RCFGBuilder took 1232.65ms. Allocated memory is still 178.3MB. Free memory was 122.3MB in the beginning and 131.2MB in the end (delta: -8.9MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-02-20 12:41:59,057 INFO L158 Benchmark]: TraceAbstraction took 389665.16ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 130.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-02-20 12:41:59,058 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.15ms. Allocated memory is still 119.5MB. Free memory is still 92.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.12ms. Allocated memory is still 178.3MB. Free memory was 144.3MB in the beginning and 130.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.63ms. Allocated memory is still 178.3MB. Free memory was 130.7MB in the beginning and 127.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.15ms. Allocated memory is still 178.3MB. Free memory was 127.6MB in the beginning and 122.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1232.65ms. Allocated memory is still 178.3MB. Free memory was 122.3MB in the beginning and 131.2MB in the end (delta: -8.9MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. * TraceAbstraction took 389665.16ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 130.2MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. 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-448d4d7-m [2024-02-20 12:42:01,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:42:01,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-20 12:42:01,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:42:01,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:42:01,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:42:01,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:42:01,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:42:01,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:42:01,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:42:01,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:42:01,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:42:01,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:42:01,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:42:01,381 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:42:01,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:42:01,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:42:01,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:42:01,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:42:01,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:42:01,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:42:01,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:42:01,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:42:01,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-20 12:42:01,388 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-20 12:42:01,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:42:01,392 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-20 12:42:01,392 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:42:01,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:42:01,393 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:42:01,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:42:01,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:42:01,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:42:01,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:42:01,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:42:01,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:42:01,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:42:01,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:42:01,395 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-20 12:42:01,395 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-20 12:42:01,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:42:01,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:42:01,396 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:42:01,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:42:01,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:42:01,397 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-20 12:42:01,397 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-20 12:42:01,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:42:01,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:42:01,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:42:01,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:42:01,744 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:42:01,745 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-20 12:42:02,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:42:03,190 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:42:03,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons-eq.wvr.c [2024-02-20 12:42:03,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b137ae99/7e4c279450cf43f0b770b1fac2fd91f8/FLAGf0d63e308 [2024-02-20 12:42:03,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b137ae99/7e4c279450cf43f0b770b1fac2fd91f8 [2024-02-20 12:42:03,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:42:03,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:42:03,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:42:03,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:42:03,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:42:03,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16f85583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03, skipping insertion in model container [2024-02-20 12:42:03,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,265 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:42:03,450 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-20 12:42:03,470 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:42:03,483 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-20 12:42:03,490 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:42:03,526 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-20 12:42:03,531 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:42:03,540 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:42:03,571 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-20 12:42:03,574 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:42:03,586 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:42:03,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03 WrapperNode [2024-02-20 12:42:03,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:42:03,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:42:03,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:42:03,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:42:03,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,656 INFO L138 Inliner]: procedures = 30, calls = 80, calls flagged for inlining = 26, calls inlined = 32, statements flattened = 399 [2024-02-20 12:42:03,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:42:03,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:42:03,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:42:03,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:42:03,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,702 INFO L175 MemorySlicer]: Split 30 memory accesses to 7 slices as follows [2, 16, 2, 2, 2, 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, 4, 1, 1, 1, 1, 1]. [2024-02-20 12:42:03,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:42:03,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:42:03,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:42:03,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:42:03,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (1/1) ... [2024-02-20 12:42:03,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:42:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:42:03,828 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-20 12:42:03,852 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-20 12:42:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:42:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-02-20 12:42:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-02-20 12:42:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-02-20 12:42:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-02-20 12:42:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-02-20 12:42:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-02-20 12:42:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-02-20 12:42:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-20 12:42:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-20 12:42:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-20 12:42:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-20 12:42:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-02-20 12:42:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-02-20 12:42:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-02-20 12:42:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-20 12:42:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-20 12:42:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-20 12:42:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-20 12:42:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-20 12:42:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-02-20 12:42:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-02-20 12:42:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:42:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-20 12:42:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-20 12:42:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-20 12:42:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-20 12:42:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-02-20 12:42:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:42:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:42:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:42:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:42:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 12:42:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 12:42:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:42:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:42:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:42:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:42:03,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:42:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-02-20 12:42:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-02-20 12:42:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-02-20 12:42:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-02-20 12:42:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-02-20 12:42:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-02-20 12:42:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-02-20 12:42:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:42:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-20 12:42:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-20 12:42:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-20 12:42:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-20 12:42:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-02-20 12:42:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-02-20 12:42:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-02-20 12:42:03,892 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:42:04,078 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:42:04,079 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:42:04,732 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:42:04,732 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:42:05,248 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:42:05,248 INFO L320 CfgBuilder]: Removed 9 assume(true) statements. [2024-02-20 12:42:05,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:42:05 BoogieIcfgContainer [2024-02-20 12:42:05,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:42:05,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:42:05,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:42:05,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:42:05,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:42:03" (1/3) ... [2024-02-20 12:42:05,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d3efa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:42:05, skipping insertion in model container [2024-02-20 12:42:05,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:42:03" (2/3) ... [2024-02-20 12:42:05,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d3efa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:42:05, skipping insertion in model container [2024-02-20 12:42:05,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:42:05" (3/3) ... [2024-02-20 12:42:05,259 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-02-20 12:42:05,276 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:42:05,276 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:42:05,276 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:42:05,329 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 12:42:05,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 105 flow [2024-02-20 12:42:05,419 INFO L124 PetriNetUnfolderBase]: 9/39 cut-off events. [2024-02-20 12:42:05,420 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:42:05,425 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-20 12:42:05,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 42 transitions, 105 flow [2024-02-20 12:42:05,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 38 transitions, 94 flow [2024-02-20 12:42:05,442 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:42:05,448 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;@6bf1eb68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:42:05,449 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 12:42:05,461 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:42:05,461 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2024-02-20 12:42:05,461 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:42:05,461 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:05,462 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-20 12:42:05,462 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-20 12:42:05,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -120437692, now seen corresponding path program 1 times [2024-02-20 12:42:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:05,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7531133] [2024-02-20 12:42:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:05,487 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-20 12:42:05,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:05,489 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-20 12:42:05,560 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-20 12:42:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:05,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-20 12:42:05,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:05,760 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-20 12:42:05,760 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:42:05,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7531133] [2024-02-20 12:42:05,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7531133] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:42:05,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:42:05,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:42:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081626695] [2024-02-20 12:42:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:42:05,768 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:42:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:42:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:42:05,797 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:42:05,799 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-20 12:42:05,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:05,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:42:05,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:06,122 INFO L124 PetriNetUnfolderBase]: 250/395 cut-off events. [2024-02-20 12:42:06,122 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-02-20 12:42:06,127 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-20 12:42:06,131 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 43 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-02-20 12:42:06,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 214 flow [2024-02-20 12:42:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:42:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:42:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-02-20 12:42:06,141 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-02-20 12:42:06,146 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2024-02-20 12:42:06,146 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 50 transitions, 214 flow [2024-02-20 12:42:06,147 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-20 12:42:06,147 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:06,148 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-20 12:42:06,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-02-20 12:42:06,355 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-20 12:42:06,355 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-20 12:42:06,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2010327227, now seen corresponding path program 1 times [2024-02-20 12:42:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:06,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291819106] [2024-02-20 12:42:06,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:06,358 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-20 12:42:06,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:06,363 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-20 12:42:06,364 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-20 12:42:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:06,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-20 12:42:06,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:06,590 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-20 12:42:06,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:42:06,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:06,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291819106] [2024-02-20 12:42:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291819106] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:42:06,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:42:06,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:42:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452129989] [2024-02-20 12:42:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:42:06,593 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:42:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:06,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:42:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:42:06,602 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2024-02-20 12:42:06,603 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-20 12:42:06,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:06,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2024-02-20 12:42:06,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:06,867 INFO L124 PetriNetUnfolderBase]: 352/548 cut-off events. [2024-02-20 12:42:06,867 INFO L125 PetriNetUnfolderBase]: For 53/79 co-relation queries the response was YES. [2024-02-20 12:42:06,868 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-20 12:42:06,871 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 56 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2024-02-20 12:42:06,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 394 flow [2024-02-20 12:42:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:42:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:42:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2024-02-20 12:42:06,873 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-02-20 12:42:06,873 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-02-20 12:42:06,874 INFO L507 AbstractCegarLoop]: Abstraction has has 43 places, 64 transitions, 394 flow [2024-02-20 12:42:06,874 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-20 12:42:06,874 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:06,874 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-20 12:42:06,895 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-20 12:42:07,082 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-20 12:42:07,083 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-20 12:42:07,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash -833038884, now seen corresponding path program 1 times [2024-02-20 12:42:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:07,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029651661] [2024-02-20 12:42:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:07,084 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-20 12:42:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:07,086 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-20 12:42:07,087 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-20 12:42:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:07,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-20 12:42:07,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:07,368 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-20 12:42:07,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:42:07,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029651661] [2024-02-20 12:42:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029651661] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:42:07,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:42:07,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:42:07,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450115887] [2024-02-20 12:42:07,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:42:07,370 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:42:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:07,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:42:07,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:42:07,374 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2024-02-20 12:42:07,375 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-20 12:42:07,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:07,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2024-02-20 12:42:07,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:07,892 INFO L124 PetriNetUnfolderBase]: 724/1092 cut-off events. [2024-02-20 12:42:07,892 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2024-02-20 12:42:07,895 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-20 12:42:07,902 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 88 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2024-02-20 12:42:07,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 100 transitions, 798 flow [2024-02-20 12:42:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:42:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:42:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-02-20 12:42:07,904 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-02-20 12:42:07,905 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2024-02-20 12:42:07,905 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 100 transitions, 798 flow [2024-02-20 12:42:07,906 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-20 12:42:07,906 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:07,906 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-20 12:42:07,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-02-20 12:42:08,135 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-20 12:42:08,136 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-20 12:42:08,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1616066780, now seen corresponding path program 2 times [2024-02-20 12:42:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:08,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83297285] [2024-02-20 12:42:08,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:42:08,137 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-20 12:42:08,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:08,139 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-20 12:42:08,169 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-20 12:42:08,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:42:08,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:42:08,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-20 12:42:08,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:08,450 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-20 12:42:08,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:42:08,542 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-20 12:42:08,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:08,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83297285] [2024-02-20 12:42:08,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83297285] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:42:08,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:42:08,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-02-20 12:42:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901994510] [2024-02-20 12:42:08,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-20 12:42:08,544 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 12:42:08,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 12:42:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-02-20 12:42:08,566 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2024-02-20 12:42:08,567 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-20 12:42:08,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:08,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2024-02-20 12:42:08,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:11,409 INFO L124 PetriNetUnfolderBase]: 7582/10973 cut-off events. [2024-02-20 12:42:11,410 INFO L125 PetriNetUnfolderBase]: For 9193/9195 co-relation queries the response was YES. [2024-02-20 12:42:11,435 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-20 12:42:11,505 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 976 selfloop transitions, 173 changer transitions 6/1160 dead transitions. [2024-02-20 12:42:11,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 1160 transitions, 11804 flow [2024-02-20 12:42:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-20 12:42:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-20 12:42:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 388 transitions. [2024-02-20 12:42:11,508 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48621553884711777 [2024-02-20 12:42:11,509 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2024-02-20 12:42:11,509 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 1160 transitions, 11804 flow [2024-02-20 12:42:11,509 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-20 12:42:11,509 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:11,509 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-20 12:42:11,518 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-20 12:42:11,717 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-20 12:42:11,718 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-20 12:42:11,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 670601807, now seen corresponding path program 1 times [2024-02-20 12:42:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695460730] [2024-02-20 12:42:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:11,720 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-20 12:42:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:11,737 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-20 12:42:11,778 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-20 12:42:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:11,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-20 12:42:11,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:12,017 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-20 12:42:12,017 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:42:12,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:12,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695460730] [2024-02-20 12:42:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695460730] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:42:12,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:42:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:42:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377358243] [2024-02-20 12:42:12,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:42:12,018 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:42:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:42:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:42:12,019 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:42:12,019 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-20 12:42:12,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:12,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:42:12,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:14,281 INFO L124 PetriNetUnfolderBase]: 7608/11034 cut-off events. [2024-02-20 12:42:14,281 INFO L125 PetriNetUnfolderBase]: For 16046/16046 co-relation queries the response was YES. [2024-02-20 12:42:14,298 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-20 12:42:14,374 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 1081 selfloop transitions, 2 changer transitions 29/1184 dead transitions. [2024-02-20 12:42:14,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 1184 transitions, 14283 flow [2024-02-20 12:42:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:42:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:42:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-02-20 12:42:14,376 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2024-02-20 12:42:14,376 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2024-02-20 12:42:14,376 INFO L507 AbstractCegarLoop]: Abstraction has has 68 places, 1184 transitions, 14283 flow [2024-02-20 12:42:14,377 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-20 12:42:14,377 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:14,377 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-20 12:42:14,400 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-20 12:42:14,583 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-20 12:42:14,583 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-20 12:42:14,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash 580850241, now seen corresponding path program 1 times [2024-02-20 12:42:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:14,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545323099] [2024-02-20 12:42:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:14,585 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-20 12:42:14,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:14,586 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-20 12:42:14,602 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-20 12:42:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:14,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-20 12:42:14,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:15,007 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-20 12:42:15,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:42:15,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545323099] [2024-02-20 12:42:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545323099] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:42:15,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:42:15,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:42:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936796532] [2024-02-20 12:42:15,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:42:15,008 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:42:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:15,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:42:15,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:42:15,009 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:42:15,009 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-20 12:42:15,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:15,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:42:15,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:17,261 INFO L124 PetriNetUnfolderBase]: 7695/11227 cut-off events. [2024-02-20 12:42:17,261 INFO L125 PetriNetUnfolderBase]: For 24191/24191 co-relation queries the response was YES. [2024-02-20 12:42:17,276 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-20 12:42:17,327 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 1082 selfloop transitions, 2 changer transitions 100/1256 dead transitions. [2024-02-20 12:42:17,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 1256 transitions, 17569 flow [2024-02-20 12:42:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:42:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:42:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-02-20 12:42:17,329 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-02-20 12:42:17,329 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2024-02-20 12:42:17,329 INFO L507 AbstractCegarLoop]: Abstraction has has 72 places, 1256 transitions, 17569 flow [2024-02-20 12:42:17,330 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-20 12:42:17,330 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:17,330 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-20 12:42:17,340 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-20 12:42:17,535 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-20 12:42:17,536 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-20 12:42:17,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1921808852, now seen corresponding path program 1 times [2024-02-20 12:42:17,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:17,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35782248] [2024-02-20 12:42:17,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:17,537 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-20 12:42:17,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:17,539 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-20 12:42:17,540 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-20 12:42:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:17,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-20 12:42:17,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:17,893 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-20 12:42:17,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:42:17,988 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-20 12:42:17,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35782248] [2024-02-20 12:42:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35782248] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:42:17,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:42:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-02-20 12:42:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115369777] [2024-02-20 12:42:17,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-20 12:42:17,996 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 12:42:17,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:17,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 12:42:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-02-20 12:42:17,997 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:42:17,997 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-20 12:42:17,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:17,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:42:17,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:23,197 INFO L124 PetriNetUnfolderBase]: 15294/22256 cut-off events. [2024-02-20 12:42:23,198 INFO L125 PetriNetUnfolderBase]: For 63846/63862 co-relation queries the response was YES. [2024-02-20 12:42:23,242 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-20 12:42:23,369 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 2157 selfloop transitions, 8 changer transitions 130/2367 dead transitions. [2024-02-20 12:42:23,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 2367 transitions, 38244 flow [2024-02-20 12:42:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 12:42:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 12:42:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-02-20 12:42:23,370 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2024-02-20 12:42:23,371 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2024-02-20 12:42:23,371 INFO L507 AbstractCegarLoop]: Abstraction has has 79 places, 2367 transitions, 38244 flow [2024-02-20 12:42:23,371 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-20 12:42:23,371 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:23,372 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-20 12:42:23,377 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-20 12:42:23,577 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-20 12:42:23,578 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-20 12:42:23,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -754234129, now seen corresponding path program 1 times [2024-02-20 12:42:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:23,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287775408] [2024-02-20 12:42:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:23,579 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-20 12:42:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:23,580 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-20 12:42:23,581 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-20 12:42:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:23,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-20 12:42:23,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:24,026 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-20 12:42:24,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:42:24,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:24,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287775408] [2024-02-20 12:42:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287775408] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:42:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:42:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:42:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909237157] [2024-02-20 12:42:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:42:24,027 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:42:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:42:24,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:42:24,028 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:42:24,028 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-20 12:42:24,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:24,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:42:24,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:31,245 INFO L124 PetriNetUnfolderBase]: 15534/22746 cut-off events. [2024-02-20 12:42:31,246 INFO L125 PetriNetUnfolderBase]: For 92064/92080 co-relation queries the response was YES. [2024-02-20 12:42:31,294 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-20 12:42:31,427 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 2163 selfloop transitions, 4 changer transitions 276/2515 dead transitions. [2024-02-20 12:42:31,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 2515 transitions, 45588 flow [2024-02-20 12:42:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:42:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:42:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-02-20 12:42:31,428 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-02-20 12:42:31,428 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2024-02-20 12:42:31,429 INFO L507 AbstractCegarLoop]: Abstraction has has 82 places, 2515 transitions, 45588 flow [2024-02-20 12:42:31,429 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-20 12:42:31,429 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:31,429 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-20 12:42:31,440 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-20 12:42:31,635 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-20 12:42:31,636 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-20 12:42:31,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1074290214, now seen corresponding path program 1 times [2024-02-20 12:42:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818617709] [2024-02-20 12:42:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:31,637 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-20 12:42:31,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:31,641 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-20 12:42:31,642 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-20 12:42:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:32,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 12:42:32,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:32,144 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-20 12:42:32,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:42:32,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:32,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818617709] [2024-02-20 12:42:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818617709] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:42:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:42:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:42:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122641875] [2024-02-20 12:42:32,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:42:32,146 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:42:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:32,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:42:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:42:32,147 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:42:32,147 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-20 12:42:32,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:32,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:42:32,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:41,473 INFO L124 PetriNetUnfolderBase]: 17533/26551 cut-off events. [2024-02-20 12:42:41,474 INFO L125 PetriNetUnfolderBase]: For 159570/159594 co-relation queries the response was YES. [2024-02-20 12:42:41,531 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-20 12:42:41,687 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 2169 selfloop transitions, 4 changer transitions 1025/3270 dead transitions. [2024-02-20 12:42:41,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 3270 transitions, 66201 flow [2024-02-20 12:42:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:42:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:42:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-02-20 12:42:41,689 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2024-02-20 12:42:41,689 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 46 predicate places. [2024-02-20 12:42:41,689 INFO L507 AbstractCegarLoop]: Abstraction has has 85 places, 3270 transitions, 66201 flow [2024-02-20 12:42:41,690 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-20 12:42:41,690 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:41,690 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-20 12:42:41,696 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-20 12:42:41,896 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-20 12:42:41,896 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-20 12:42:41,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1744420335, now seen corresponding path program 1 times [2024-02-20 12:42:41,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:41,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854310826] [2024-02-20 12:42:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:41,897 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-20 12:42:41,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:41,898 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-20 12:42:41,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 (11)] Waiting until timeout for monitored process [2024-02-20 12:42:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:42,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 12:42:42,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:42,470 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-20 12:42:42,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:42:42,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:42:42,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854310826] [2024-02-20 12:42:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854310826] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:42:42,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:42:42,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:42:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327759473] [2024-02-20 12:42:42,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:42:42,472 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:42:42,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:42:42,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:42:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:42:42,473 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2024-02-20 12:42:42,473 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-20 12:42:42,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:42,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2024-02-20 12:42:42,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:56,262 INFO L124 PetriNetUnfolderBase]: 19532/30380 cut-off events. [2024-02-20 12:42:56,263 INFO L125 PetriNetUnfolderBase]: For 233511/233535 co-relation queries the response was YES. [2024-02-20 12:42:56,337 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-20 12:42:56,514 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 2169 selfloop transitions, 8 changer transitions 1812/4061 dead transitions. [2024-02-20 12:42:56,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 4061 transitions, 90626 flow [2024-02-20 12:42:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:42:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:42:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-02-20 12:42:56,516 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-02-20 12:42:56,516 INFO L308 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2024-02-20 12:42:56,516 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 4061 transitions, 90626 flow [2024-02-20 12:42:56,516 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-20 12:42:56,517 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:56,517 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-20 12:42:56,523 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-20 12:42:56,722 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-20 12:42:56,723 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-20 12:42:56,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1685961188, now seen corresponding path program 1 times [2024-02-20 12:42:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:42:56,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730841016] [2024-02-20 12:42:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:56,724 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-20 12:42:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:42:56,725 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-20 12:42:56,727 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-20 12:42:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:57,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-20 12:42:57,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:58,274 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 525 treesize of output 461 [2024-02-20 12:42:58,285 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 461 treesize of output 397 [2024-02-20 12:43:01,365 INFO L349 Elim1Store]: treesize reduction 800, result has 48.8 percent of original size [2024-02-20 12:43:01,365 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 477 treesize of output 906 [2024-02-20 12:43:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-20 12:43:09,446 INFO L327 TraceCheckSpWp]: Computing backward predicates...