./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 023d838f 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-023d838-m [2024-11-10 10:21:58,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:21:58,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:21:58,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:21:58,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:21:58,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:21:58,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:21:58,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:21:58,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:21:58,189 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:21:58,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:21:58,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:21:58,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:21:58,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:21:58,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:21:58,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:21:58,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:21:58,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:21:58,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:21:58,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:21:58,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:21:58,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:21:58,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:21:58,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:21:58,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:21:58,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:21:58,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:21:58,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:21:58,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:21:58,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:21:58,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:21:58,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:21:58,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:21:58,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:21:58,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:21:58,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:21:58,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:21:58,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:21:58,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:21:58,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:21:58,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:21:58,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:21:58,205 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-10 10:21:58,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:21:58,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:21:58,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:21:58,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:21:58,495 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:21:58,496 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-10 10:21:59,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:22:00,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:22:00,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-10 10:22:00,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3ca9fde/8d4769e7f98b436eb2ac2812b111cb4f/FLAG2177f1151 [2024-11-10 10:22:00,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3ca9fde/8d4769e7f98b436eb2ac2812b111cb4f [2024-11-10 10:22:00,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:22:00,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:22:00,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:22:00,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:22:00,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:22:00,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:00,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349fd1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00, skipping insertion in model container [2024-11-10 10:22:00,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:00,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:22:00,467 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-10 10:22:00,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:22:00,749 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:22:00,763 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-10 10:22:00,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:22:00,899 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:22:00,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00 WrapperNode [2024-11-10 10:22:00,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:22:00,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:22:00,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:22:00,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:22:00,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:00,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:00,977 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2024-11-10 10:22:00,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:22:00,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:22:00,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:22:00,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:22:01,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,050 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-10 10:22:01,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:22:01,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:22:01,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:22:01,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:22:01,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (1/1) ... [2024-11-10 10:22:01,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:22:01,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:01,157 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-10 10:22:01,161 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-10 10:22:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:22:01,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:22:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-11-10 10:22:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-11-10 10:22:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:22:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:22:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:22:01,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:22:01,214 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:22:01,352 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:22:01,354 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:22:01,521 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:22:01,522 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:22:01,749 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:22:01,751 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:22:01,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:22:01 BoogieIcfgContainer [2024-11-10 10:22:01,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:22:01,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:22:01,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:22:01,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:22:01,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:22:00" (1/3) ... [2024-11-10 10:22:01,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355b7e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:22:01, skipping insertion in model container [2024-11-10 10:22:01,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:00" (2/3) ... [2024-11-10 10:22:01,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355b7e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:22:01, skipping insertion in model container [2024-11-10 10:22:01,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:22:01" (3/3) ... [2024-11-10 10:22:01,762 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-11-10 10:22:01,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:22:01,779 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:22:01,779 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:22:01,826 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 10:22:01,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 27 transitions, 61 flow [2024-11-10 10:22:01,892 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2024-11-10 10:22:01,892 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:22:01,896 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-10 10:22:01,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 27 transitions, 61 flow [2024-11-10 10:22:01,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 23 transitions, 52 flow [2024-11-10 10:22:01,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:22:01,919 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;@7a1ff42f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:22:01,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 10:22:01,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:22:01,932 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-10 10:22:01,932 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:22:01,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:01,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:01,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:01,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1384594394, now seen corresponding path program 1 times [2024-11-10 10:22:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:01,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299633308] [2024-11-10 10:22:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:02,184 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-10 10:22:02,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:02,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299633308] [2024-11-10 10:22:02,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299633308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:22:02,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041400293] [2024-11-10 10:22:02,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:02,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:22:02,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:22:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:22:02,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-10 10:22:02,232 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-10 10:22:02,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:02,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-10 10:22:02,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:02,286 INFO L124 PetriNetUnfolderBase]: 19/54 cut-off events. [2024-11-10 10:22:02,286 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:22: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-10 10:22:02,289 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 14 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2024-11-10 10:22:02,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 76 flow [2024-11-10 10:22:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:22:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:22:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2024-11-10 10:22:02,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-11-10 10:22: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-10 10:22:02,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 76 flow [2024-11-10 10:22: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-10 10:22:02,309 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 44 flow [2024-11-10 10:22:02,311 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-10 10:22:02,317 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2024-11-10 10:22:02,318 INFO L471 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 44 flow [2024-11-10 10:22:02,318 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-10 10:22:02,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:02,320 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:02,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:22:02,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:02,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 319183783, now seen corresponding path program 1 times [2024-11-10 10:22:02,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:02,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640332162] [2024-11-10 10:22:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:02,518 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-10 10:22:02,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:02,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640332162] [2024-11-10 10:22:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640332162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:02,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:02,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:22:02,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111991094] [2024-11-10 10:22:02,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:02,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:22:02,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:02,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:22:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:22:02,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-10 10:22:02,526 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-10 10:22:02,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:02,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-10 10:22:02,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:02,608 INFO L124 PetriNetUnfolderBase]: 34/85 cut-off events. [2024-11-10 10:22:02,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:22:02,609 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-10 10:22:02,610 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 20 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-11-10 10:22:02,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 102 flow [2024-11-10 10:22:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:22:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:22:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2024-11-10 10:22:02,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2024-11-10 10:22:02,611 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 44 flow. Second operand 3 states and 47 transitions. [2024-11-10 10:22:02,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 28 transitions, 102 flow [2024-11-10 10:22:02,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:22:02,614 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 56 flow [2024-11-10 10:22:02,614 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-10 10:22:02,615 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-11-10 10:22:02,615 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 56 flow [2024-11-10 10:22:02,615 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-10 10:22:02,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:02,615 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-10 10:22:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:22:02,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1929241150, now seen corresponding path program 1 times [2024-11-10 10:22:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967740120] [2024-11-10 10:22:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:02,771 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-10 10:22:02,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:02,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967740120] [2024-11-10 10:22:02,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967740120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:22:02,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140540883] [2024-11-10 10:22:02,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:02,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:22:02,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:02,776 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-10 10:22:02,777 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-10 10:22:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:02,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 10:22:02,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:22:02,951 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-10 10:22:02,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 10:22:02,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140540883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:02,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 10:22:02,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-10 10:22:02,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707738406] [2024-11-10 10:22:02,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:02,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:22:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:02,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:22:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:22:02,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-10 10:22:02,958 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-10 10:22:02,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:02,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-10 10:22:02,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:03,030 INFO L124 PetriNetUnfolderBase]: 61/166 cut-off events. [2024-11-10 10:22:03,031 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-10 10:22:03,031 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-10 10:22:03,035 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 23 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-11-10 10:22:03,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 132 flow [2024-11-10 10:22:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:22:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:22:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-10 10:22:03,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-10 10:22:03,038 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 56 flow. Second operand 3 states and 48 transitions. [2024-11-10 10:22:03,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 132 flow [2024-11-10 10:22:03,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:22:03,039 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 66 flow [2024-11-10 10:22:03,040 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-10 10:22:03,041 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 4 predicate places. [2024-11-10 10:22:03,041 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 66 flow [2024-11-10 10:22:03,042 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-10 10:22:03,043 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:03,043 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-10 10:22:03,062 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-10 10:22:03,243 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-10 10:22:03,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:03,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:03,245 INFO L85 PathProgramCache]: Analyzing trace with hash -980271659, now seen corresponding path program 1 times [2024-11-10 10:22:03,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:03,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48161481] [2024-11-10 10:22:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:03,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:03,355 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-10 10:22:03,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:03,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48161481] [2024-11-10 10:22:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48161481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:22:03,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264265173] [2024-11-10 10:22:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:03,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:22:03,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:03,359 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-10 10:22:03,361 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-10 10:22:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:03,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:22:03,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:22:03,566 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-10 10:22:03,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:22:03,596 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-10 10:22:03,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264265173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:22:03,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:22:03,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 10:22:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087697299] [2024-11-10 10:22:03,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:22:03,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:22:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:22:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:22:03,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-10 10:22:03,610 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-10 10:22:03,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:03,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-10 10:22:03,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:03,769 INFO L124 PetriNetUnfolderBase]: 151/365 cut-off events. [2024-11-10 10:22:03,769 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-10 10:22:03,772 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-10 10:22:03,774 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 49 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-11-10 10:22:03,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 278 flow [2024-11-10 10:22:03,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:22:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:22:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-11-10 10:22:03,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5864197530864198 [2024-11-10 10:22:03,779 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 66 flow. Second operand 6 states and 95 transitions. [2024-11-10 10:22:03,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 278 flow [2024-11-10 10:22:03,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:22:03,783 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 104 flow [2024-11-10 10:22:03,784 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-10 10:22:03,785 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2024-11-10 10:22:03,785 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 104 flow [2024-11-10 10:22:03,785 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-10 10:22:03,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:03,786 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-10 10:22:03,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 10:22:03,989 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-10 10:22:03,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:03,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash -701955672, now seen corresponding path program 2 times [2024-11-10 10:22:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:03,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562955875] [2024-11-10 10:22:03,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:04,112 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-10 10:22:04,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:04,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562955875] [2024-11-10 10:22:04,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562955875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:22:04,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389084833] [2024-11-10 10:22:04,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:22:04,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:22:04,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:04,116 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-10 10:22:04,118 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-10 10:22:04,227 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 10:22:04,228 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:22:04,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:22:04,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:22:04,276 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-10 10:22:04,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:22:04,329 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-10 10:22:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389084833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:22:04,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:22:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 10:22:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9800447] [2024-11-10 10:22:04,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:22:04,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:22:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:22:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:22:04,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-10 10:22:04,339 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-10 10:22:04,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:04,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-10 10:22:04,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:04,476 INFO L124 PetriNetUnfolderBase]: 225/572 cut-off events. [2024-11-10 10:22:04,476 INFO L125 PetriNetUnfolderBase]: For 697/698 co-relation queries the response was YES. [2024-11-10 10:22:04,478 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-10 10:22:04,482 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 53 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2024-11-10 10:22:04,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 416 flow [2024-11-10 10:22:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:22:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:22:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-11-10 10:22:04,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5493827160493827 [2024-11-10 10:22:04,484 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 104 flow. Second operand 6 states and 89 transitions. [2024-11-10 10:22:04,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 416 flow [2024-11-10 10:22:04,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 65 transitions, 376 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-11-10 10:22:04,490 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 136 flow [2024-11-10 10:22:04,491 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-10 10:22:04,492 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 20 predicate places. [2024-11-10 10:22:04,493 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 136 flow [2024-11-10 10:22:04,493 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-10 10:22:04,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:04,493 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-10 10:22:04,512 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-10 10:22:04,694 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-10 10:22:04,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:04,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2090780435, now seen corresponding path program 3 times [2024-11-10 10:22:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:04,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331056481] [2024-11-10 10:22:04,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:04,879 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-10 10:22:04,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331056481] [2024-11-10 10:22:04,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331056481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:22:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863345539] [2024-11-10 10:22:04,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 10:22:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:22:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:04,883 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-10 10:22:04,885 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-10 10:22:05,012 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-10 10:22:05,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:22:05,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:22:05,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:22:05,084 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-10 10:22:05,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:22:05,194 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-10 10:22:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863345539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:22:05,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:22:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 10:22:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138897478] [2024-11-10 10:22:05,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:22:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:22:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:22:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:22:05,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-10 10:22:05,213 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-10 10:22:05,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:05,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-10 10:22:05,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:05,496 INFO L124 PetriNetUnfolderBase]: 601/1465 cut-off events. [2024-11-10 10:22:05,496 INFO L125 PetriNetUnfolderBase]: For 2943/2943 co-relation queries the response was YES. [2024-11-10 10:22:05,501 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-10 10:22:05,508 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 125 selfloop transitions, 12 changer transitions 0/143 dead transitions. [2024-11-10 10:22:05,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 143 transitions, 972 flow [2024-11-10 10:22:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:22:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:22:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2024-11-10 10:22:05,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5987654320987654 [2024-11-10 10:22:05,511 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 136 flow. Second operand 12 states and 194 transitions. [2024-11-10 10:22:05,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 143 transitions, 972 flow [2024-11-10 10:22:05,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 143 transitions, 884 flow, removed 33 selfloop flow, removed 1 redundant places. [2024-11-10 10:22:05,523 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 224 flow [2024-11-10 10:22:05,523 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-10 10:22:05,523 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 37 predicate places. [2024-11-10 10:22:05,524 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 224 flow [2024-11-10 10:22:05,524 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-10 10:22:05,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:05,524 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-10 10:22:05,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 10:22:05,729 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-10 10:22:05,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:05,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash -428479859, now seen corresponding path program 4 times [2024-11-10 10:22:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:05,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462492249] [2024-11-10 10:22:05,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:05,946 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-10 10:22:05,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:05,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462492249] [2024-11-10 10:22:05,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462492249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:22:05,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531234749] [2024-11-10 10:22:05,947 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 10:22:05,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:22:05,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:05,949 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-10 10:22:05,951 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-10 10:22:06,074 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 10:22:06,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:22:06,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 10:22:06,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:22:06,277 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-10 10:22:06,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:22:06,569 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-10 10:22:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531234749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:22:06,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:22:06,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 27 [2024-11-10 10:22:06,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054326389] [2024-11-10 10:22:06,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:22:06,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 10:22:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:06,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 10:22:06,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=451, Unknown=0, NotChecked=0, Total=702 [2024-11-10 10:22:06,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2024-11-10 10:22:06,590 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-10 10:22:06,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:06,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2024-11-10 10:22:06,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:10,126 INFO L124 PetriNetUnfolderBase]: 1702/4141 cut-off events. [2024-11-10 10:22:10,126 INFO L125 PetriNetUnfolderBase]: For 26906/26906 co-relation queries the response was YES. [2024-11-10 10:22:10,141 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-10 10:22:10,162 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 692 selfloop transitions, 258 changer transitions 0/955 dead transitions. [2024-11-10 10:22:10,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 955 transitions, 6446 flow [2024-11-10 10:22:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-11-10 10:22:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2024-11-10 10:22:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 1793 transitions. [2024-11-10 10:22:10,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5228929717118693 [2024-11-10 10:22:10,170 INFO L175 Difference]: Start difference. First operand has 60 places, 36 transitions, 224 flow. Second operand 127 states and 1793 transitions. [2024-11-10 10:22:10,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 955 transitions, 6446 flow [2024-11-10 10:22:10,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 955 transitions, 6410 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:22:10,198 INFO L231 Difference]: Finished difference. Result has 259 places, 299 transitions, 3258 flow [2024-11-10 10:22:10,198 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-10 10:22:10,199 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 236 predicate places. [2024-11-10 10:22:10,199 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 299 transitions, 3258 flow [2024-11-10 10:22:10,200 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-10 10:22:10,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:10,200 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-10 10:22:10,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 10:22:10,404 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-10 10:22:10,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:10,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -65183966, now seen corresponding path program 5 times [2024-11-10 10:22:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190297105] [2024-11-10 10:22:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:10,647 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-10 10:22:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190297105] [2024-11-10 10:22:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190297105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:22:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99346249] [2024-11-10 10:22:10,650 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 10:22:10,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:22:10,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:10,653 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-10 10:22:10,656 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-10 10:22:10,797 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-11-10 10:22:10,797 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:22:10,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 10:22:10,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:22:10,860 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-10 10:22:10,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:22:10,973 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-10 10:22:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99346249] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:22:10,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:22:10,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 10:22:10,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495896217] [2024-11-10 10:22:10,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:22:10,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 10:22:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 10:22:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-11-10 10:22:10,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-10 10:22:10,983 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-10 10:22:10,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:10,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-10 10:22:10,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:12,829 INFO L124 PetriNetUnfolderBase]: 2707/6200 cut-off events. [2024-11-10 10:22:12,829 INFO L125 PetriNetUnfolderBase]: For 174045/174231 co-relation queries the response was YES. [2024-11-10 10:22:12,885 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-10 10:22:12,915 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 341 selfloop transitions, 274 changer transitions 0/628 dead transitions. [2024-11-10 10:22:12,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 628 transitions, 7466 flow [2024-11-10 10:22:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 10:22:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 10:22:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 213 transitions. [2024-11-10 10:22:12,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2024-11-10 10:22:12,916 INFO L175 Difference]: Start difference. First operand has 259 places, 299 transitions, 3258 flow. Second operand 14 states and 213 transitions. [2024-11-10 10:22:12,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 628 transitions, 7466 flow [2024-11-10 10:22:13,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 628 transitions, 7106 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-10 10:22:13,186 INFO L231 Difference]: Finished difference. Result has 268 places, 426 transitions, 4940 flow [2024-11-10 10:22:13,186 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-10 10:22:13,187 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 245 predicate places. [2024-11-10 10:22:13,187 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 426 transitions, 4940 flow [2024-11-10 10:22:13,188 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-10 10:22:13,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:13,188 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-10 10:22:13,206 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-10 10:22:13,392 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-10 10:22:13,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:13,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1107773739, now seen corresponding path program 6 times [2024-11-10 10:22:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738277170] [2024-11-10 10:22:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:13,805 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-10 10:22:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738277170] [2024-11-10 10:22:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738277170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:22:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35488549] [2024-11-10 10:22:13,806 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 10:22:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:22:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:13,809 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-10 10:22:13,810 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-10 10:22:14,009 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-11-10 10:22:14,009 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:22:14,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 10:22:14,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:22:14,131 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-10 10:22:14,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:22:14,419 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-10 10:22:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35488549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:22:14,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:22:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2024-11-10 10:22:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815905692] [2024-11-10 10:22:14,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:22:14,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 10:22:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:14,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 10:22:14,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-10 10:22:14,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-10 10:22:14,437 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-10 10:22:14,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:14,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-10 10:22:14,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:17,235 INFO L124 PetriNetUnfolderBase]: 4393/9899 cut-off events. [2024-11-10 10:22:17,235 INFO L125 PetriNetUnfolderBase]: For 299501/299731 co-relation queries the response was YES. [2024-11-10 10:22:17,323 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-10 10:22:17,366 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 549 selfloop transitions, 442 changer transitions 0/1004 dead transitions. [2024-11-10 10:22:17,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1004 transitions, 12870 flow [2024-11-10 10:22:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 10:22:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-10 10:22:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 334 transitions. [2024-11-10 10:22:17,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5622895622895623 [2024-11-10 10:22:17,369 INFO L175 Difference]: Start difference. First operand has 268 places, 426 transitions, 4940 flow. Second operand 22 states and 334 transitions. [2024-11-10 10:22:17,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1004 transitions, 12870 flow [2024-11-10 10:22:17,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 1004 transitions, 12660 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 10:22:17,790 INFO L231 Difference]: Finished difference. Result has 293 places, 595 transitions, 8038 flow [2024-11-10 10:22:17,791 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-10 10:22:17,791 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 270 predicate places. [2024-11-10 10:22:17,791 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 595 transitions, 8038 flow [2024-11-10 10:22:17,792 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-10 10:22:17,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:17,792 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-10 10:22:17,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 10:22:17,992 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-10 10:22:17,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:22:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -431997741, now seen corresponding path program 7 times [2024-11-10 10:22:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859528443] [2024-11-10 10:22:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:22:18,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:22:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:22:18,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:22:18,222 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:22:18,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-10 10:22:18,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-10 10:22:18,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:22:18,234 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-11-10 10:22:18,406 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:22:18,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:22:18,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:22:18 BasicIcfg [2024-11-10 10:22:18,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:22:18,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:22:18,413 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:22:18,413 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:22:18,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:22:01" (3/4) ... [2024-11-10 10:22:18,414 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:22:18,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:22:18,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:22:18,533 INFO L158 Benchmark]: Toolchain (without parser) took 18331.26ms. Allocated memory was 176.2MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 119.6MB in the beginning and 467.7MB in the end (delta: -348.1MB). Peak memory consumption was 502.8MB. Max. memory is 16.1GB. [2024-11-10 10:22:18,533 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:22:18,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 697.96ms. Allocated memory is still 176.2MB. Free memory was 119.1MB in the beginning and 76.6MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-10 10:22:18,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.98ms. Allocated memory is still 176.2MB. Free memory was 76.6MB in the beginning and 74.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:22:18,534 INFO L158 Benchmark]: Boogie Preprocessor took 129.69ms. Allocated memory is still 176.2MB. Free memory was 74.0MB in the beginning and 143.0MB in the end (delta: -69.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-11-10 10:22:18,534 INFO L158 Benchmark]: IcfgBuilder took 640.80ms. Allocated memory is still 176.2MB. Free memory was 143.0MB in the beginning and 99.0MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-10 10:22:18,534 INFO L158 Benchmark]: TraceAbstraction took 16658.34ms. Allocated memory was 176.2MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 98.0MB in the beginning and 490.7MB in the end (delta: -392.7MB). Peak memory consumption was 459.6MB. Max. memory is 16.1GB. [2024-11-10 10:22:18,534 INFO L158 Benchmark]: Witness Printer took 119.99ms. Allocated memory is still 1.0GB. Free memory was 490.7MB in the beginning and 467.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 10:22:18,538 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 697.96ms. Allocated memory is still 176.2MB. Free memory was 119.1MB in the beginning and 76.6MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.98ms. Allocated memory is still 176.2MB. Free memory was 76.6MB in the beginning and 74.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.69ms. Allocated memory is still 176.2MB. Free memory was 74.0MB in the beginning and 143.0MB in the end (delta: -69.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * IcfgBuilder took 640.80ms. Allocated memory is still 176.2MB. Free memory was 143.0MB in the beginning and 99.0MB in the end (delta: 44.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16658.34ms. Allocated memory was 176.2MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 98.0MB in the beginning and 490.7MB in the end (delta: -392.7MB). Peak memory consumption was 459.6MB. Max. memory is 16.1GB. * Witness Printer took 119.99ms. Allocated memory is still 1.0GB. Free memory was 490.7MB in the beginning and 467.7MB 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.4s, 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, 0.9s 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.2s 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.8s 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-10 10:22:18,571 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