./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.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-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:18:57,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:18:58,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:18:58,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:18:58,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:18:58,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:18:58,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:18:58,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:18:58,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:18:58,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:18:58,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:18:58,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:18:58,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:18:58,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:18:58,054 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:18:58,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:18:58,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:18:58,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:18:58,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:18:58,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:18:58,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:18:58,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:18:58,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:18:58,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:18:58,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:18:58,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:18:58,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:18:58,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:18:58,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:18:58,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:18:58,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:18:58,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:18:58,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:18:58,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:18:58,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:18:58,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:18:58,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:18:58,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:18:58,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:18:58,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:18:58,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:18:58,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:18:58,071 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2024-11-16 19:18:58,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:18:58,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:18:58,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:18:58,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:18:58,336 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:18:58,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-16 19:18:59,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:19:00,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:19:00,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-16 19:19:00,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4a420b0/0f7fb278968b4200acbac4b1468d9706/FLAG83e187d54 [2024-11-16 19:19:00,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4a420b0/0f7fb278968b4200acbac4b1468d9706 [2024-11-16 19:19:00,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:19:00,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:19:00,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:19:00,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:19:00,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:19:00,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:00,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d26ed54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00, skipping insertion in model container [2024-11-16 19:19:00,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:00,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:19:00,433 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-11-16 19:19:00,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:19:00,778 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:19:00,789 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-11-16 19:19:00,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:19:00,911 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:19:00,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00 WrapperNode [2024-11-16 19:19:00,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:19:00,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:19:00,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:19:00,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:19:00,920 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:19:00" (1/1) ... [2024-11-16 19:19:00,941 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:19:00" (1/1) ... [2024-11-16 19:19:00,964 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2024-11-16 19:19:00,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:19:00,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:19:00,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:19:00,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:19:00,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:00,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:00,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:00,992 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:19:00,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:00,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:00,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:00,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:01,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:01,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:01,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:19:01,005 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:19:01,005 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:19:01,005 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:19:01,006 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (1/1) ... [2024-11-16 19:19:01,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:19:01,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:19:01,049 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:19:01,053 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:19:01,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:19:01,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:19:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-11-16 19:19:01,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-11-16 19:19:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:19:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:19:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:19:01,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:19:01,103 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:19:01,258 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:19:01,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:19:01,434 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:19:01,434 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:19:01,690 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:19:01,690 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:19:01,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:19:01 BoogieIcfgContainer [2024-11-16 19:19:01,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:19:01,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:19:01,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:19:01,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:19:01,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:19:00" (1/3) ... [2024-11-16 19:19:01,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533ad44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:19:01, skipping insertion in model container [2024-11-16 19:19:01,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:19:00" (2/3) ... [2024-11-16 19:19:01,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533ad44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:19:01, skipping insertion in model container [2024-11-16 19:19:01,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:19:01" (3/3) ... [2024-11-16 19:19:01,700 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-11-16 19:19:01,715 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:19:01,716 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:19:01,716 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:19:01,760 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 19:19:01,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 27 transitions, 61 flow [2024-11-16 19:19:01,833 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2024-11-16 19:19:01,833 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 19:19:01,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 5/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2024-11-16 19:19:01,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 27 transitions, 61 flow [2024-11-16 19:19:01,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 23 transitions, 52 flow [2024-11-16 19:19:01,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:19:01,858 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;@366e883c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:19:01,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 19:19:01,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:19:01,874 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-16 19:19:01,874 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 19:19:01,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:01,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:01,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:01,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1384594394, now seen corresponding path program 1 times [2024-11-16 19:19:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:01,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654621560] [2024-11-16 19:19:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:02,180 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:19:02,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:02,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654621560] [2024-11-16 19:19:02,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654621560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:19:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:19:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:19:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454613883] [2024-11-16 19:19:02,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:19:02,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:19:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:02,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:19:02,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:19:02,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-16 19:19:02,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 23 transitions, 52 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:19:02,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:02,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-16 19:19:02,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:02,283 INFO L124 PetriNetUnfolderBase]: 19/54 cut-off events. [2024-11-16 19:19:02,285 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 19:19:02,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 54 events. 19/54 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 10 based on Foata normal form. 9/58 useless extension candidates. Maximal degree in co-relation 84. Up to 42 conditions per place. [2024-11-16 19:19:02,289 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 14 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2024-11-16 19:19:02,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 76 flow [2024-11-16 19:19:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:19:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 19:19:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2024-11-16 19:19:02,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-11-16 19:19:02,303 INFO L175 Difference]: Start difference. First operand has 23 places, 23 transitions, 52 flow. Second operand 2 states and 34 transitions. [2024-11-16 19:19:02,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 76 flow [2024-11-16 19:19:02,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 21 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:19:02,309 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 44 flow [2024-11-16 19:19:02,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2024-11-16 19:19:02,313 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2024-11-16 19:19:02,314 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 44 flow [2024-11-16 19:19:02,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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:19:02,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:02,315 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:19:02,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash 319183783, now seen corresponding path program 1 times [2024-11-16 19:19:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205387812] [2024-11-16 19:19:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:02,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:02,469 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:19:02,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205387812] [2024-11-16 19:19:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205387812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:19:02,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:19:02,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:19:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380414943] [2024-11-16 19:19:02,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:19:02,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:19:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:02,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:19:02,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:19:02,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-16 19:19:02,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:19:02,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:02,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-16 19:19:02,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:02,546 INFO L124 PetriNetUnfolderBase]: 34/85 cut-off events. [2024-11-16 19:19:02,546 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:19:02,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 85 events. 34/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 202 event pairs, 9 based on Foata normal form. 3/87 useless extension candidates. Maximal degree in co-relation 157. Up to 48 conditions per place. [2024-11-16 19:19:02,548 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 20 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-11-16 19:19:02,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 102 flow [2024-11-16 19:19:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:19:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:19:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2024-11-16 19:19:02,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2024-11-16 19:19:02,550 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 44 flow. Second operand 3 states and 47 transitions. [2024-11-16 19:19:02,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 28 transitions, 102 flow [2024-11-16 19:19:02,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:19:02,552 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 56 flow [2024-11-16 19:19:02,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2024-11-16 19:19:02,554 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-11-16 19:19:02,554 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 56 flow [2024-11-16 19:19:02,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:19:02,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:02,555 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:02,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:19:02,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:02,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1929241150, now seen corresponding path program 1 times [2024-11-16 19:19:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:02,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15473178] [2024-11-16 19:19:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:19:02,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:02,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15473178] [2024-11-16 19:19:02,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15473178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:19:02,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878804876] [2024-11-16 19:19:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:02,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:02,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:19:02,711 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:19:02,713 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:19:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:02,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 19:19:02,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:19:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:19:02,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 19:19:02,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878804876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:19:02,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 19:19:02,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-16 19:19:02,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161310061] [2024-11-16 19:19:02,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:19:02,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:19:02,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:19:02,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:19:02,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-16 19:19:02,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:19:02,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:02,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-16 19:19:02,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:02,992 INFO L124 PetriNetUnfolderBase]: 61/166 cut-off events. [2024-11-16 19:19:02,993 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-16 19:19:02,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 166 events. 61/166 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 645 event pairs, 27 based on Foata normal form. 10/175 useless extension candidates. Maximal degree in co-relation 320. Up to 86 conditions per place. [2024-11-16 19:19:02,997 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 23 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-11-16 19:19:02,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 132 flow [2024-11-16 19:19:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:19:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:19:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-16 19:19:02,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-16 19:19:03,000 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 56 flow. Second operand 3 states and 48 transitions. [2024-11-16 19:19:03,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 132 flow [2024-11-16 19:19:03,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:19:03,001 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 66 flow [2024-11-16 19:19:03,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2024-11-16 19:19:03,002 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 4 predicate places. [2024-11-16 19:19:03,002 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 66 flow [2024-11-16 19:19:03,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:19:03,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:03,003 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] [2024-11-16 19:19:03,042 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:19:03,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:03,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:03,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash -980271659, now seen corresponding path program 1 times [2024-11-16 19:19:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:03,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336049011] [2024-11-16 19:19:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:03,306 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:19:03,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336049011] [2024-11-16 19:19:03,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336049011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:19:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800823938] [2024-11-16 19:19:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:03,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:03,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:19:03,310 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:19:03,312 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:19:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:03,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 19:19:03,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:19:03,471 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:19:03,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:19:03,503 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:19:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800823938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:19:03,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:19:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-16 19:19:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781709353] [2024-11-16 19:19:03,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:19:03,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:19:03,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:03,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:19:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:19:03,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-16 19:19:03,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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:19:03,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:03,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-16 19:19:03,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:03,669 INFO L124 PetriNetUnfolderBase]: 151/365 cut-off events. [2024-11-16 19:19:03,670 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-16 19:19:03,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 365 events. 151/365 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1502 event pairs, 24 based on Foata normal form. 30/393 useless extension candidates. Maximal degree in co-relation 792. Up to 70 conditions per place. [2024-11-16 19:19:03,673 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 49 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-11-16 19:19:03,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 278 flow [2024-11-16 19:19:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:19:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:19:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-11-16 19:19:03,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5864197530864198 [2024-11-16 19:19:03,677 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 66 flow. Second operand 6 states and 95 transitions. [2024-11-16 19:19:03,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 278 flow [2024-11-16 19:19:03,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:19:03,680 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 104 flow [2024-11-16 19:19:03,680 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2024-11-16 19:19:03,682 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2024-11-16 19:19:03,683 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 104 flow [2024-11-16 19:19:03,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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:19:03,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:03,683 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:03,701 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:19:03,883 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,SelfDestructingSolverStorable3 [2024-11-16 19:19:03,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:03,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -701955672, now seen corresponding path program 2 times [2024-11-16 19:19:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:03,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854285879] [2024-11-16 19:19:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-16 19:19:03,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:03,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854285879] [2024-11-16 19:19:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854285879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:19:03,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139162296] [2024-11-16 19:19:03,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:19:03,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:03,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:19:03,971 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:19:03,972 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:19:04,083 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 19:19:04,083 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:19:04,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 19:19:04,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:19:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-16 19:19:04,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:19:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-16 19:19:04,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139162296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:19:04,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:19:04,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-16 19:19:04,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084404053] [2024-11-16 19:19:04,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:19:04,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:19:04,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:04,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:19:04,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:19:04,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-16 19:19:04,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 104 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:19:04,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:04,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-16 19:19:04,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:04,362 INFO L124 PetriNetUnfolderBase]: 225/572 cut-off events. [2024-11-16 19:19:04,362 INFO L125 PetriNetUnfolderBase]: For 697/698 co-relation queries the response was YES. [2024-11-16 19:19:04,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511 conditions, 572 events. 225/572 cut-off events. For 697/698 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2593 event pairs, 43 based on Foata normal form. 30/598 useless extension candidates. Maximal degree in co-relation 1502. Up to 120 conditions per place. [2024-11-16 19:19:04,370 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 53 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2024-11-16 19:19:04,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 416 flow [2024-11-16 19:19:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:19:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:19:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-11-16 19:19:04,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5493827160493827 [2024-11-16 19:19:04,373 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 104 flow. Second operand 6 states and 89 transitions. [2024-11-16 19:19:04,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 416 flow [2024-11-16 19:19:04,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 65 transitions, 376 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-11-16 19:19:04,380 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 136 flow [2024-11-16 19:19:04,381 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2024-11-16 19:19:04,382 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 20 predicate places. [2024-11-16 19:19:04,383 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 136 flow [2024-11-16 19:19:04,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:19:04,383 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:04,383 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:04,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 19:19:04,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:04,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:04,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2090780435, now seen corresponding path program 3 times [2024-11-16 19:19:04,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:04,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585260346] [2024-11-16 19:19:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-16 19:19:04,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585260346] [2024-11-16 19:19:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585260346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:19:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865374985] [2024-11-16 19:19:04,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 19:19:04,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:04,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:19:04,762 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:19:04,764 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:19:04,908 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-16 19:19:04,908 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:19:04,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 19:19:04,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:19:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-16 19:19:04,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:19:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-16 19:19:05,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865374985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:19:05,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:19:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-16 19:19:05,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080483928] [2024-11-16 19:19:05,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:19:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 19:19:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 19:19:05,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-16 19:19:05,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-16 19:19:05,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 136 flow. Second operand has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 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:19:05,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:05,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-16 19:19:05,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:05,403 INFO L124 PetriNetUnfolderBase]: 601/1465 cut-off events. [2024-11-16 19:19:05,403 INFO L125 PetriNetUnfolderBase]: For 2943/2943 co-relation queries the response was YES. [2024-11-16 19:19:05,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4060 conditions, 1465 events. 601/1465 cut-off events. For 2943/2943 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7673 event pairs, 49 based on Foata normal form. 114/1577 useless extension candidates. Maximal degree in co-relation 4047. Up to 228 conditions per place. [2024-11-16 19:19:05,415 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 125 selfloop transitions, 12 changer transitions 0/143 dead transitions. [2024-11-16 19:19:05,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 143 transitions, 972 flow [2024-11-16 19:19:05,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 19:19:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 19:19:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2024-11-16 19:19:05,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654 [2024-11-16 19:19:05,417 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 136 flow. Second operand 12 states and 194 transitions. [2024-11-16 19:19:05,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 143 transitions, 972 flow [2024-11-16 19:19:05,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 143 transitions, 884 flow, removed 33 selfloop flow, removed 1 redundant places. [2024-11-16 19:19:05,425 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 224 flow [2024-11-16 19:19:05,425 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=224, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2024-11-16 19:19:05,428 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 37 predicate places. [2024-11-16 19:19:05,428 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 224 flow [2024-11-16 19:19:05,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 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:19:05,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:05,429 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 10, 10, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:05,447 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:19:05,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:05,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -428479859, now seen corresponding path program 4 times [2024-11-16 19:19:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472579105] [2024-11-16 19:19:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:05,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-16 19:19:05,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472579105] [2024-11-16 19:19:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472579105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:19:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706425105] [2024-11-16 19:19:05,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-16 19:19:05,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:05,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:19:05,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:19:05,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 19:19:05,975 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-16 19:19:05,976 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:19:05,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 19:19:05,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:19:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 17 proven. 200 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-16 19:19:06,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:19:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 17 proven. 200 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-16 19:19:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706425105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:19:06,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:19:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 27 [2024-11-16 19:19:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651735264] [2024-11-16 19:19:06,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:19:06,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-16 19:19:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:06,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-16 19:19:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2024-11-16 19:19:06,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2024-11-16 19:19:06,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 36 transitions, 224 flow. Second operand has 27 states, 27 states have (on average 9.88888888888889) internal successors, (267), 27 states have internal predecessors, (267), 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:19:06,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:06,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2024-11-16 19:19:06,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:10,068 INFO L124 PetriNetUnfolderBase]: 1702/4141 cut-off events. [2024-11-16 19:19:10,069 INFO L125 PetriNetUnfolderBase]: For 26906/26906 co-relation queries the response was YES. [2024-11-16 19:19:10,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13239 conditions, 4141 events. 1702/4141 cut-off events. For 26906/26906 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 24672 event pairs, 15 based on Foata normal form. 333/4472 useless extension candidates. Maximal degree in co-relation 13219. Up to 594 conditions per place. [2024-11-16 19:19:10,103 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 692 selfloop transitions, 258 changer transitions 0/955 dead transitions. [2024-11-16 19:19:10,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 955 transitions, 6446 flow [2024-11-16 19:19:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-11-16 19:19:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2024-11-16 19:19:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 1793 transitions. [2024-11-16 19:19:10,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5228929717118693 [2024-11-16 19:19:10,112 INFO L175 Difference]: Start difference. First operand has 60 places, 36 transitions, 224 flow. Second operand 127 states and 1793 transitions. [2024-11-16 19:19:10,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 955 transitions, 6446 flow [2024-11-16 19:19:10,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 955 transitions, 6410 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 19:19:10,145 INFO L231 Difference]: Finished difference. Result has 259 places, 299 transitions, 3258 flow [2024-11-16 19:19:10,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=3258, PETRI_PLACES=259, PETRI_TRANSITIONS=299} [2024-11-16 19:19:10,146 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 236 predicate places. [2024-11-16 19:19:10,147 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 299 transitions, 3258 flow [2024-11-16 19:19:10,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.88888888888889) internal successors, (267), 27 states have internal predecessors, (267), 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:19:10,147 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:10,147 INFO L204 CegarLoopForPetriNet]: trace histogram [21, 20, 20, 20, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:10,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-16 19:19:10,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:10,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:10,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash -65183966, now seen corresponding path program 5 times [2024-11-16 19:19:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301732827] [2024-11-16 19:19:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 40 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 19:19:10,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301732827] [2024-11-16 19:19:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301732827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:19:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291219130] [2024-11-16 19:19:10,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-16 19:19:10,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:10,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:19:10,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:19:10,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 19:19:10,688 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-11-16 19:19:10,688 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:19:10,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 19:19:10,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:19:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 40 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 19:19:10,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:19:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 40 proven. 70 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 19:19:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291219130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:19:10,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:19:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-16 19:19:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574123311] [2024-11-16 19:19:10,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:19:10,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 19:19:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 19:19:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-11-16 19:19:10,848 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-16 19:19:10,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 299 transitions, 3258 flow. Second operand has 15 states, 15 states have (on average 11.6) internal successors, (174), 15 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:19:10,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:10,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-16 19:19:10,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:12,781 INFO L124 PetriNetUnfolderBase]: 2707/6200 cut-off events. [2024-11-16 19:19:12,781 INFO L125 PetriNetUnfolderBase]: For 174045/174231 co-relation queries the response was YES. [2024-11-16 19:19:12,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24152 conditions, 6200 events. 2707/6200 cut-off events. For 174045/174231 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 41573 event pairs, 254 based on Foata normal form. 317/6484 useless extension candidates. Maximal degree in co-relation 24056. Up to 1344 conditions per place. [2024-11-16 19:19:12,852 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 341 selfloop transitions, 274 changer transitions 0/628 dead transitions. [2024-11-16 19:19:12,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 628 transitions, 7466 flow [2024-11-16 19:19:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 19:19:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-16 19:19:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 213 transitions. [2024-11-16 19:19:12,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2024-11-16 19:19:12,854 INFO L175 Difference]: Start difference. First operand has 259 places, 299 transitions, 3258 flow. Second operand 14 states and 213 transitions. [2024-11-16 19:19:12,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 628 transitions, 7466 flow [2024-11-16 19:19:13,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 628 transitions, 7106 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-16 19:19:13,100 INFO L231 Difference]: Finished difference. Result has 268 places, 426 transitions, 4940 flow [2024-11-16 19:19:13,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3024, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4940, PETRI_PLACES=268, PETRI_TRANSITIONS=426} [2024-11-16 19:19:13,101 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 245 predicate places. [2024-11-16 19:19:13,101 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 426 transitions, 4940 flow [2024-11-16 19:19:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.6) internal successors, (174), 15 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:19:13,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:13,101 INFO L204 CegarLoopForPetriNet]: trace histogram [21, 20, 20, 20, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:13,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 19:19:13,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:13,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:13,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1107773739, now seen corresponding path program 6 times [2024-11-16 19:19:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:13,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356715351] [2024-11-16 19:19:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:19:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-16 19:19:13,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:19:13,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356715351] [2024-11-16 19:19:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356715351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:19:13,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052916820] [2024-11-16 19:19:13,738 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-16 19:19:13,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:13,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:19:13,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:19:13,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 19:19:13,927 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-11-16 19:19:13,928 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:19:13,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 19:19:13,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:19:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-16 19:19:14,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:19:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-16 19:19:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052916820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:19:14,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:19:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2024-11-16 19:19:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554877470] [2024-11-16 19:19:14,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:19:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 19:19:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:19:14,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 19:19:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-16 19:19:14,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-16 19:19:14,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 426 transitions, 4940 flow. Second operand has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 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:19:14,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:19:14,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-16 19:19:14,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:19:16,858 INFO L124 PetriNetUnfolderBase]: 4393/9899 cut-off events. [2024-11-16 19:19:16,858 INFO L125 PetriNetUnfolderBase]: For 299501/299731 co-relation queries the response was YES. [2024-11-16 19:19:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39162 conditions, 9899 events. 4393/9899 cut-off events. For 299501/299731 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 68291 event pairs, 250 based on Foata normal form. 339/10214 useless extension candidates. Maximal degree in co-relation 39058. Up to 2184 conditions per place. [2024-11-16 19:19:17,091 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 549 selfloop transitions, 442 changer transitions 0/1004 dead transitions. [2024-11-16 19:19:17,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1004 transitions, 12870 flow [2024-11-16 19:19:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 19:19:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-16 19:19:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 334 transitions. [2024-11-16 19:19:17,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5622895622895623 [2024-11-16 19:19:17,093 INFO L175 Difference]: Start difference. First operand has 268 places, 426 transitions, 4940 flow. Second operand 22 states and 334 transitions. [2024-11-16 19:19:17,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1004 transitions, 12870 flow [2024-11-16 19:19:17,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 1004 transitions, 12660 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 19:19:17,533 INFO L231 Difference]: Finished difference. Result has 293 places, 595 transitions, 8038 flow [2024-11-16 19:19:17,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=4730, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8038, PETRI_PLACES=293, PETRI_TRANSITIONS=595} [2024-11-16 19:19:17,534 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 270 predicate places. [2024-11-16 19:19:17,534 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 595 transitions, 8038 flow [2024-11-16 19:19:17,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 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:19:17,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:19:17,535 INFO L204 CegarLoopForPetriNet]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:19:17,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-16 19:19:17,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:19:17,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-16 19:19:17,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:19:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash -431997741, now seen corresponding path program 7 times [2024-11-16 19:19:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:19:17,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467221132] [2024-11-16 19:19:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:19:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:19:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:19:17,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:19:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:19:17,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:19:17,979 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:19:17,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 19:19:17,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-16 19:19:17,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:19:17,983 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-11-16 19:19:18,149 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:19:18,149 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:19:18,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:19:18 BasicIcfg [2024-11-16 19:19:18,155 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:19:18,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:19:18,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:19:18,156 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:19:18,157 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:19:01" (3/4) ... [2024-11-16 19:19:18,157 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:19:18,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:19:18,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:19:18,281 INFO L158 Benchmark]: Toolchain (without parser) took 18131.91ms. Allocated memory was 184.5MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 125.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 479.9MB. Max. memory is 16.1GB. [2024-11-16 19:19:18,281 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory was 149.2MB in the beginning and 148.9MB in the end (delta: 276.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:19:18,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 762.16ms. Allocated memory is still 184.5MB. Free memory was 125.5MB in the beginning and 83.9MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-16 19:19:18,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.33ms. Allocated memory is still 184.5MB. Free memory was 83.9MB in the beginning and 81.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:19:18,282 INFO L158 Benchmark]: Boogie Preprocessor took 38.12ms. Allocated memory is still 184.5MB. Free memory was 81.0MB in the beginning and 78.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:19:18,282 INFO L158 Benchmark]: IcfgBuilder took 686.48ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 78.5MB in the beginning and 216.3MB in the end (delta: -137.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-11-16 19:19:18,282 INFO L158 Benchmark]: TraceAbstraction took 16462.41ms. Allocated memory was 266.3MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 215.3MB in the beginning and 1.2GB in the end (delta: -940.3MB). Peak memory consumption was 462.7MB. Max. memory is 16.1GB. [2024-11-16 19:19:18,282 INFO L158 Benchmark]: Witness Printer took 124.35ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 19:19:18,287 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.18ms. Allocated memory is still 184.5MB. Free memory was 149.2MB in the beginning and 148.9MB in the end (delta: 276.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 762.16ms. Allocated memory is still 184.5MB. Free memory was 125.5MB in the beginning and 83.9MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.33ms. Allocated memory is still 184.5MB. Free memory was 83.9MB in the beginning and 81.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.12ms. Allocated memory is still 184.5MB. Free memory was 81.0MB in the beginning and 78.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 686.48ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 78.5MB in the beginning and 216.3MB in the end (delta: -137.8MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16462.41ms. Allocated memory was 266.3MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 215.3MB in the beginning and 1.2GB in the end (delta: -940.3MB). Peak memory consumption was 462.7MB. Max. memory is 16.1GB. * Witness Printer took 124.35ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=0, myglobal=1, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=2, myglobal=3, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=4, myglobal=5, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=6, myglobal=7, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=8, myglobal=9, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=10, myglobal=11, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=12, myglobal=13, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=14, myglobal=15, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=16, myglobal=17, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=18, myglobal=19, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=20, myglobal=20, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1325] COND FALSE 1 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] [L13] 0 reach_error() VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] - UnprovableResult [Line: 1342]: 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 3 procedures, 33 locations, 2 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: 16.2s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1710 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1695 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1131 IncrementalHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 7 mSDtfsCounter, 1131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1132 GetRequests, 940 SyntacticMatches, 8 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5347 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8038occurred in iteration=9, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1227 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1468 ConstructedInterpolants, 0 QuantifiedInterpolants, 3024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1453 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 22 InterpolantComputations, 3 PerfectInterpolantSequences, 5244/7348 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:19:18,324 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