./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-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.4-dev-a340643-m [2024-01-27 16:17:12,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:17:13,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:17:13,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:17:13,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:17:13,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:17:13,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:17:13,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:17:13,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:17:13,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:17:13,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:17:13,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:17:13,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:17:13,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:17:13,070 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:17:13,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:17:13,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:17:13,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:17:13,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:17:13,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:17:13,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:17:13,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:17:13,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:17:13,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:17:13,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:17:13,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:17:13,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:17:13,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:17:13,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:17:13,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:17:13,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:17:13,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:17:13,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:17:13,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:17:13,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:17:13,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:17:13,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:17:13,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:17:13,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:17:13,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:17:13,077 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:17:13,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:17:13,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:17:13,077 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-01-27 16:17:13,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:17:13,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:17:13,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:17:13,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:17:13,340 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:17:13,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-01-27 16:17:14,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:17:14,703 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:17:14,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-01-27 16:17:14,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f163b5b73/1c86c8fde74d403ebfa1b299e92ebfd5/FLAG685b76c0b [2024-01-27 16:17:15,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f163b5b73/1c86c8fde74d403ebfa1b299e92ebfd5 [2024-01-27 16:17:15,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:17:15,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:17:15,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:17:15,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:17:15,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:17:15,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46224f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15, skipping insertion in model container [2024-01-27 16:17:15,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:17:15,239 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-01-27 16:17:15,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:17:15,497 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:17:15,505 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-01-27 16:17:15,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:17:15,609 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:17:15,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15 WrapperNode [2024-01-27 16:17:15,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:17:15,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:17:15,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:17:15,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:17:15,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,655 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-01-27 16:17:15,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:17:15,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:17:15,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:17:15,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:17:15,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,680 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-01-27 16:17:15,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:17:15,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:17:15,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:17:15,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:17:15,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (1/1) ... [2024-01-27 16:17:15,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:17:15,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:17:15,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:17:15,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:17:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:17:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:17:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:17:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:17:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:17:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:17:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-01-27 16:17:15,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-01-27 16:17:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:17:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:17:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:17:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:17:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:17:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:17:15,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:17:15,858 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:17:15,970 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:17:15,972 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:17:16,093 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:17:16,093 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:17:16,178 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:17:16,178 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:17:16,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:17:16 BoogieIcfgContainer [2024-01-27 16:17:16,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:17:16,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:17:16,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:17:16,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:17:16,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:17:15" (1/3) ... [2024-01-27 16:17:16,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ff6822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:17:16, skipping insertion in model container [2024-01-27 16:17:16,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:17:15" (2/3) ... [2024-01-27 16:17:16,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ff6822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:17:16, skipping insertion in model container [2024-01-27 16:17:16,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:17:16" (3/3) ... [2024-01-27 16:17:16,187 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-01-27 16:17:16,192 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:17:16,200 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:17:16,200 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:17:16,200 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:17:16,230 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-27 16:17:16,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 51 flow [2024-01-27 16:17:16,272 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2024-01-27 16:17:16,272 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:17:16,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 21 events. 3/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2024-01-27 16:17:16,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 51 flow [2024-01-27 16:17:16,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 18 transitions, 42 flow [2024-01-27 16:17:16,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:17:16,289 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a7db1fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:17:16,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-01-27 16:17:16,295 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:17:16,295 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2024-01-27 16:17:16,295 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:17:16,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:16,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:16,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:16,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1777308448, now seen corresponding path program 1 times [2024-01-27 16:17:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:16,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958921243] [2024-01-27 16:17:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:16,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958921243] [2024-01-27 16:17:16,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958921243] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:16,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:16,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:17:16,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669029384] [2024-01-27 16:17:16,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:16,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:17:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:17:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:17:16,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2024-01-27 16:17:16,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:16,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:16,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2024-01-27 16:17:16,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:16,714 INFO L124 PetriNetUnfolderBase]: 19/60 cut-off events. [2024-01-27 16:17:16,714 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:17:16,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 60 events. 19/60 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 6 based on Foata normal form. 3/59 useless extension candidates. Maximal degree in co-relation 90. Up to 29 conditions per place. [2024-01-27 16:17:16,716 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 14 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2024-01-27 16:17:16,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 23 transitions, 84 flow [2024-01-27 16:17:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:17:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:17:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-01-27 16:17:16,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-27 16:17:16,727 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 42 flow. Second operand 3 states and 44 transitions. [2024-01-27 16:17:16,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 23 transitions, 84 flow [2024-01-27 16:17:16,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 23 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:17:16,732 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 50 flow [2024-01-27 16:17:16,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2024-01-27 16:17:16,735 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2024-01-27 16:17:16,735 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 50 flow [2024-01-27 16:17:16,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:16,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:16,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:16,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:17:16,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:16,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2028765275, now seen corresponding path program 1 times [2024-01-27 16:17:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:16,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135002739] [2024-01-27 16:17:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:16,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:16,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135002739] [2024-01-27 16:17:16,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135002739] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:17:16,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:17:16,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:17:16,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480214635] [2024-01-27 16:17:16,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:17:16,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:17:16,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:16,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:17:16,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:17:16,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2024-01-27 16:17:16,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 50 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-01-27 16:17:16,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:16,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2024-01-27 16:17:16,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:16,830 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-01-27 16:17:16,830 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-01-27 16:17:16,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 82 events. 25/82 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 236 event pairs, 10 based on Foata normal form. 6/87 useless extension candidates. Maximal degree in co-relation 75. Up to 41 conditions per place. [2024-01-27 16:17:16,832 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 16 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2024-01-27 16:17:16,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 25 transitions, 108 flow [2024-01-27 16:17:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:17:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:17:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2024-01-27 16:17:16,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-27 16:17:16,833 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 3 states and 44 transitions. [2024-01-27 16:17:16,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 25 transitions, 108 flow [2024-01-27 16:17:16,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:17:16,834 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 60 flow [2024-01-27 16:17:16,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2024-01-27 16:17:16,835 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2024-01-27 16:17:16,835 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 60 flow [2024-01-27 16:17:16,835 INFO L496 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-01-27 16:17:16,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:16,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:16,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:17:16,836 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:16,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2115691270, now seen corresponding path program 1 times [2024-01-27 16:17:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:16,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185228127] [2024-01-27 16:17:16,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:16,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:17:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:16,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185228127] [2024-01-27 16:17:16,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185228127] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:17:16,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703540879] [2024-01-27 16:17:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:17:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:17:16,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:17:16,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 16:17:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:16,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 16:17:16,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:17:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:17:17,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:17:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:17:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703540879] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:17:17,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:17:17,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-01-27 16:17:17,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076455647] [2024-01-27 16:17:17,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:17:17,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 16:17:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:17,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 16:17:17,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-01-27 16:17:17,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-01-27 16:17:17,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 60 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:17,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:17,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-01-27 16:17:17,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:17,172 INFO L124 PetriNetUnfolderBase]: 76/219 cut-off events. [2024-01-27 16:17:17,172 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-01-27 16:17:17,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 219 events. 76/219 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 713 event pairs, 4 based on Foata normal form. 30/247 useless extension candidates. Maximal degree in co-relation 166. Up to 61 conditions per place. [2024-01-27 16:17:17,174 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 41 selfloop transitions, 33 changer transitions 0/80 dead transitions. [2024-01-27 16:17:17,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 80 transitions, 406 flow [2024-01-27 16:17:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 16:17:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 16:17:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 216 transitions. [2024-01-27 16:17:17,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-01-27 16:17:17,177 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 60 flow. Second operand 16 states and 216 transitions. [2024-01-27 16:17:17,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 80 transitions, 406 flow [2024-01-27 16:17:17,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 80 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:17:17,180 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 332 flow [2024-01-27 16:17:17,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=332, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-01-27 16:17:17,180 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 30 predicate places. [2024-01-27 16:17:17,181 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 332 flow [2024-01-27 16:17:17,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:17,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:17,181 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:17,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 16:17:17,393 WARN L477 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-01-27 16:17:17,394 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:17,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -476183002, now seen corresponding path program 2 times [2024-01-27 16:17:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367662390] [2024-01-27 16:17:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 16:17:17,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367662390] [2024-01-27 16:17:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367662390] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:17:17,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773965449] [2024-01-27 16:17:17,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:17:17,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:17:17,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:17:17,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:17:17,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 16:17:17,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:17:17,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:17:17,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 16:17:17,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:17:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 16:17:17,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:17:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 16:17:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773965449] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:17:17,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:17:17,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-01-27 16:17:17,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395882342] [2024-01-27 16:17:17,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:17:17,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 16:17:17,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:17,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 16:17:17,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-01-27 16:17:17,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-01-27 16:17:17,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 332 flow. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:17,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:17,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-01-27 16:17:17,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:17,911 INFO L124 PetriNetUnfolderBase]: 166/452 cut-off events. [2024-01-27 16:17:17,912 INFO L125 PetriNetUnfolderBase]: For 3168/3177 co-relation queries the response was YES. [2024-01-27 16:17:17,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 452 events. 166/452 cut-off events. For 3168/3177 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1566 event pairs, 10 based on Foata normal form. 30/476 useless extension candidates. Maximal degree in co-relation 1472. Up to 133 conditions per place. [2024-01-27 16:17:17,917 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 110 selfloop transitions, 36 changer transitions 0/152 dead transitions. [2024-01-27 16:17:17,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 152 transitions, 1486 flow [2024-01-27 16:17:17,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:17:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:17:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 172 transitions. [2024-01-27 16:17:17,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-01-27 16:17:17,918 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 332 flow. Second operand 12 states and 172 transitions. [2024-01-27 16:17:17,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 152 transitions, 1486 flow [2024-01-27 16:17:17,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 152 transitions, 1358 flow, removed 44 selfloop flow, removed 2 redundant places. [2024-01-27 16:17:17,933 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 552 flow [2024-01-27 16:17:17,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=552, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2024-01-27 16:17:17,934 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 46 predicate places. [2024-01-27 16:17:17,934 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 552 flow [2024-01-27 16:17:17,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:17,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:17,934 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:17,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 16:17:18,146 WARN L477 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-01-27 16:17:18,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:18,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash -716984954, now seen corresponding path program 3 times [2024-01-27 16:17:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662293969] [2024-01-27 16:17:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 16:17:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662293969] [2024-01-27 16:17:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662293969] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:17:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797286132] [2024-01-27 16:17:18,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:17:18,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:17:18,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:17:18,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:17:18,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 16:17:18,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-27 16:17:18,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:17:18,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 16:17:18,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:17:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-01-27 16:17:18,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:17:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-01-27 16:17:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797286132] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:17:18,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:17:18,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2024-01-27 16:17:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124961329] [2024-01-27 16:17:18,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:17:18,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 16:17:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 16:17:18,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-01-27 16:17:18,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-01-27 16:17:18,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 552 flow. Second operand has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:18,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:18,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-01-27 16:17:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:19,761 INFO L124 PetriNetUnfolderBase]: 435/1345 cut-off events. [2024-01-27 16:17:19,762 INFO L125 PetriNetUnfolderBase]: For 10513/10523 co-relation queries the response was YES. [2024-01-27 16:17:19,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4793 conditions, 1345 events. 435/1345 cut-off events. For 10513/10523 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7113 event pairs, 11 based on Foata normal form. 144/1477 useless extension candidates. Maximal degree in co-relation 3991. Up to 229 conditions per place. [2024-01-27 16:17:19,771 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 186 selfloop transitions, 204 changer transitions 0/402 dead transitions. [2024-01-27 16:17:19,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 402 transitions, 3528 flow [2024-01-27 16:17:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-01-27 16:17:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2024-01-27 16:17:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 1101 transitions. [2024-01-27 16:17:19,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5887700534759358 [2024-01-27 16:17:19,775 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 552 flow. Second operand 85 states and 1101 transitions. [2024-01-27 16:17:19,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 402 transitions, 3528 flow [2024-01-27 16:17:19,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 402 transitions, 3486 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:17:19,791 INFO L231 Difference]: Finished difference. Result has 209 places, 231 transitions, 2888 flow [2024-01-27 16:17:19,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=2888, PETRI_PLACES=209, PETRI_TRANSITIONS=231} [2024-01-27 16:17:19,791 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 189 predicate places. [2024-01-27 16:17:19,792 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 231 transitions, 2888 flow [2024-01-27 16:17:19,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.421052631578947) internal successors, (198), 19 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:19,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:19,792 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:19,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 16:17:20,004 WARN L477 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-01-27 16:17:20,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:20,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1084250523, now seen corresponding path program 4 times [2024-01-27 16:17:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:20,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734693923] [2024-01-27 16:17:20,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-01-27 16:17:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734693923] [2024-01-27 16:17:20,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734693923] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:17:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922830481] [2024-01-27 16:17:20,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 16:17:20,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:17:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:17:20,192 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-01-27 16:17:20,215 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-01-27 16:17:20,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 16:17:20,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:17:20,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 16:17:20,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:17:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-01-27 16:17:20,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:17:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-01-27 16:17:20,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922830481] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:17:20,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:17:20,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2024-01-27 16:17:20,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299129933] [2024-01-27 16:17:20,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:17:20,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-27 16:17:20,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:20,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-27 16:17:20,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-01-27 16:17:20,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-01-27 16:17:20,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 231 transitions, 2888 flow. Second operand has 23 states, 23 states have (on average 11.26086956521739) internal successors, (259), 23 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:20,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:20,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-01-27 16:17:20,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:21,049 INFO L124 PetriNetUnfolderBase]: 590/1614 cut-off events. [2024-01-27 16:17:21,049 INFO L125 PetriNetUnfolderBase]: For 133911/133976 co-relation queries the response was YES. [2024-01-27 16:17:21,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11982 conditions, 1614 events. 590/1614 cut-off events. For 133911/133976 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 8498 event pairs, 28 based on Foata normal form. 81/1675 useless extension candidates. Maximal degree in co-relation 10972. Up to 498 conditions per place. [2024-01-27 16:17:21,069 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 293 selfloop transitions, 150 changer transitions 0/461 dead transitions. [2024-01-27 16:17:21,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 461 transitions, 8252 flow [2024-01-27 16:17:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 16:17:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 16:17:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 315 transitions. [2024-01-27 16:17:21,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6508264462809917 [2024-01-27 16:17:21,081 INFO L175 Difference]: Start difference. First operand has 209 places, 231 transitions, 2888 flow. Second operand 22 states and 315 transitions. [2024-01-27 16:17:21,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 461 transitions, 8252 flow [2024-01-27 16:17:21,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 461 transitions, 7372 flow, removed 368 selfloop flow, removed 15 redundant places. [2024-01-27 16:17:21,253 INFO L231 Difference]: Finished difference. Result has 225 places, 290 transitions, 3396 flow [2024-01-27 16:17:21,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3396, PETRI_PLACES=225, PETRI_TRANSITIONS=290} [2024-01-27 16:17:21,254 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 205 predicate places. [2024-01-27 16:17:21,254 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 290 transitions, 3396 flow [2024-01-27 16:17:21,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.26086956521739) internal successors, (259), 23 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:21,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:21,254 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:21,268 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-01-27 16:17:21,466 WARN L477 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-01-27 16:17:21,466 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:21,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash 266259942, now seen corresponding path program 5 times [2024-01-27 16:17:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:21,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467248400] [2024-01-27 16:17:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 20 proven. 51 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-01-27 16:17:21,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467248400] [2024-01-27 16:17:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467248400] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:17:21,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830536674] [2024-01-27 16:17:21,604 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 16:17:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:17:21,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:17:21,640 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-01-27 16:17:21,644 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-01-27 16:17:21,727 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-01-27 16:17:21,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:17:21,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 16:17:21,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:17:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 20 proven. 51 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-01-27 16:17:21,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:17:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 20 proven. 51 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-01-27 16:17:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830536674] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:17:21,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:17:21,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-01-27 16:17:21,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642210286] [2024-01-27 16:17:21,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:17:21,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-27 16:17:21,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-27 16:17:21,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-01-27 16:17:21,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-01-27 16:17:21,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 290 transitions, 3396 flow. Second operand has 17 states, 17 states have (on average 10.294117647058824) internal successors, (175), 17 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:21,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:21,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-01-27 16:17:21,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:22,990 INFO L124 PetriNetUnfolderBase]: 1408/4010 cut-off events. [2024-01-27 16:17:22,990 INFO L125 PetriNetUnfolderBase]: For 623485/623493 co-relation queries the response was YES. [2024-01-27 16:17:23,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22229 conditions, 4010 events. 1408/4010 cut-off events. For 623485/623493 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 26102 event pairs, 168 based on Foata normal form. 382/4308 useless extension candidates. Maximal degree in co-relation 20661. Up to 741 conditions per place. [2024-01-27 16:17:23,047 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 620 selfloop transitions, 216 changer transitions 0/851 dead transitions. [2024-01-27 16:17:23,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 851 transitions, 12310 flow [2024-01-27 16:17:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 16:17:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 16:17:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 231 transitions. [2024-01-27 16:17:23,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-01-27 16:17:23,119 INFO L175 Difference]: Start difference. First operand has 225 places, 290 transitions, 3396 flow. Second operand 16 states and 231 transitions. [2024-01-27 16:17:23,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 851 transitions, 12310 flow [2024-01-27 16:17:23,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 851 transitions, 11804 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-01-27 16:17:23,659 INFO L231 Difference]: Finished difference. Result has 238 places, 398 transitions, 4722 flow [2024-01-27 16:17:23,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3242, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4722, PETRI_PLACES=238, PETRI_TRANSITIONS=398} [2024-01-27 16:17:23,660 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 218 predicate places. [2024-01-27 16:17:23,661 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 398 transitions, 4722 flow [2024-01-27 16:17:23,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.294117647058824) internal successors, (175), 17 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:23,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:23,661 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:23,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-01-27 16:17:23,872 WARN L477 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-01-27 16:17:23,875 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:23,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -11924568, now seen corresponding path program 6 times [2024-01-27 16:17:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:23,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704524833] [2024-01-27 16:17:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:17:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 20 proven. 287 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-01-27 16:17:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:17:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704524833] [2024-01-27 16:17:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704524833] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:17:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907246227] [2024-01-27 16:17:24,191 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 16:17:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:17:24,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:17:24,192 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-01-27 16:17:24,213 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-01-27 16:17:24,300 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-01-27 16:17:24,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:17:24,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-27 16:17:24,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:17:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 20 proven. 287 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-01-27 16:17:24,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:17:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 20 proven. 287 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-01-27 16:17:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907246227] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:17:24,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:17:24,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-01-27 16:17:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231891327] [2024-01-27 16:17:24,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:17:24,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-27 16:17:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:17:24,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-27 16:17:24,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-01-27 16:17:24,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 22 [2024-01-27 16:17:24,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 398 transitions, 4722 flow. Second operand has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:24,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:17:24,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 22 [2024-01-27 16:17:24,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:17:26,455 INFO L124 PetriNetUnfolderBase]: 1936/5504 cut-off events. [2024-01-27 16:17:26,455 INFO L125 PetriNetUnfolderBase]: For 653197/653215 co-relation queries the response was YES. [2024-01-27 16:17:26,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31265 conditions, 5504 events. 1936/5504 cut-off events. For 653197/653215 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 38416 event pairs, 174 based on Foata normal form. 298/5706 useless extension candidates. Maximal degree in co-relation 29135. Up to 1023 conditions per place. [2024-01-27 16:17:26,526 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 956 selfloop transitions, 288 changer transitions 0/1259 dead transitions. [2024-01-27 16:17:26,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 1259 transitions, 18848 flow [2024-01-27 16:17:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 16:17:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 16:17:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 313 transitions. [2024-01-27 16:17:26,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6466942148760331 [2024-01-27 16:17:26,528 INFO L175 Difference]: Start difference. First operand has 238 places, 398 transitions, 4722 flow. Second operand 22 states and 313 transitions. [2024-01-27 16:17:26,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 1259 transitions, 18848 flow [2024-01-27 16:17:27,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1259 transitions, 18688 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-01-27 16:17:27,542 INFO L231 Difference]: Finished difference. Result has 261 places, 482 transitions, 6298 flow [2024-01-27 16:17:27,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6298, PETRI_PLACES=261, PETRI_TRANSITIONS=482} [2024-01-27 16:17:27,544 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 241 predicate places. [2024-01-27 16:17:27,544 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 482 transitions, 6298 flow [2024-01-27 16:17:27,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:17:27,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:17:27,544 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:17:27,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-27 16:17:27,755 WARN L477 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-01-27 16:17:27,755 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:17:27,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:17:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash 511761288, now seen corresponding path program 7 times [2024-01-27 16:17:27,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:17:27,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441485550] [2024-01-27 16:17:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:17:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:17:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:17:27,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:17:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:17:27,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:17:27,935 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:17:27,935 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-01-27 16:17:27,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-01-27 16:17:27,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:17:27,938 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-01-27 16:17:27,942 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:17:27,942 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:17:28,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:17:28 BasicIcfg [2024-01-27 16:17:28,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:17:28,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:17:28,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:17:28,029 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:17:28,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:17:16" (3/4) ... [2024-01-27 16:17:28,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:17:28,092 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:17:28,092 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:17:28,093 INFO L158 Benchmark]: Toolchain (without parser) took 13070.89ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 960.5MB). Free memory was 120.1MB in the beginning and 710.9MB in the end (delta: -590.9MB). Peak memory consumption was 370.2MB. Max. memory is 16.1GB. [2024-01-27 16:17:28,093 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory was 86.1MB in the beginning and 86.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:17:28,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.66ms. Allocated memory is still 192.9MB. Free memory was 119.8MB in the beginning and 159.0MB in the end (delta: -39.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-01-27 16:17:28,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.68ms. Allocated memory is still 192.9MB. Free memory was 159.0MB in the beginning and 156.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:17:28,094 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 192.9MB. Free memory was 156.9MB in the beginning and 153.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:17:28,094 INFO L158 Benchmark]: RCFGBuilder took 488.70ms. Allocated memory is still 192.9MB. Free memory was 153.8MB in the beginning and 130.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 16:17:28,094 INFO L158 Benchmark]: TraceAbstraction took 11848.06ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 960.5MB). Free memory was 130.6MB in the beginning and 729.8MB in the end (delta: -599.2MB). Peak memory consumption was 361.3MB. Max. memory is 16.1GB. [2024-01-27 16:17:28,095 INFO L158 Benchmark]: Witness Printer took 63.57ms. Allocated memory is still 1.2GB. Free memory was 729.8MB in the beginning and 710.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-01-27 16:17:28,096 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.13ms. Allocated memory is still 123.7MB. Free memory was 86.1MB in the beginning and 86.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.66ms. Allocated memory is still 192.9MB. Free memory was 119.8MB in the beginning and 159.0MB in the end (delta: -39.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.68ms. Allocated memory is still 192.9MB. Free memory was 159.0MB in the beginning and 156.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 192.9MB. Free memory was 156.9MB in the beginning and 153.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.70ms. Allocated memory is still 192.9MB. Free memory was 153.8MB in the beginning and 130.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11848.06ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 960.5MB). Free memory was 130.6MB in the beginning and 729.8MB in the end (delta: -599.2MB). Peak memory consumption was 361.3MB. Max. memory is 16.1GB. * Witness Printer took 63.57ms. Allocated memory is still 1.2GB. Free memory was 729.8MB in the beginning and 710.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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 [arg={0:0}, myglobal=0, mythread={3:0}] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [arg={0:0}, i=0, myglobal=0, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=0, myglobal=0, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=0, myglobal=1, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=1, myglobal=1, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=1, myglobal=1, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=1, myglobal=2, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=2, myglobal=2, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=2, myglobal=2, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=2, myglobal=3, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=3, myglobal=3, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=3, myglobal=3, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=3, myglobal=4, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=4, myglobal=4, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=4, myglobal=4, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=4, myglobal=5, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=5, myglobal=5, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=5, myglobal=5, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=5, myglobal=6, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=6, myglobal=6, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=6, myglobal=6, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=6, myglobal=7, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=7, myglobal=7, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=7, myglobal=7, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=7, myglobal=8, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=8, myglobal=8, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=8, myglobal=8, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=8, myglobal=9, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=9, myglobal=9, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=9, myglobal=9, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=9, myglobal=10, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=10, myglobal=10, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=10, myglobal=10, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=10, myglobal=11, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=11, myglobal=11, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=11, myglobal=11, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=11, myglobal=12, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=12, myglobal=12, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=12, myglobal=12, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=12, myglobal=13, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=13, myglobal=13, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=13, myglobal=13, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=13, myglobal=14, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=14, myglobal=14, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=14, myglobal=14, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=14, myglobal=15, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=15, myglobal=15, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=15, myglobal=15, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=15, myglobal=16, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=16, myglobal=16, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=16, myglobal=16, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=16, myglobal=17, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=17, myglobal=17, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=17, myglobal=17, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=17, myglobal=18, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=18, myglobal=18, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=18, myglobal=18, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=18, myglobal=19, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=19, myglobal=19, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=19, myglobal=19, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=19, myglobal=20, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=20, myglobal=20, mythread={3:0}] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [arg={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1352] COND FALSE 0 !(i<20) [L1358] 0 \read(mythread) VAL [arg={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\result={0:0}, arg={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread={3:0}] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] [L13] 0 reach_error() VAL [\old(cond)=0, \result={0:0}, arg={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, 28 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: 11.7s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1155 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1142 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 993 IncrementalHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1 mSDtfsCounter, 993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1172 GetRequests, 991 SyntacticMatches, 14 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6298occurred in iteration=8, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1161 NumberOfCodeBlocks, 1118 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1454 ConstructedInterpolants, 0 QuantifiedInterpolants, 3264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 6467/8689 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:17:28,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE