./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/pthread-deagle/arithmetic_prog_bad.i -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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:19:18,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:19:18,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:19:18,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:19:18,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:19:18,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:19:18,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:19:18,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:19:18,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:19:18,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:19:18,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:19:18,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:19:18,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:19:18,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:19:18,797 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:19:18,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:19:18,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:19:18,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:19:18,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:19:18,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:19:18,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:19:18,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:19:18,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:19:18,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:19:18,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:19:18,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:19:18,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:19:18,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:19:18,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:19:18,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:19:18,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:19:18,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:19:18,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:19:18,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:19:18,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:19:18,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:19:18,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:19:18,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:19:18,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:19:18,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:19:18,804 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:19:18,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:19:18,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:19:18,805 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-01-27 16:19:19,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:19:19,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:19:19,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:19:19,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:19:19,073 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:19:19,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-01-27 16:19:20,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:19:20,480 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:19:20,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-01-27 16:19:20,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a00cb4b/d6c7f4c0dac346dd8ad0fd983afe3471/FLAGe15662ca8 [2024-01-27 16:19:20,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a00cb4b/d6c7f4c0dac346dd8ad0fd983afe3471 [2024-01-27 16:19:20,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:19:20,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:19:20,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:19:20,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:19:20,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:19:20,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:19:20" (1/1) ... [2024-01-27 16:19:20,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b00cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:20, skipping insertion in model container [2024-01-27 16:19:20,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:19:20" (1/1) ... [2024-01-27 16:19:20,565 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:19:20,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/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-01-27 16:19:20,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:19:20,966 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:19:21,050 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-01-27 16:19:21,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:19:21,159 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:19:21,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21 WrapperNode [2024-01-27 16:19:21,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:19:21,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:19:21,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:19:21,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:19:21,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,235 INFO L138 Inliner]: procedures = 244, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2024-01-27 16:19:21,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:19:21,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:19:21,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:19:21,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:19:21,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,281 INFO L175 MemorySlicer]: Split 31 memory accesses to 7 slices as follows [2, 1, 2, 2, 8, 8, 8]. 26 percent of accesses are in the largest equivalence class. The 27 initializations are split as follows [2, 1, 0, 0, 8, 8, 8]. The 2 writes are split as follows [0, 0, 1, 1, 0, 0, 0]. [2024-01-27 16:19:21,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:19:21,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:19:21,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:19:21,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:19:21,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (1/1) ... [2024-01-27 16:19:21,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:19:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:21,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:19:21,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:19:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:19:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:19:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-01-27 16:19:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-01-27 16:19:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-01-27 16:19:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-01-27 16:19:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-01-27 16:19:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-01-27 16:19:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-01-27 16:19:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:19:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:19:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:19:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:19:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:19:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:19:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 16:19:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-01-27 16:19:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 16:19:21,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 16:19:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 16:19:21,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 16:19:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:19:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:19:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:19:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:19:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:19:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 16:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-01-27 16:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:19:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:19:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 16:19:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-01-27 16:19:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:19:21,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:19:21,417 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:19:21,548 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:19:21,551 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:19:21,767 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:19:21,767 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:19:21,928 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:19:21,928 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 16:19:21,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:19:21 BoogieIcfgContainer [2024-01-27 16:19:21,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:19:21,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:19:21,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:19:21,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:19:21,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:19:20" (1/3) ... [2024-01-27 16:19:21,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b0c595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:19:21, skipping insertion in model container [2024-01-27 16:19:21,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:21" (2/3) ... [2024-01-27 16:19:21,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b0c595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:19:21, skipping insertion in model container [2024-01-27 16:19:21,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:19:21" (3/3) ... [2024-01-27 16:19:21,936 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-01-27 16:19:21,944 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:19:21,952 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:19:21,953 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:19:21,953 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:19:21,996 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:19:22,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 94 flow [2024-01-27 16:19:22,077 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2024-01-27 16:19:22,077 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:19:22,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2024-01-27 16:19:22,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 94 flow [2024-01-27 16:19:22,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 34 transitions, 80 flow [2024-01-27 16:19:22,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:19:22,097 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3330089c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:19:22,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 16:19:22,105 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:19:22,106 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-01-27 16:19:22,106 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:19:22,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:22,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:22,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:22,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash 944210106, now seen corresponding path program 1 times [2024-01-27 16:19:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124504235] [2024-01-27 16:19:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:22,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:22,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:22,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124504235] [2024-01-27 16:19:22,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124504235] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:22,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:22,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:19:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111571674] [2024-01-27 16:19:22,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:22,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:19:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:19:22,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:19:22,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-01-27 16:19:22,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-01-27 16:19:22,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:22,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-01-27 16:19:22,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:22,587 INFO L124 PetriNetUnfolderBase]: 430/783 cut-off events. [2024-01-27 16:19:22,587 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-27 16:19:22,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 783 events. 430/783 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3541 event pairs, 167 based on Foata normal form. 18/788 useless extension candidates. Maximal degree in co-relation 1336. Up to 412 conditions per place. [2024-01-27 16:19:22,594 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-01-27 16:19:22,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 199 flow [2024-01-27 16:19:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:19:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:19:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-01-27 16:19:22,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-01-27 16:19:22,605 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 80 flow. Second operand 3 states and 84 transitions. [2024-01-27 16:19:22,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 199 flow [2024-01-27 16:19:22,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 189 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 16:19:22,609 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 84 flow [2024-01-27 16:19:22,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2024-01-27 16:19:22,613 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2024-01-27 16:19:22,613 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 84 flow [2024-01-27 16:19:22,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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-01-27 16:19:22,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:22,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:22,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:19:22,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:22,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1931119106, now seen corresponding path program 1 times [2024-01-27 16:19:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761316341] [2024-01-27 16:19:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761316341] [2024-01-27 16:19:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761316341] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:22,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:22,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:19:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369435861] [2024-01-27 16:19:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:22,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:19:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:22,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:19:22,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:19:22,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-01-27 16:19:22,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:22,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:22,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-01-27 16:19:22,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:22,833 INFO L124 PetriNetUnfolderBase]: 784/1373 cut-off events. [2024-01-27 16:19:22,834 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2024-01-27 16:19:22,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 1373 events. 784/1373 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6721 event pairs, 363 based on Foata normal form. 26/1387 useless extension candidates. Maximal degree in co-relation 969. Up to 744 conditions per place. [2024-01-27 16:19:22,841 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 41 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-01-27 16:19:22,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 217 flow [2024-01-27 16:19:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:19:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:19:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-01-27 16:19:22,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-01-27 16:19:22,843 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 84 flow. Second operand 3 states and 84 transitions. [2024-01-27 16:19:22,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 217 flow [2024-01-27 16:19:22,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:22,845 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 94 flow [2024-01-27 16:19:22,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2024-01-27 16:19:22,845 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-01-27 16:19:22,846 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 94 flow [2024-01-27 16:19:22,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:22,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:22,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:22,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:19:22,847 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:22,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2007435854, now seen corresponding path program 1 times [2024-01-27 16:19:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227264670] [2024-01-27 16:19:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:22,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227264670] [2024-01-27 16:19:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227264670] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:19:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302950886] [2024-01-27 16:19:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:22,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:19:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:19:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:19:22,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-01-27 16:19:22,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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-01-27 16:19:22,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:22,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-01-27 16:19:22,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:23,093 INFO L124 PetriNetUnfolderBase]: 441/931 cut-off events. [2024-01-27 16:19:23,093 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-01-27 16:19:23,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 931 events. 441/931 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4524 event pairs, 189 based on Foata normal form. 64/994 useless extension candidates. Maximal degree in co-relation 600. Up to 388 conditions per place. [2024-01-27 16:19:23,097 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 31 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2024-01-27 16:19:23,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 218 flow [2024-01-27 16:19:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:19:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:19:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-01-27 16:19:23,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-01-27 16:19:23,099 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 94 flow. Second operand 3 states and 81 transitions. [2024-01-27 16:19:23,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 218 flow [2024-01-27 16:19:23,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:23,101 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 108 flow [2024-01-27 16:19:23,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2024-01-27 16:19:23,102 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2024-01-27 16:19:23,102 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 108 flow [2024-01-27 16:19:23,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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-01-27 16:19:23,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:23,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:23,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:19:23,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:23,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1290759006, now seen corresponding path program 2 times [2024-01-27 16:19:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:23,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311547972] [2024-01-27 16:19:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:23,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:23,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311547972] [2024-01-27 16:19:23,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311547972] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:23,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558921670] [2024-01-27 16:19:23,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:19:23,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:23,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:23,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:19:23,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 16:19:23,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:19:23,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:23,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 16:19:23,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:23,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558921670] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:19:23,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:19:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-01-27 16:19:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261400184] [2024-01-27 16:19:23,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:19:23,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:19:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:19:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:19:23,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-01-27 16:19:23,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:23,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:23,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-01-27 16:19:23,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:23,781 INFO L124 PetriNetUnfolderBase]: 1141/2226 cut-off events. [2024-01-27 16:19:23,781 INFO L125 PetriNetUnfolderBase]: For 703/703 co-relation queries the response was YES. [2024-01-27 16:19:23,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5263 conditions, 2226 events. 1141/2226 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 11864 event pairs, 73 based on Foata normal form. 130/2348 useless extension candidates. Maximal degree in co-relation 1343. Up to 376 conditions per place. [2024-01-27 16:19:23,790 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 154 selfloop transitions, 27 changer transitions 0/190 dead transitions. [2024-01-27 16:19:23,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 190 transitions, 989 flow [2024-01-27 16:19:23,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 16:19:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 16:19:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 360 transitions. [2024-01-27 16:19:23,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-01-27 16:19:23,795 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 108 flow. Second operand 13 states and 360 transitions. [2024-01-27 16:19:23,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 190 transitions, 989 flow [2024-01-27 16:19:23,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 190 transitions, 905 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:23,804 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 316 flow [2024-01-27 16:19:23,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=316, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2024-01-27 16:19:23,806 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2024-01-27 16:19:23,806 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 316 flow [2024-01-27 16:19:23,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:23,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:23,807 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:23,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 16:19:24,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:24,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:24,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1541420788, now seen corresponding path program 3 times [2024-01-27 16:19:24,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:24,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714465226] [2024-01-27 16:19:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-01-27 16:19:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714465226] [2024-01-27 16:19:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714465226] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:24,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753293101] [2024-01-27 16:19:24,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:19:24,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:24,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:24,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:19:24,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 16:19:24,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 16:19:24,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:24,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 16:19:24,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-01-27 16:19:24,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 16:19:24,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753293101] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:24,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 16:19:24,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-01-27 16:19:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739852174] [2024-01-27 16:19:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:24,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:19:24,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:19:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:19:24,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-01-27 16:19:24,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:24,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:24,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-01-27 16:19:24,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:24,495 INFO L124 PetriNetUnfolderBase]: 1136/2290 cut-off events. [2024-01-27 16:19:24,496 INFO L125 PetriNetUnfolderBase]: For 4288/4288 co-relation queries the response was YES. [2024-01-27 16:19:24,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6787 conditions, 2290 events. 1136/2290 cut-off events. For 4288/4288 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 12454 event pairs, 277 based on Foata normal form. 0/2165 useless extension candidates. Maximal degree in co-relation 4982. Up to 1082 conditions per place. [2024-01-27 16:19:24,509 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 75 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2024-01-27 16:19:24,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 677 flow [2024-01-27 16:19:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:19:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:19:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-01-27 16:19:24,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58125 [2024-01-27 16:19:24,511 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 316 flow. Second operand 4 states and 93 transitions. [2024-01-27 16:19:24,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 677 flow [2024-01-27 16:19:24,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 90 transitions, 617 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-01-27 16:19:24,523 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 307 flow [2024-01-27 16:19:24,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2024-01-27 16:19:24,525 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2024-01-27 16:19:24,526 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 307 flow [2024-01-27 16:19:24,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:24,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:24,526 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:24,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 16:19:24,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:24,739 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:24,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2046953146, now seen corresponding path program 4 times [2024-01-27 16:19:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:24,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143018965] [2024-01-27 16:19:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-01-27 16:19:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143018965] [2024-01-27 16:19:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143018965] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:24,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:24,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:19:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403598445] [2024-01-27 16:19:24,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:24,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:19:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:24,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:19:24,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:19:24,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-01-27 16:19:24,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:24,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:24,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-01-27 16:19:24,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:25,013 INFO L124 PetriNetUnfolderBase]: 771/1593 cut-off events. [2024-01-27 16:19:25,013 INFO L125 PetriNetUnfolderBase]: For 3304/3304 co-relation queries the response was YES. [2024-01-27 16:19:25,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 1593 events. 771/1593 cut-off events. For 3304/3304 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8060 event pairs, 206 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 4012. Up to 1113 conditions per place. [2024-01-27 16:19:25,020 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 58 selfloop transitions, 3 changer transitions 3/75 dead transitions. [2024-01-27 16:19:25,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 505 flow [2024-01-27 16:19:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:19:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:19:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-01-27 16:19:25,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-01-27 16:19:25,022 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 307 flow. Second operand 3 states and 78 transitions. [2024-01-27 16:19:25,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 505 flow [2024-01-27 16:19:25,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:25,027 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 322 flow [2024-01-27 16:19:25,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-01-27 16:19:25,028 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2024-01-27 16:19:25,028 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 322 flow [2024-01-27 16:19:25,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:25,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:25,028 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:25,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:19:25,029 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:25,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -914434892, now seen corresponding path program 5 times [2024-01-27 16:19:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:25,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769738356] [2024-01-27 16:19:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-27 16:19:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:25,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769738356] [2024-01-27 16:19:25,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769738356] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:25,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854786501] [2024-01-27 16:19:25,103 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 16:19:25,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:25,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:25,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:19:25,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 16:19:25,238 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-01-27 16:19:25,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:19:25,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 16:19:25,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-27 16:19:25,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-01-27 16:19:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854786501] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:19:25,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:19:25,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-01-27 16:19:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68219371] [2024-01-27 16:19:25,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:19:25,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:19:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:19:25,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:19:25,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-01-27 16:19:25,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:25,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:25,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-01-27 16:19:25,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:25,535 INFO L124 PetriNetUnfolderBase]: 841/1731 cut-off events. [2024-01-27 16:19:25,535 INFO L125 PetriNetUnfolderBase]: For 3952/3960 co-relation queries the response was YES. [2024-01-27 16:19:25,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5386 conditions, 1731 events. 841/1731 cut-off events. For 3952/3960 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8463 event pairs, 144 based on Foata normal form. 52/1768 useless extension candidates. Maximal degree in co-relation 3935. Up to 546 conditions per place. [2024-01-27 16:19:25,546 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 75 selfloop transitions, 12 changer transitions 1/102 dead transitions. [2024-01-27 16:19:25,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 698 flow [2024-01-27 16:19:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-01-27 16:19:25,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.67 [2024-01-27 16:19:25,548 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 322 flow. Second operand 5 states and 134 transitions. [2024-01-27 16:19:25,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 698 flow [2024-01-27 16:19:25,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 686 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 16:19:25,557 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 354 flow [2024-01-27 16:19:25,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2024-01-27 16:19:25,558 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places. [2024-01-27 16:19:25,558 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 354 flow [2024-01-27 16:19:25,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:19:25,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:25,559 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:25,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-27 16:19:25,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:25,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:25,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash -236427342, now seen corresponding path program 6 times [2024-01-27 16:19:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298969483] [2024-01-27 16:19:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:19:25,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:19:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:19:25,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:19:25,871 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:19:25,872 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-01-27 16:19:25,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-01-27 16:19:25,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-01-27 16:19:25,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:19:25,874 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2024-01-27 16:19:25,879 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:19:25,881 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:19:25,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:19:25 BasicIcfg [2024-01-27 16:19:25,969 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:19:25,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:19:25,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:19:25,970 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:19:25,970 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:19:21" (3/4) ... [2024-01-27 16:19:25,971 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:19:26,054 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:19:26,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:19:26,055 INFO L158 Benchmark]: Toolchain (without parser) took 5541.35ms. Allocated memory was 172.0MB in the beginning and 310.4MB in the end (delta: 138.4MB). Free memory was 103.0MB in the beginning and 197.9MB in the end (delta: -94.9MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-01-27 16:19:26,055 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 75.2MB in the beginning and 75.1MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:19:26,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.14ms. Allocated memory is still 172.0MB. Free memory was 102.8MB in the beginning and 132.1MB in the end (delta: -29.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 16:19:26,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.21ms. Allocated memory is still 172.0MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:19:26,056 INFO L158 Benchmark]: Boogie Preprocessor took 83.99ms. Allocated memory is still 172.0MB. Free memory was 129.4MB in the beginning and 126.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:19:26,056 INFO L158 Benchmark]: RCFGBuilder took 607.68ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 79.8MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-01-27 16:19:26,057 INFO L158 Benchmark]: TraceAbstraction took 4038.71ms. Allocated memory was 172.0MB in the beginning and 310.4MB in the end (delta: 138.4MB). Free memory was 79.0MB in the beginning and 210.5MB in the end (delta: -131.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-01-27 16:19:26,057 INFO L158 Benchmark]: Witness Printer took 84.89ms. Allocated memory is still 310.4MB. Free memory was 210.5MB in the beginning and 197.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:19:26,059 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.14ms. Allocated memory is still 104.9MB. Free memory was 75.2MB in the beginning and 75.1MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.14ms. Allocated memory is still 172.0MB. Free memory was 102.8MB in the beginning and 132.1MB in the end (delta: -29.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.21ms. Allocated memory is still 172.0MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.99ms. Allocated memory is still 172.0MB. Free memory was 129.4MB in the beginning and 126.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.68ms. Allocated memory is still 172.0MB. Free memory was 126.6MB in the beginning and 79.8MB in the end (delta: 46.8MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4038.71ms. Allocated memory was 172.0MB in the beginning and 310.4MB in the end (delta: 138.4MB). Free memory was 79.0MB in the beginning and 210.5MB in the end (delta: -131.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 84.89ms. Allocated memory is still 310.4MB. Free memory was 210.5MB in the beginning and 197.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, total=0] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L915] 0 \read(t1) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L892] COND TRUE 2 j < 3 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=3] [L916] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={6:0}, t2={7:0}, total=6] - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 287 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 599 IncrementalHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 2 mSDtfsCounter, 599 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 198 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=7, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 404 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 903 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 143/183 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:19:26,102 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE