./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:21:06,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:21:06,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:21:06,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:21:06,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:21:06,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:21:06,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:21:06,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:21:06,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:21:06,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:21:06,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:21:06,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:21:06,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:21:06,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:21:06,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:21:06,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:21:06,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:21:06,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:21:06,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:21:06,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:21:06,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:21:06,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:21:06,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:21:06,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:21:06,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:21:06,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:21:06,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:21:06,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:21:06,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:21:06,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:21:06,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:21:06,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:21:06,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:21:06,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:21:06,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:21:06,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:21:06,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:21:06,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:21:06,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:21:06,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:21:06,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:21:06,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:21:06,664 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2024-11-16 19:21:06,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:21:06,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:21:06,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:21:06,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:21:06,886 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:21:06,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-11-16 19:21:08,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:21:08,316 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:21:08,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-11-16 19:21:08,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c7bba4b9/1acde966ddd84d42845c05f302532b6f/FLAG337e568e2 [2024-11-16 19:21:08,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c7bba4b9/1acde966ddd84d42845c05f302532b6f [2024-11-16 19:21:08,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:21:08,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:21:08,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:21:08,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:21:08,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:21:08,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429e2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08, skipping insertion in model container [2024-11-16 19:21:08,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:21:08,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2024-11-16 19:21:08,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:21:08,760 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:21:08,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2024-11-16 19:21:08,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:21:08,891 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:21:08,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08 WrapperNode [2024-11-16 19:21:08,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:21:08,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:21:08,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:21:08,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:21:08,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,940 INFO L138 Inliner]: procedures = 272, calls = 95, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 262 [2024-11-16 19:21:08,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:21:08,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:21:08,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:21:08,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:21:08,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,973 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2024-11-16 19:21:08,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,981 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:21:08,989 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:21:08,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:21:08,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:21:08,990 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (1/1) ... [2024-11-16 19:21:08,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:21:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:21:09,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 19:21:09,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 19:21:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 19:21:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 19:21:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 19:21:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 19:21:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 19:21:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 19:21:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 19:21:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-16 19:21:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 19:21:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:21:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:21:09,074 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:21:09,214 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:21:09,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:21:09,473 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-16 19:21:09,473 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-16 19:21:09,535 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:21:09,535 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:21:09,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:21:09,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:21:09,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:21:09 BoogieIcfgContainer [2024-11-16 19:21:09,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:21:09,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:21:09,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:21:09,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:21:09,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:21:08" (1/3) ... [2024-11-16 19:21:09,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75311015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:21:09, skipping insertion in model container [2024-11-16 19:21:09,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:21:08" (2/3) ... [2024-11-16 19:21:09,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75311015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:21:09, skipping insertion in model container [2024-11-16 19:21:09,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:21:09" (3/3) ... [2024-11-16 19:21:09,793 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2024-11-16 19:21:09,806 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:21:09,806 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 19:21:09,806 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:21:09,882 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-16 19:21:09,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 118 transitions, 243 flow [2024-11-16 19:21:09,973 INFO L124 PetriNetUnfolderBase]: 49/176 cut-off events. [2024-11-16 19:21:09,973 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 19:21:09,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 176 events. 49/176 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 645 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 108. Up to 8 conditions per place. [2024-11-16 19:21:09,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 118 transitions, 243 flow [2024-11-16 19:21:09,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 116 transitions, 236 flow [2024-11-16 19:21:09,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:21:09,999 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e913e9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:21:09,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-16 19:21:10,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:21:10,010 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-11-16 19:21:10,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:21:10,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:10,011 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:10,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-16 19:21:10,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 801959123, now seen corresponding path program 1 times [2024-11-16 19:21:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112593263] [2024-11-16 19:21:10,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:21:10,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:10,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112593263] [2024-11-16 19:21:10,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112593263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:21:10,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:21:10,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:21:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714477776] [2024-11-16 19:21:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:21:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:21:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:10,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:21:10,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:21:10,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 118 [2024-11-16 19:21:10,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 116 transitions, 236 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:10,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:10,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 118 [2024-11-16 19:21:10,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:21:10,450 INFO L124 PetriNetUnfolderBase]: 507/1459 cut-off events. [2024-11-16 19:21:10,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:21:10,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 1459 events. 507/1459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10219 event pairs, 418 based on Foata normal form. 518/1908 useless extension candidates. Maximal degree in co-relation 2336. Up to 955 conditions per place. [2024-11-16 19:21:10,463 INFO L140 encePairwiseOnDemand]: 91/118 looper letters, 47 selfloop transitions, 0 changer transitions 0/89 dead transitions. [2024-11-16 19:21:10,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 89 transitions, 276 flow [2024-11-16 19:21:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:21:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 19:21:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2024-11-16 19:21:10,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6694915254237288 [2024-11-16 19:21:10,475 INFO L175 Difference]: Start difference. First operand has 87 places, 116 transitions, 236 flow. Second operand 2 states and 158 transitions. [2024-11-16 19:21:10,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 89 transitions, 276 flow [2024-11-16 19:21:10,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:21:10,480 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 182 flow [2024-11-16 19:21:10,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2024-11-16 19:21:10,484 INFO L277 CegarLoopForPetriNet]: 87 programPoint places, 1 predicate places. [2024-11-16 19:21:10,484 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 182 flow [2024-11-16 19:21:10,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:10,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:10,485 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:10,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:21:10,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-16 19:21:10,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1564046959, now seen corresponding path program 1 times [2024-11-16 19:21:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908811322] [2024-11-16 19:21:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:21:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908811322] [2024-11-16 19:21:10,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908811322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:21:10,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:21:10,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:21:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042086492] [2024-11-16 19:21:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:21:10,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:21:10,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:10,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:21:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:21:10,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 118 [2024-11-16 19:21:10,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:10,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:10,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 118 [2024-11-16 19:21:10,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:21:10,760 INFO L124 PetriNetUnfolderBase]: 507/1461 cut-off events. [2024-11-16 19:21:10,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:21:10,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 1461 events. 507/1461 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10222 event pairs, 418 based on Foata normal form. 0/1391 useless extension candidates. Maximal degree in co-relation 2419. Up to 956 conditions per place. [2024-11-16 19:21:10,767 INFO L140 encePairwiseOnDemand]: 115/118 looper letters, 47 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-11-16 19:21:10,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 282 flow [2024-11-16 19:21:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:21:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:21:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2024-11-16 19:21:10,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4887005649717514 [2024-11-16 19:21:10,769 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 182 flow. Second operand 3 states and 173 transitions. [2024-11-16 19:21:10,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 282 flow [2024-11-16 19:21:10,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:21:10,772 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 194 flow [2024-11-16 19:21:10,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2024-11-16 19:21:10,773 INFO L277 CegarLoopForPetriNet]: 87 programPoint places, 4 predicate places. [2024-11-16 19:21:10,773 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 194 flow [2024-11-16 19:21:10,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:10,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:10,774 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:10,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:21:10,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-16 19:21:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -559039863, now seen corresponding path program 1 times [2024-11-16 19:21:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229619717] [2024-11-16 19:21:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:21:10,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:10,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229619717] [2024-11-16 19:21:10,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229619717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:21:10,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922692171] [2024-11-16 19:21:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:10,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:21:10,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:21:10,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:21:10,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 19:21:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:10,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 19:21:10,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:21:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:21:10,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:21:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:21:10,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922692171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:21:10,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:21:10,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-16 19:21:10,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438592476] [2024-11-16 19:21:10,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:21:10,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:21:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:10,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:21:10,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:21:10,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 118 [2024-11-16 19:21:10,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 42.714285714285715) internal successors, (299), 7 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:10,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:10,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 118 [2024-11-16 19:21:10,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:21:11,208 INFO L124 PetriNetUnfolderBase]: 507/1467 cut-off events. [2024-11-16 19:21:11,209 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-16 19:21:11,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1467 events. 507/1467 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10205 event pairs, 418 based on Foata normal form. 0/1397 useless extension candidates. Maximal degree in co-relation 2436. Up to 956 conditions per place. [2024-11-16 19:21:11,214 INFO L140 encePairwiseOnDemand]: 115/118 looper letters, 47 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2024-11-16 19:21:11,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 310 flow [2024-11-16 19:21:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:21:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:21:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 301 transitions. [2024-11-16 19:21:11,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4251412429378531 [2024-11-16 19:21:11,218 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 194 flow. Second operand 6 states and 301 transitions. [2024-11-16 19:21:11,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 310 flow [2024-11-16 19:21:11,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 93 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:21:11,221 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 228 flow [2024-11-16 19:21:11,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-11-16 19:21:11,223 INFO L277 CegarLoopForPetriNet]: 87 programPoint places, 11 predicate places. [2024-11-16 19:21:11,223 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 228 flow [2024-11-16 19:21:11,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.714285714285715) internal successors, (299), 7 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:11,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:11,223 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:11,238 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-11-16 19:21:11,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:21:11,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-16 19:21:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1020205425, now seen corresponding path program 2 times [2024-11-16 19:21:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:11,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362260968] [2024-11-16 19:21:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:11,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:21:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362260968] [2024-11-16 19:21:11,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362260968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:21:11,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896356702] [2024-11-16 19:21:11,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:21:11,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:21:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:21:11,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:21:11,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 19:21:11,631 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 19:21:11,631 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:21:11,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 19:21:11,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:21:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:21:11,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:21:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:21:11,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896356702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:21:11,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:21:11,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-16 19:21:11,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296882323] [2024-11-16 19:21:11,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:21:11,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 19:21:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:11,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 19:21:11,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-16 19:21:11,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 118 [2024-11-16 19:21:11,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 228 flow. Second operand has 13 states, 13 states have (on average 42.38461538461539) internal successors, (551), 13 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:11,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:11,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 118 [2024-11-16 19:21:11,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:21:11,961 INFO L124 PetriNetUnfolderBase]: 507/1479 cut-off events. [2024-11-16 19:21:11,961 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-16 19:21:11,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 1479 events. 507/1479 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 10243 event pairs, 418 based on Foata normal form. 6/1416 useless extension candidates. Maximal degree in co-relation 2477. Up to 956 conditions per place. [2024-11-16 19:21:11,967 INFO L140 encePairwiseOnDemand]: 115/118 looper letters, 47 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2024-11-16 19:21:11,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 380 flow [2024-11-16 19:21:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 19:21:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 19:21:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 556 transitions. [2024-11-16 19:21:11,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3926553672316384 [2024-11-16 19:21:11,970 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 228 flow. Second operand 12 states and 556 transitions. [2024-11-16 19:21:11,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 380 flow [2024-11-16 19:21:11,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 99 transitions, 372 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-16 19:21:11,974 INFO L231 Difference]: Finished difference. Result has 114 places, 99 transitions, 304 flow [2024-11-16 19:21:11,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=304, PETRI_PLACES=114, PETRI_TRANSITIONS=99} [2024-11-16 19:21:11,975 INFO L277 CegarLoopForPetriNet]: 87 programPoint places, 27 predicate places. [2024-11-16 19:21:11,976 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 99 transitions, 304 flow [2024-11-16 19:21:11,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 42.38461538461539) internal successors, (551), 13 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:11,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:11,977 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:11,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 19:21:12,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-16 19:21:12,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-16 19:21:12,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1336283839, now seen corresponding path program 3 times [2024-11-16 19:21:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099989018] [2024-11-16 19:21:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:21:12,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:21:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:21:12,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:21:12,260 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:21:12,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-16 19:21:12,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-16 19:21:12,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-16 19:21:12,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-16 19:21:12,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:21:12,266 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-16 19:21:12,268 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 19:21:12,268 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 19:21:12,302 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 19:21:12,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 169 transitions, 354 flow [2024-11-16 19:21:12,332 INFO L124 PetriNetUnfolderBase]: 82/295 cut-off events. [2024-11-16 19:21:12,332 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 19:21:12,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 295 events. 82/295 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1350 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 178. Up to 12 conditions per place. [2024-11-16 19:21:12,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 169 transitions, 354 flow [2024-11-16 19:21:12,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 169 transitions, 354 flow [2024-11-16 19:21:12,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:21:12,339 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e913e9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:21:12,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-16 19:21:12,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:21:12,347 INFO L124 PetriNetUnfolderBase]: 19/91 cut-off events. [2024-11-16 19:21:12,347 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 19:21:12,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:12,347 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:12,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:21:12,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1769565215, now seen corresponding path program 1 times [2024-11-16 19:21:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:12,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908090821] [2024-11-16 19:21:12,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:12,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 19:21:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908090821] [2024-11-16 19:21:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908090821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:21:12,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:21:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:21:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971288252] [2024-11-16 19:21:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:21:12,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:21:12,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:12,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:21:12,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:21:12,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 169 [2024-11-16 19:21:12,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 169 transitions, 354 flow. Second operand has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:12,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:12,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 169 [2024-11-16 19:21:12,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:21:15,150 INFO L124 PetriNetUnfolderBase]: 20413/40742 cut-off events. [2024-11-16 19:21:15,150 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-16 19:21:15,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70280 conditions, 40742 events. 20413/40742 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 412802 event pairs, 17631 based on Foata normal form. 15761/54100 useless extension candidates. Maximal degree in co-relation 57531. Up to 29431 conditions per place. [2024-11-16 19:21:15,443 INFO L140 encePairwiseOnDemand]: 130/169 looper letters, 71 selfloop transitions, 0 changer transitions 0/130 dead transitions. [2024-11-16 19:21:15,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 130 transitions, 418 flow [2024-11-16 19:21:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:21:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 19:21:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2024-11-16 19:21:15,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6745562130177515 [2024-11-16 19:21:15,445 INFO L175 Difference]: Start difference. First operand has 126 places, 169 transitions, 354 flow. Second operand 2 states and 228 transitions. [2024-11-16 19:21:15,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 130 transitions, 418 flow [2024-11-16 19:21:15,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:21:15,449 INFO L231 Difference]: Finished difference. Result has 127 places, 130 transitions, 276 flow [2024-11-16 19:21:15,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=276, PETRI_PLACES=127, PETRI_TRANSITIONS=130} [2024-11-16 19:21:15,451 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 1 predicate places. [2024-11-16 19:21:15,451 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 130 transitions, 276 flow [2024-11-16 19:21:15,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:15,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:15,452 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:15,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:21:15,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:21:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash -677329272, now seen corresponding path program 1 times [2024-11-16 19:21:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891587729] [2024-11-16 19:21:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:15,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 19:21:15,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:15,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891587729] [2024-11-16 19:21:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891587729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:21:15,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:21:15,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:21:15,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471877618] [2024-11-16 19:21:15,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:21:15,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:21:15,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:15,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:21:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:21:15,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 169 [2024-11-16 19:21:15,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 130 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:15,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:15,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 169 [2024-11-16 19:21:15,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:21:17,777 INFO L124 PetriNetUnfolderBase]: 20413/40744 cut-off events. [2024-11-16 19:21:17,777 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2024-11-16 19:21:17,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70285 conditions, 40744 events. 20413/40744 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 413044 event pairs, 17631 based on Foata normal form. 0/38340 useless extension candidates. Maximal degree in co-relation 70280. Up to 29432 conditions per place. [2024-11-16 19:21:17,950 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 71 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-11-16 19:21:17,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 131 transitions, 424 flow [2024-11-16 19:21:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:21:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:21:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-11-16 19:21:17,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4891518737672584 [2024-11-16 19:21:17,951 INFO L175 Difference]: Start difference. First operand has 127 places, 130 transitions, 276 flow. Second operand 3 states and 248 transitions. [2024-11-16 19:21:17,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 131 transitions, 424 flow [2024-11-16 19:21:17,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 131 transitions, 424 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:21:17,955 INFO L231 Difference]: Finished difference. Result has 130 places, 131 transitions, 288 flow [2024-11-16 19:21:17,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=130, PETRI_TRANSITIONS=131} [2024-11-16 19:21:17,956 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2024-11-16 19:21:17,956 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 131 transitions, 288 flow [2024-11-16 19:21:17,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:17,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:17,957 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:17,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:21:17,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:21:17,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1551515040, now seen corresponding path program 1 times [2024-11-16 19:21:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140353502] [2024-11-16 19:21:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 19:21:18,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:18,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140353502] [2024-11-16 19:21:18,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140353502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:21:18,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248947020] [2024-11-16 19:21:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:18,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:21:18,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:21:18,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:21:18,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 19:21:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:18,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 19:21:18,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:21:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 19:21:18,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:21:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 19:21:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248947020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:21:18,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:21:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-16 19:21:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747223816] [2024-11-16 19:21:18,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:21:18,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:21:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:18,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:21:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:21:18,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 169 [2024-11-16 19:21:18,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:18,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:18,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 169 [2024-11-16 19:21:18,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:21:20,666 INFO L124 PetriNetUnfolderBase]: 20413/40750 cut-off events. [2024-11-16 19:21:20,667 INFO L125 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2024-11-16 19:21:20,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70304 conditions, 40750 events. 20413/40750 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 412867 event pairs, 17631 based on Foata normal form. 0/38346 useless extension candidates. Maximal degree in co-relation 70297. Up to 29432 conditions per place. [2024-11-16 19:21:20,842 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 71 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2024-11-16 19:21:20,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 452 flow [2024-11-16 19:21:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:21:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:21:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2024-11-16 19:21:20,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42110453648915186 [2024-11-16 19:21:20,844 INFO L175 Difference]: Start difference. First operand has 130 places, 131 transitions, 288 flow. Second operand 6 states and 427 transitions. [2024-11-16 19:21:20,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 452 flow [2024-11-16 19:21:20,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 134 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:21:20,846 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 322 flow [2024-11-16 19:21:20,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2024-11-16 19:21:20,847 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 11 predicate places. [2024-11-16 19:21:20,847 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 322 flow [2024-11-16 19:21:20,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:20,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:20,847 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:20,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 19:21:21,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:21:21,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:21:21,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -802344472, now seen corresponding path program 2 times [2024-11-16 19:21:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986835755] [2024-11-16 19:21:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:21,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 19:21:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986835755] [2024-11-16 19:21:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986835755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:21:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049339349] [2024-11-16 19:21:21,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:21:21,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:21:21,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:21:21,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:21:21,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 19:21:21,207 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 19:21:21,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:21:21,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 19:21:21,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:21:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 19:21:21,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:21:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 19:21:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049339349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:21:21,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:21:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-16 19:21:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748974954] [2024-11-16 19:21:21,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:21:21,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 19:21:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 19:21:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-16 19:21:21,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 169 [2024-11-16 19:21:21,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 322 flow. Second operand has 13 states, 13 states have (on average 59.46153846153846) internal successors, (773), 13 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:21,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:21,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 169 [2024-11-16 19:21:21,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:21:23,953 INFO L124 PetriNetUnfolderBase]: 20413/40762 cut-off events. [2024-11-16 19:21:23,953 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2024-11-16 19:21:24,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70348 conditions, 40762 events. 20413/40762 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 412977 event pairs, 17631 based on Foata normal form. 6/38365 useless extension candidates. Maximal degree in co-relation 70338. Up to 29432 conditions per place. [2024-11-16 19:21:24,143 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 71 selfloop transitions, 11 changer transitions 0/140 dead transitions. [2024-11-16 19:21:24,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 140 transitions, 522 flow [2024-11-16 19:21:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 19:21:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 19:21:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 784 transitions. [2024-11-16 19:21:24,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3865877712031558 [2024-11-16 19:21:24,147 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 322 flow. Second operand 12 states and 784 transitions. [2024-11-16 19:21:24,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 140 transitions, 522 flow [2024-11-16 19:21:24,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 140 transitions, 514 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-16 19:21:24,151 INFO L231 Difference]: Finished difference. Result has 153 places, 140 transitions, 398 flow [2024-11-16 19:21:24,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=398, PETRI_PLACES=153, PETRI_TRANSITIONS=140} [2024-11-16 19:21:24,152 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 27 predicate places. [2024-11-16 19:21:24,152 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 140 transitions, 398 flow [2024-11-16 19:21:24,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 59.46153846153846) internal successors, (773), 13 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:24,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:24,153 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:24,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 19:21:24,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:21:24,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:21:24,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2128003336, now seen corresponding path program 3 times [2024-11-16 19:21:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:24,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440519658] [2024-11-16 19:21:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:21:24,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:21:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:21:24,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:21:24,397 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:21:24,397 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-16 19:21:24,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-16 19:21:24,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-16 19:21:24,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-16 19:21:24,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-16 19:21:24,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:21:24,398 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-16 19:21:24,398 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 19:21:24,399 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 19:21:24,430 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 19:21:24,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 220 transitions, 467 flow [2024-11-16 19:21:24,460 INFO L124 PetriNetUnfolderBase]: 120/431 cut-off events. [2024-11-16 19:21:24,460 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 19:21:24,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 431 events. 120/431 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2161 event pairs, 1 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 303. Up to 16 conditions per place. [2024-11-16 19:21:24,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 220 transitions, 467 flow [2024-11-16 19:21:24,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 220 transitions, 467 flow [2024-11-16 19:21:24,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:21:24,468 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e913e9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:21:24,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-16 19:21:24,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:21:24,477 INFO L124 PetriNetUnfolderBase]: 32/147 cut-off events. [2024-11-16 19:21:24,477 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-16 19:21:24,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:21:24,661 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:21:24,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:21:24,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:21:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1463502057, now seen corresponding path program 1 times [2024-11-16 19:21:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:21:24,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314484866] [2024-11-16 19:21:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:21:24,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:21:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:21:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:21:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:21:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314484866] [2024-11-16 19:21:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314484866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:21:24,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:21:24,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:21:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040537467] [2024-11-16 19:21:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:21:24,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:21:24,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:21:24,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:21:24,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:21:24,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 220 [2024-11-16 19:21:24,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 220 transitions, 467 flow. Second operand has 2 states, 2 states have (on average 82.0) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:21:24,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:21:24,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 220 [2024-11-16 19:21:24,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand