./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/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.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:35:10,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:35:10,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:35:10,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:35:10,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:35:10,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:35:10,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:35:10,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:35:10,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:35:10,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:35:10,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:35:10,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:35:10,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:35:10,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:35:10,470 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:35:10,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:35:10,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:35:10,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:35:10,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:35:10,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:35:10,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:35:10,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:35:10,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:35:10,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:35:10,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:35:10,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:35:10,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:35:10,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:35:10,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:35:10,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:35:10,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:35:10,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:35:10,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:35:10,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:35:10,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:35:10,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:35:10,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:35:10,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:35:10,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:35:10,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:35:10,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:35:10,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:35:10,481 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-11-16 19:35:10,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:35:10,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:35:10,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:35:10,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:35:10,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:35:10,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-16 19:35:12,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:35:12,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:35:12,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-16 19:35:12,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9653ea4e5/76e4c9cd42414535a3d653ce7e1660e4/FLAG2474cbf49 [2024-11-16 19:35:12,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9653ea4e5/76e4c9cd42414535a3d653ce7e1660e4 [2024-11-16 19:35:12,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:35:12,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:35:12,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:35:12,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:35:12,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:35:12,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:35:12" (1/1) ... [2024-11-16 19:35:12,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f855d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:12, skipping insertion in model container [2024-11-16 19:35:12,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:35:12" (1/1) ... [2024-11-16 19:35:12,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:35:13,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-11-16 19:35:13,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:35:13,253 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:35:13,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-11-16 19:35:13,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:35:13,401 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:35:13,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13 WrapperNode [2024-11-16 19:35:13,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:35:13,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:35:13,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:35:13,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:35:13,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,461 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2024-11-16 19:35:13,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:35:13,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:35:13,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:35:13,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:35:13,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,506 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-11-16 19:35:13,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:35:13,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:35:13,546 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:35:13,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:35:13,547 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (1/1) ... [2024-11-16 19:35:13,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:35:13,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:35:13,591 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-11-16 19:35:13,594 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-11-16 19:35:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-16 19:35:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-16 19:35:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-16 19:35:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 19:35:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 19:35:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 19:35:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 19:35:13,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 19:35:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 19:35:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:35:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:35:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 19:35:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 19:35:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:35:13,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:35:13,647 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:35:13,853 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:35:13,855 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:35:14,264 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:35:14,265 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:35:15,097 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:35:15,097 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:35:15,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:35:15 BoogieIcfgContainer [2024-11-16 19:35:15,098 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:35:15,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:35:15,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:35:15,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:35:15,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:35:12" (1/3) ... [2024-11-16 19:35:15,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c42e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:35:15, skipping insertion in model container [2024-11-16 19:35:15,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:35:13" (2/3) ... [2024-11-16 19:35:15,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c42e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:35:15, skipping insertion in model container [2024-11-16 19:35:15,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:35:15" (3/3) ... [2024-11-16 19:35:15,109 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-16 19:35:15,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:35:15,128 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:35:15,128 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:35:15,192 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 19:35:15,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 50 transitions, 114 flow [2024-11-16 19:35:15,276 INFO L124 PetriNetUnfolderBase]: 10/48 cut-off events. [2024-11-16 19:35:15,278 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 19:35:15,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 48 events. 10/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 39. Up to 3 conditions per place. [2024-11-16 19:35:15,283 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 50 transitions, 114 flow [2024-11-16 19:35:15,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 44 transitions, 100 flow [2024-11-16 19:35:15,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:35:15,310 INFO L333 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, 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;@6ef4c56c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:35:15,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-16 19:35:15,337 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:35:15,339 INFO L124 PetriNetUnfolderBase]: 8/43 cut-off events. [2024-11-16 19:35:15,339 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 19:35:15,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:15,340 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:35:15,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:15,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash -438539468, now seen corresponding path program 1 times [2024-11-16 19:35:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752112304] [2024-11-16 19:35:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:15,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:35:16,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:35:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752112304] [2024-11-16 19:35:16,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752112304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:35:16,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:35:16,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:35:16,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952945568] [2024-11-16 19:35:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:35:16,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:35:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:35:16,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:35:16,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:35:16,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-11-16 19:35:16,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 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-11-16 19:35:16,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:35:16,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-11-16 19:35:16,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:35:16,397 INFO L124 PetriNetUnfolderBase]: 264/538 cut-off events. [2024-11-16 19:35:16,398 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 19:35:16,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 538 events. 264/538 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2677 event pairs, 167 based on Foata normal form. 88/521 useless extension candidates. Maximal degree in co-relation 914. Up to 412 conditions per place. [2024-11-16 19:35:16,407 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 24 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2024-11-16 19:35:16,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 140 flow [2024-11-16 19:35:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:35:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 19:35:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2024-11-16 19:35:16,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-11-16 19:35:16,424 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 100 flow. Second operand 2 states and 68 transitions. [2024-11-16 19:35:16,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 140 flow [2024-11-16 19:35:16,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 19:35:16,430 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 84 flow [2024-11-16 19:35:16,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2024-11-16 19:35:16,438 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2024-11-16 19:35:16,438 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 84 flow [2024-11-16 19:35:16,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 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-11-16 19:35:16,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:16,439 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:35:16,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:35:16,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:16,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash -311332983, now seen corresponding path program 1 times [2024-11-16 19:35:16,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:16,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757093070] [2024-11-16 19:35:16,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:16,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:35:16,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:35:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757093070] [2024-11-16 19:35:16,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757093070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:35:16,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:35:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:35:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600717678] [2024-11-16 19:35:16,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:35:16,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:35:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:35:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:35:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:35:16,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-11-16 19:35:16,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-16 19:35:16,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:35:16,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-11-16 19:35:16,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:35:17,136 INFO L124 PetriNetUnfolderBase]: 482/965 cut-off events. [2024-11-16 19:35:17,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:35:17,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 965 events. 482/965 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4975 event pairs, 203 based on Foata normal form. 16/837 useless extension candidates. Maximal degree in co-relation 1723. Up to 474 conditions per place. [2024-11-16 19:35:17,143 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 40 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-16 19:35:17,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 203 flow [2024-11-16 19:35:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:35:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:35:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-11-16 19:35:17,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-16 19:35:17,146 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 84 flow. Second operand 3 states and 100 transitions. [2024-11-16 19:35:17,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 203 flow [2024-11-16 19:35:17,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:35:17,148 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 96 flow [2024-11-16 19:35:17,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-11-16 19:35:17,149 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-11-16 19:35:17,150 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 96 flow [2024-11-16 19:35:17,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-16 19:35:17,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:17,150 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 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-11-16 19:35:17,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:35:17,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:17,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash 587831826, now seen corresponding path program 1 times [2024-11-16 19:35:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289407297] [2024-11-16 19:35:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:35:17,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:35:17,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289407297] [2024-11-16 19:35:17,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289407297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:35:17,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:35:17,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:35:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82593253] [2024-11-16 19:35:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:35:17,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:35:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:35:17,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:35:17,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:35:17,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-11-16 19:35:17,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-16 19:35:17,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:35:17,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-11-16 19:35:17,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:35:17,814 INFO L124 PetriNetUnfolderBase]: 787/1665 cut-off events. [2024-11-16 19:35:17,815 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2024-11-16 19:35:17,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 1665 events. 787/1665 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10033 event pairs, 338 based on Foata normal form. 29/1500 useless extension candidates. Maximal degree in co-relation 3016. Up to 770 conditions per place. [2024-11-16 19:35:17,825 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 41 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-11-16 19:35:17,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 225 flow [2024-11-16 19:35:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:35:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:35:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-16 19:35:17,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66 [2024-11-16 19:35:17,827 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 96 flow. Second operand 3 states and 99 transitions. [2024-11-16 19:35:17,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 225 flow [2024-11-16 19:35:17,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:35:17,829 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 106 flow [2024-11-16 19:35:17,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2024-11-16 19:35:17,830 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-11-16 19:35:17,830 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 106 flow [2024-11-16 19:35:17,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-16 19:35:17,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:17,830 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 19:35:17,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:35:17,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:17,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1468086728, now seen corresponding path program 1 times [2024-11-16 19:35:17,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:17,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345306647] [2024-11-16 19:35:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:35:18,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:35:18,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345306647] [2024-11-16 19:35:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345306647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:35:18,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901665773] [2024-11-16 19:35:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:18,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:35:18,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:35:18,218 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-11-16 19:35:18,225 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-11-16 19:35:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:18,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 19:35:18,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:35:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:35:18,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:35:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:35:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901665773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:35:18,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:35:18,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-16 19:35:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977771471] [2024-11-16 19:35:18,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:35:18,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:35:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:35:18,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:35:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:35:18,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-11-16 19:35:18,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-11-16 19:35:18,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:35:18,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-11-16 19:35:18,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:35:19,185 INFO L124 PetriNetUnfolderBase]: 1228/2455 cut-off events. [2024-11-16 19:35:19,186 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2024-11-16 19:35:19,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4679 conditions, 2455 events. 1228/2455 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14372 event pairs, 159 based on Foata normal form. 58/2354 useless extension candidates. Maximal degree in co-relation 4673. Up to 536 conditions per place. [2024-11-16 19:35:19,204 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 70 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2024-11-16 19:35:19,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 89 transitions, 373 flow [2024-11-16 19:35:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:35:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:35:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-11-16 19:35:19,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.652 [2024-11-16 19:35:19,209 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 106 flow. Second operand 5 states and 163 transitions. [2024-11-16 19:35:19,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 89 transitions, 373 flow [2024-11-16 19:35:19,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:35:19,213 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 134 flow [2024-11-16 19:35:19,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2024-11-16 19:35:19,215 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-11-16 19:35:19,215 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 134 flow [2024-11-16 19:35:19,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-11-16 19:35:19,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:19,216 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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-11-16 19:35:19,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 19:35:19,416 WARN L453 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-11-16 19:35:19,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:19,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1238851338, now seen corresponding path program 2 times [2024-11-16 19:35:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:19,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117885429] [2024-11-16 19:35:19,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-16 19:35:19,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:35:19,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117885429] [2024-11-16 19:35:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117885429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:35:19,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:35:19,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:35:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820218543] [2024-11-16 19:35:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:35:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:35:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:35:19,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:35:19,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:35:19,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-11-16 19:35:19,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-11-16 19:35:19,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:35:19,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-11-16 19:35:19,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:35:20,184 INFO L124 PetriNetUnfolderBase]: 618/1603 cut-off events. [2024-11-16 19:35:20,184 INFO L125 PetriNetUnfolderBase]: For 589/589 co-relation queries the response was YES. [2024-11-16 19:35:20,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 1603 events. 618/1603 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9066 event pairs, 274 based on Foata normal form. 96/1582 useless extension candidates. Maximal degree in co-relation 3167. Up to 524 conditions per place. [2024-11-16 19:35:20,195 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 32 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-11-16 19:35:20,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 270 flow [2024-11-16 19:35:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:35:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:35:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-11-16 19:35:20,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2024-11-16 19:35:20,201 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 134 flow. Second operand 3 states and 98 transitions. [2024-11-16 19:35:20,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 270 flow [2024-11-16 19:35:20,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 258 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-16 19:35:20,204 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 144 flow [2024-11-16 19:35:20,205 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-11-16 19:35:20,205 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2024-11-16 19:35:20,206 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 144 flow [2024-11-16 19:35:20,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-11-16 19:35:20,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:20,206 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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-11-16 19:35:20,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:35:20,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:20,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1203497704, now seen corresponding path program 3 times [2024-11-16 19:35:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478454030] [2024-11-16 19:35:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:20,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 19:35:20,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:35:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478454030] [2024-11-16 19:35:20,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478454030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:35:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674577607] [2024-11-16 19:35:20,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 19:35:20,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:35:20,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:35:20,514 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-11-16 19:35:20,516 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-11-16 19:35:20,969 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-16 19:35:20,970 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:35:20,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 19:35:20,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:35:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 19:35:21,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:35:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 19:35:21,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674577607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:35:21,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:35:21,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-16 19:35:21,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099890314] [2024-11-16 19:35:21,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:35:21,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:35:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:35:21,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:35:21,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:35:21,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2024-11-16 19:35:21,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-11-16 19:35:21,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:35:21,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2024-11-16 19:35:21,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:35:21,447 INFO L124 PetriNetUnfolderBase]: 1231/2867 cut-off events. [2024-11-16 19:35:21,448 INFO L125 PetriNetUnfolderBase]: For 1109/1109 co-relation queries the response was YES. [2024-11-16 19:35:21,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 2867 events. 1231/2867 cut-off events. For 1109/1109 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 17706 event pairs, 209 based on Foata normal form. 88/2704 useless extension candidates. Maximal degree in co-relation 6301. Up to 569 conditions per place. [2024-11-16 19:35:21,469 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 77 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2024-11-16 19:35:21,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 97 transitions, 507 flow [2024-11-16 19:35:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:35:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:35:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-11-16 19:35:21,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.664 [2024-11-16 19:35:21,471 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 144 flow. Second operand 5 states and 166 transitions. [2024-11-16 19:35:21,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 97 transitions, 507 flow [2024-11-16 19:35:21,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:35:21,480 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 166 flow [2024-11-16 19:35:21,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-16 19:35:21,482 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-11-16 19:35:21,483 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 166 flow [2024-11-16 19:35:21,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-11-16 19:35:21,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:21,484 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 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-11-16 19:35:21,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 19:35:21,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 19:35:21,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:21,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash 865001170, now seen corresponding path program 4 times [2024-11-16 19:35:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894502644] [2024-11-16 19:35:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-16 19:35:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:35:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894502644] [2024-11-16 19:35:22,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894502644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:35:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487080375] [2024-11-16 19:35:22,021 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-16 19:35:22,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:35:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:35:22,023 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-11-16 19:35:22,035 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-11-16 19:35:22,589 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-16 19:35:22,590 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:35:22,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 19:35:22,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:35:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-16 19:35:22,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 19:35:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487080375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:35:22,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 19:35:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-16 19:35:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558769875] [2024-11-16 19:35:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:35:22,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:35:22,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:35:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:35:22,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:35:22,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-11-16 19:35:22,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-11-16 19:35:22,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:35:22,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-11-16 19:35:22,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:35:23,026 INFO L124 PetriNetUnfolderBase]: 1200/2854 cut-off events. [2024-11-16 19:35:23,028 INFO L125 PetriNetUnfolderBase]: For 1789/1803 co-relation queries the response was YES. [2024-11-16 19:35:23,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 2854 events. 1200/2854 cut-off events. For 1789/1803 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17115 event pairs, 373 based on Foata normal form. 0/2693 useless extension candidates. Maximal degree in co-relation 6549. Up to 1161 conditions per place. [2024-11-16 19:35:23,049 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 49 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2024-11-16 19:35:23,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 363 flow [2024-11-16 19:35:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:35:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:35:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-11-16 19:35:23,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.56 [2024-11-16 19:35:23,051 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 166 flow. Second operand 4 states and 112 transitions. [2024-11-16 19:35:23,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 363 flow [2024-11-16 19:35:23,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 351 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-16 19:35:23,057 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 191 flow [2024-11-16 19:35:23,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2024-11-16 19:35:23,057 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2024-11-16 19:35:23,058 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 191 flow [2024-11-16 19:35:23,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-11-16 19:35:23,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:23,058 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 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-11-16 19:35:23,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 19:35:23,259 WARN L453 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-11-16 19:35:23,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:23,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1572190222, now seen corresponding path program 5 times [2024-11-16 19:35:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:23,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842785369] [2024-11-16 19:35:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:35:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 19:35:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:35:23,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842785369] [2024-11-16 19:35:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842785369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:35:23,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093836808] [2024-11-16 19:35:23,686 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-16 19:35:23,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:35:23,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:35:23,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:35:23,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 19:35:24,231 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-16 19:35:24,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:35:24,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 19:35:24,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:35:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 19:35:24,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:35:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 19:35:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093836808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:35:24,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:35:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-11-16 19:35:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708410714] [2024-11-16 19:35:24,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:35:24,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:35:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:35:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:35:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:35:24,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2024-11-16 19:35:24,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-11-16 19:35:24,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:35:24,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2024-11-16 19:35:24,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:35:24,592 INFO L124 PetriNetUnfolderBase]: 493/1275 cut-off events. [2024-11-16 19:35:24,592 INFO L125 PetriNetUnfolderBase]: For 1008/1016 co-relation queries the response was YES. [2024-11-16 19:35:24,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3092 conditions, 1275 events. 493/1275 cut-off events. For 1008/1016 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5929 event pairs, 156 based on Foata normal form. 48/1299 useless extension candidates. Maximal degree in co-relation 3077. Up to 475 conditions per place. [2024-11-16 19:35:24,602 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 48 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2024-11-16 19:35:24,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 354 flow [2024-11-16 19:35:24,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:35:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:35:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-11-16 19:35:24,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.545 [2024-11-16 19:35:24,604 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 191 flow. Second operand 4 states and 109 transitions. [2024-11-16 19:35:24,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 354 flow [2024-11-16 19:35:24,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 348 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 19:35:24,609 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 179 flow [2024-11-16 19:35:24,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2024-11-16 19:35:24,612 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2024-11-16 19:35:24,613 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 179 flow [2024-11-16 19:35:24,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-11-16 19:35:24,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:35:24,613 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 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-11-16 19:35:24,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 19:35:24,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:35:24,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:35:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:35:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1909288002, now seen corresponding path program 6 times [2024-11-16 19:35:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:35:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103010833] [2024-11-16 19:35:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:35:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:35:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:35:25,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:35:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:35:25,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:35:25,122 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:35:25,123 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-16 19:35:25,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-16 19:35:25,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-16 19:35:25,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:35:25,126 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2024-11-16 19:35:25,226 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:35:25,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:35:25,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:35:25 BasicIcfg [2024-11-16 19:35:25,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:35:25,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:35:25,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:35:25,232 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:35:25,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:35:15" (3/4) ... [2024-11-16 19:35:25,237 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:35:25,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:35:25,320 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:35:25,320 INFO L158 Benchmark]: Toolchain (without parser) took 12638.78ms. Allocated memory was 151.0MB in the beginning and 610.3MB in the end (delta: 459.3MB). Free memory was 92.6MB in the beginning and 328.2MB in the end (delta: -235.6MB). Peak memory consumption was 225.6MB. Max. memory is 16.1GB. [2024-11-16 19:35:25,320 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:35:25,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.41ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 92.6MB in the beginning and 167.8MB in the end (delta: -75.2MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-16 19:35:25,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.09ms. Allocated memory is still 207.6MB. Free memory was 167.8MB in the beginning and 164.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:35:25,321 INFO L158 Benchmark]: Boogie Preprocessor took 83.24ms. Allocated memory is still 207.6MB. Free memory was 164.6MB in the beginning and 161.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:35:25,322 INFO L158 Benchmark]: IcfgBuilder took 1552.13ms. Allocated memory is still 207.6MB. Free memory was 161.4MB in the beginning and 98.1MB in the end (delta: 63.3MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2024-11-16 19:35:25,322 INFO L158 Benchmark]: TraceAbstraction took 10130.12ms. Allocated memory was 207.6MB in the beginning and 610.3MB in the end (delta: 402.7MB). Free memory was 98.1MB in the beginning and 342.9MB in the end (delta: -244.7MB). Peak memory consumption was 157.9MB. Max. memory is 16.1GB. [2024-11-16 19:35:25,322 INFO L158 Benchmark]: Witness Printer took 87.74ms. Allocated memory is still 610.3MB. Free memory was 342.9MB in the beginning and 328.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 19:35:25,324 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.20ms. Allocated memory is still 151.0MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.41ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 92.6MB in the beginning and 167.8MB in the end (delta: -75.2MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.09ms. Allocated memory is still 207.6MB. Free memory was 167.8MB in the beginning and 164.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.24ms. Allocated memory is still 207.6MB. Free memory was 164.6MB in the beginning and 161.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1552.13ms. Allocated memory is still 207.6MB. Free memory was 161.4MB in the beginning and 98.1MB in the end (delta: 63.3MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10130.12ms. Allocated memory was 207.6MB in the beginning and 610.3MB in the end (delta: 402.7MB). Free memory was 98.1MB in the beginning and 342.9MB in the end (delta: -244.7MB). Peak memory consumption was 157.9MB. Max. memory is 16.1GB. * Witness Printer took 87.74ms. Allocated memory is still 610.3MB. Free memory was 342.9MB in the beginning and 328.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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; [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 [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-1, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-1, t2=0, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, t1=-1, t2=0, total=1] [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] [L919] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-1, t2=0, total=6] - 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 71 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: 9.9s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 11 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 399 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=7, InterpolantAutomatonStates: 29, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 655 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 1360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1845 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 424/484 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-11-16 19:35:25,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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